Phys. Rev. A 67, 054303 (2003) [4 pages]Entanglement versus relaxation and decoherence in a quantum algorithm for quantum chaosReceived 17 January 2003; published 27 May 2003 We study analytically and numerically the behavior of the concurrence (a measure of the entanglement of formation) of a pair of qubits in a quantum computer operating an efficient algorithm for quantum chaos. Our results show that in an ideal algorithm the entanglement decays exponentially with the diffusive relaxation rate induced by classical chaos. This decay reaches a residual level which drops exponentially with increasing number of qubits nq. Decoherence destroys the residual entanglement with a rate exponential in nq. © 2003 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevA.67.054303
DOI:
10.1103/PhysRevA.67.054303
PACS:
03.67.Lx, 03.65.Yz, 03.67.Pp, 05.45.Mt
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.