Efficient Quantum Computing of Complex Dynamics
- 9 November 2001
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 87 (22) , 227901
- https://doi.org/10.1103/physrevlett.87.227901
Abstract
We propose a quantum algorithm which uses the number of qubits in an optimal way and efficiently simulates a physical model with rich and complex dynamics described by the quantum sawtooth map. The numerical study of the effect of static imperfections in the quantum computer hardware shows that the main elements of the phase space structures are accurately reproduced up to a time scale which is polynomial in the number of qubits. The errors generated by these imperfections are more significant than the errors of random noise in gate operations.Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Emergence of quantum chaos in the quantum computer core and how to manage itPhysical Review E, 2000
- Quantum chaos border for quantum computingPhysical Review E, 2000
- Implementation of a three-quantum-bit search algorithmApplied Physics Letters, 2000
- Time Dynamics in Chaotic Many-body Systems: Can Chaos Destroy a Quantum Computer?Australian Journal of Physics, 2000
- Quantum localization and cantori in the stadium billiardPhysical Review E, 1999
- Quasiclassical surface of section perturbation theoryPhysical Review E, 1999
- Using a quantum computer to investigate quantum chaosPhysical Review A, 1998
- Quantum computingReports on Progress in Physics, 1998
- Relation between quantum and classical thresholds for multiphoton ionization of excited atomsPhysical Review A, 1988
- Evolution and exact eigenstates of a resonant quantum systemPhysical Review A, 1986