Realizable Hamiltonians for universal adiabatic quantum computers
- 28 July 2008
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 78 (1), 012352
- https://doi.org/10.1103/physreva.78.012352
Abstract
It has been established that local lattice spin Hamiltonians can be used for universal adiabatic quantum computation. However, the two-local model Hamiltonians used in these proofs are general and hence do not limit the types of interactions required between spins. To address this concern, the present paper provides two simple model Hamiltonians that are of practical interest to experimentalists working toward the realization of a universal adiabatic quantum computer. The model Hamiltonians presented are the simplest known quantum-Merlin-Arthur-complete (QMA-complete) two-local Hamiltonians. The two-local Ising model with one-local transverse field which has been realized using an array of technologies, is perhaps the simplest quantum spin model but is unlikely to be universal for adiabatic quantum computation. We demonstrate that this model can be rendered universal and QMA-complete by adding a tunable two-local transverse coupling. We also show the universality and QMA-completeness of spin models with only one-local and fields and two-local interactions.
Keywords
Other Versions
This publication has 19 references indexed in Scilit:
- Simple Proof of Equivalence between Adiabatic Quantum Computation and the Circuit ModelPhysical Review Letters, 2007
- Quantum annealing of the random-field Ising model by transverse ferromagnetic interactionsPhysical Review E, 2007
- Spin-particles moving on a two-dimensional lattice with nearest-neighbor interactions can realize an autonomous quantum computerPhysical Review A, 2007
- A toolbox for lattice-spin models with polar moleculesNature Physics, 2006
- Variable Electrostatic Transformer: Controllable Coupling of Two Charge QubitsPhysical Review Letters, 2003
- Quantum Annealing of a Disordered MagnetScience, 1999
- Conditional Quantum Dynamics and Logic GatesPhysical Review Letters, 1995
- Quantum Mechanical ComputersOptics News, 1985
- Optimization by Simulated AnnealingScience, 1983
- On the computational complexity of Ising spin glass modelsJournal of Physics A: General Physics, 1982