Efficient Algorithms for Universal Quantum Simulation
arXiv:1307.1498 · doi:10.1007/978-3-642-38986-3_1
Abstract
A universal quantum simulator would enable efficient simulation of quantum dynamics by implementing quantum-simulation algorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that closely approximate physical states obtained from a broad class of dynamical evolutions. I provide an overview of theoretical research into universal quantum simulators and the strategies for minimizing computational space and time costs. Applications to simulating many-body quantum simulation and solving linear equations are discussed.
References in corpus (8)
- Quantum algorithm for solving linear systems of equations
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Quantum Algorithms for Quantum Field Theories
- Higher Order Decompositions of Ordered Operator Exponentials
- Simulating sparse Hamiltonians with star decompositions
- Quantum-circuit design for efficient simulations of many-body quantum dynamics
- On continuous variable quantum algorithms for oracle identification problems