Realizable Hamiltonians for universal adiabatic quantum computers

被引:113
作者
Biamonte, Jacob D. [1 ]
Love, Peter J. [2 ]
机构
[1] Univ Oxford, Comp Lab, Oxford OX1 3QD, England
[2] Haverford Coll, Dept Phys, Haverford, PA 19041 USA
来源
PHYSICAL REVIEW A | 2008年 / 78卷 / 01期
关键词
D O I
10.1103/PhysRevA.78.012352
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
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 sigma(x)sigma(x) coupling. We also show the universality and QMA-completeness of spin models with only one-local sigma(z) and sigma(x) fields and two-local sigma(z)sigma(x) interactions.
引用
收藏
页数:7
相关论文
共 25 条
[1]   Adiabatic quantum computation is equivalent to standard quantum computation [J].
Aharonov, Dorit ;
Van Dam, Wim ;
Kempe, Julia ;
Landau, Zeph ;
Lloyd, Seth ;
Regev, Oded .
SIAM JOURNAL ON COMPUTING, 2007, 37 (01) :166-194
[2]  
AMBAINIS A, ARXIVQUANTPH0411152
[3]  
[Anonymous], UNPUB
[4]   Variable electrostatic transformer: Controllable coupling of two charge qubits [J].
Averin, DV ;
Bruder, C .
PHYSICAL REVIEW LETTERS, 2003, 91 (05) :570031-570034
[5]   ON THE COMPUTATIONAL-COMPLEXITY OF ISING SPIN-GLASS MODELS [J].
BARAHONA, F .
JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1982, 15 (10) :3241-3253
[6]   CONDITIONAL QUANTUM DYNAMICS AND LOGIC GATES [J].
BARENCO, A ;
DEUTSCH, D ;
EKERT, A ;
JOZSA, R .
PHYSICAL REVIEW LETTERS, 1995, 74 (20) :4083-4086
[7]   Simple nearest-neighbor two-body Hamiltonian system for which the ground state is a universal resource for quantum computation [J].
Bartlett, Stephen D. ;
Rudolph, Terry .
PHYSICAL REVIEW A, 2006, 74 (04)
[8]   Quantum complexity theory [J].
Bernstein, E ;
Vazirani, U .
SIAM JOURNAL ON COMPUTING, 1997, 26 (05) :1411-1473
[9]  
Bravyi S., ARXIVQUANTPH0606140
[10]   Quantum annealing of a disordered magnet [J].
Brooke, J ;
Bitko, D ;
Rosenbaum, TF ;
Aeppli, G .
SCIENCE, 1999, 284 (5415) :779-781