Entanglement versus relaxation and decoherence in a quantum algorithm for quantum chaos

2003/01/31 by S. Bettelli, D. L. Shepelyansky · 1 citation
Physics and Astronomy · #quant-ph #cond-mat #nlin.CD

paper · pdf · doi:10.1103/physreva.67.054303

published as Phys.Rev.A 67, 054303 (2003) · research at Quantware MIPS Center http://www.quantware.ups-tlse.fr, revtex, 5 pages, 5 figures, accepted for publication on PRA

arxiv created 2003/03/27 · arxiv updated 2009/11/30

Abstract

We study analytically and numerically the behavior of quantum entanglement 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 goes down to a residual level which drops exponentially with the number of qubits n_q. Decoherence destroys the residual entanglement with a rate exponential in n_q.

Cited by

• Tsallis relative α entropy of coherence dynamics in Grover′s search algorithm