Quantum computing classical physics
From MaRDI portal
Publication:4545346
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.
Recommendations
Cited in
(15)- Quantum computing with classical bits
- Simulating quantum mechanics on a quantum computer.
- Algorithmic container for physics
- scientific article; zbMATH DE number 1406112 (Why is no real title available?)
- The Semi-Quantum Computer
- From Dirac to diffusion: decoherence in quantum lattice gases
- Quantum analogue computing
- Simple digital quantum algorithm for symmetric first-order linear hyperbolic systems
- Vibration analysis of cyclic symmetrical systems by quantum algorithms
- Optimizing quantum models of classical channels: the reverse Holevo problem
- A quantum algorithm for the lattice-Boltzmann method advection-diffusion equation
- Physical quantum algorithms
- Quantum computing algorithm for electromagnetic field simulation
- An exact energy conservation property of the quantum lattice Boltzmann algorithm
- Quantum Simulations of Physics Problems
This page was built for publication: Quantum computing classical physics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4545346)