Proof of efficient, parallelized, universal adiabatic quantum computation

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 $H(\lambda )$ 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.

Reference added, very minor text changes

References in corpus (4)

• Adiabatic Quantum Computing
• 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

Cited by in corpus (2)

• Realization of Heisenberg models of spin systems with polar molecules in pendular states
• Improving nonstoquastic quantum annealing with spin-reversal transformations