SIAM Journal on Computing
Adiabatic quantum state generation and statistical zero knowledge
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Exponential algorithmic speedup by a quantum walk
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Quantum information processing in continuous time
Quantum information processing in continuous time
The Complexity of the Local Hamiltonian Problem
SIAM Journal on Computing
Simulating sparse Hamiltonians with star decompositions
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
Black-box hamiltonian simulation and unitary implementation
Quantum Information & Computation
Quantum Computing since Democritus
Quantum Computing since Democritus
| Hi-index | 0.00 |
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