Exponential Gain in Quantum Computing of Quantum Chaos and Localization

Preprint

2 October 2000

preprint
Published by arXiv in arXiv

Abstract

We present a quantum algorithm which simulates the quantum kicked rotator model exponentially faster than classical algorithms. This shows that important physical problems of quantum chaos, localization and Anderson transition can be modelled efficiently on a quantum computer. We also show that a similar algorithm simulates efficiently classical chaos in certain area-preserving maps.

Keywords

SIMULATES EFFICIENTLY
ANDERSON TRANSITION
QUANTUM COMPUTING
EXPONENTIAL GAIN
CLASSICAL CHAOS
PRESERVING MAPS
QUANTUM CHAOS
ALGORITHM

All Related Versions

Version 1, 2000-10-02, ArXiv
Version 2, 2001-03-26, ArXiv
Published version: Physical Review Letters, 86 (13), 2890.

This publication has 0 references indexed in Scilit: