Quantum Computing Classical Physics
Abstract
In the past decade, quantum algorithms have been found that 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 also may speed up the simulation of some classical systems. The author describes one class of discrete quantum algorithms that does that (quantum lattice gas automata), and shows how to implement them efficiently on standard quantum computers.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 30, 2004
- Accession Number
- ADA430506
Entities
People
- David A. Meyer
Organizations
- University of California, San Diego