Quantum computing classical physics

Abstract

In the past decade quantum algorithms have been found which outperform the best classical solutions known for certain classical problems as well as the best classical methods known for simulation of certain quantum systems. This suggests that they may also speed up the simulation of some classical systems. I describe one class of discrete quantum algorithms which do so--quantum lattice gas automata--and show how to implement them efficiently on standard quantum computers.

13 pages, plain TeX, 10 PostScript figures included with epsf.tex; for related work see http://math.ucsd.edu/~dmeyer/research.html

References in corpus (12)

• The Physical Implementation of Quantum Computation
• Quantum Computation and Decision Trees
• Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
• An approximate Fourier transform useful in quantum factoring
• Simulations of Many-Body Quantum Systems by a Quantum Computer
• Simulating Ising Spin Glasses on a Quantum Computer
• On the absence of homogeneous scalar unitary cellular automata
• Quantum mechanics of lattice gas automata. I. One particle plane waves and potentials
• Quantum lattice gases and their invariants
• Quantum Algorithms for Weighing Matrices and Quadratic Residues
• Quantum mechanics of lattice gas automata. II. Boundary conditions and other inhomogeneities
• From gauge transformations to topology computation in quantum lattice gas automata