Exponential Speedup with a Single Bit of Quantum Information: Measuring the Average Fidelity Decay
Authors:
- 30 April 2004
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 92 (17) , 177906
Abstract
We present an efficient quantum algorithm to measure the average fidelity decay of a quantum map under perturbation using a single bit of quantum information. Our algorithm scales only as the complexity of the map under investigation. Thus for those maps admitting an efficient gate decomposition, it provides an exponential speedup over known classical procedures. Fidelity decay is important in the study of complex dynamical systems, where it is conjectured to be a signature of eigenvector statistics. Our result also illustrates the role of chaos in the process of decoherence.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Testing integrability with a single bit of quantum informationPhysical Review A, 2003
- Quantum and Classical Correlations in Quantum Brownian MotionPhysical Review Letters, 2002
- Efficient Quantum Computing of Complex DynamicsPhysical Review Letters, 2001
- Exponential Gain in Quantum Computing of Quantum Chaos and LocalizationPhysical Review Letters, 2001
- Environment-Independent Decoherence Rate in Classically Chaotic SystemsPhysical Review Letters, 2001
- NMR Based Quantum Information Processing: Achievements and ProspectsFortschritte der Physik, 2000
- Quantum error detection .I. Statement of the problemIEEE Transactions on Information Theory, 2000
- Using a quantum computer to investigate quantum chaosPhysical Review A, 1998
- Simulating quantum systems on a quantum computerProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Stability of quantum motion in chaotic and regular systemsPhysical Review A, 1984