Quantum computing of semiclassical formulas

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 (4)

• Quantum Computing of Quantum Chaos in the Kicked Rotator Model
• Quantum computation and analysis of Wigner and Husimi functions: toward a quantum image treatment
• Quantum Computing of Poincare Recurrences and Periodic Orbits
• Intermediate quantum maps for quantum computation