Quantum computing of semiclassical formulas
arXiv:0801.4660 · doi:10.1103/PhysRevE.77.046218
Abstract
We show that semiclassical formulas such as the Gutzwiller trace formula can be implemented on a quantum computer more efficiently than on a classical device. We give explicit quantum algorithms which yield quantum observables from classical trajectories, and which alternatively test the semiclassical approximation by computing classical actions from quantum evolution. The gain over classical computation is in general quadratic, and can be larger in some specific cases.
8 pages, 1 figure
References in corpus (16)
- Quantum Mechanics helps in searching for a needle in a haystack
- Quantum Computing
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- Fidelity Decay as an Efficient Indicator of Quantum Chaos
- Using a quantum computer to investigate quantum chaos
- Efficient Quantum Computing of Complex Dynamics
- Exponential Gain in Quantum Computing of Quantum Chaos and Localization
- Quantum Computing of Classical Chaos: Smile of the Arnold-Schrodinger Cat
- Quantum Computing of Quantum Chaos in the Kicked Rotator Model
- Testing integrability with a single bit of quantum information
- On the Accuracy of the Semiclassical Trace Formula
- Quantum computation and analysis of Wigner and Husimi functions: toward a quantum image treatment
- Spectral properties of Dissipative Chaotic Quantum Maps
- Quantum Computing of Poincare Recurrences and Periodic Orbits
- Intermediate quantum maps for quantum computation
- Semiclassics for a Dissipative Quantum Map