Proof of efficient, parallelized, universal adiabatic quantum computation
arXiv:1807.10379 · doi:10.1103/PhysRevA.99.022311
Abstract
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian that is based on ground state quantum computation [1]. We treat both a 1-dimensional configuration in which qubits on a line undergo nearest neighbor 2-qubit gates and an all-to-all configuration in which every qubit undergoes 2-qubit gates with every other qubit in the system.
arXiv commentReference added, very minor text changes
References in corpus (9)
- Quantum Annealing in the Transverse Ising Model
- Adiabatic Quantum Computing
- Quantum Annealing and Analog Quantum Computation
- Bounds for the adiabatic approximation with applications to quantum computation
- Simple proof of equivalence between adiabatic quantum computation and the circuit model
- Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction
- Ground State Quantum Computation
- Space-Time Circuit-to-Hamiltonian Construction and Its Applications
- Mimicking Time Evolution within a Quantum Ground State: Ground-State Quantum Computation, Cloning, and Teleportation