Quantum computing classical physics
- 15 March 2002
- journal article
- Published by The Royal Society in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 360 (1792) , 395-405
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.Keywords
All Related Versions
This publication has 34 references indexed in Scilit:
- Quantum Algorithms for Weighing Matrices and Quadratic ResiduesAlgorithmica, 2002
- From gauge transformations to topology computation in quantum lattice gas automataJournal of Physics A: General Physics, 2001
- Quantum algorithms for fermionic simulationsPhysical Review A, 2001
- Quantum lattice-gas model for computational fluid dynamicsPhysical Review E, 2001
- Quantum mechanics of lattice gas automata: boundary conditions and other inhomogeneitiesJournal of Physics A: General Physics, 1998
- Simulating quantum systems on a quantum computerProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Simulating Ising spin glasses on a quantum computerPhysical Review E, 1997
- Quantum mechanics of lattice gas automata: One-particle plane waves and potentialsPhysical Review E, 1997
- Quantum mechanical computersFoundations of Physics, 1986
- Bicontinuous extensions of invertible combinatorial functionsTheory of Computing Systems, 1981