Performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs

被引：88

作者：

Farhi, Edward ^{[1
]}

Gosset, David ^{[2
,3
]}

Hen, Itay ^{[4
]}

Sandvik, A. W. ^{[5
]}

Shor, Peter ^{[6
,7
]}

Young, A. P. ^{[4
]}

Zamponi, Francesco ^{[8
,9
]}

机构：

[1] MIT, Ctr Theoret Phys, Cambridge, MA 02139 USA

[2] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada

[3] Univ Waterloo, Inst Quantum Comp, Waterloo, ON N2L 3G1, Canada

[4] Univ Calif Santa Cruz, Dept Phys, Santa Cruz, CA 95064 USA

[5] Boston Univ, Dept Phys, Boston, MA 02215 USA

[6] MIT, CSAIL, Cambridge, MA 02139 USA

[7] MIT, Dept Math, Ctr Theoret Phys, Cambridge, MA 02139 USA

[8] CNRS, UMR 8549, Phys Theor Lab, FR-75231 Paris 05, France

[9] Ecole Normale Super, FR-75231 Paris 05, France

来源：

PHYSICAL REVIEW A | 2012年 / 86卷 / 05期

基金：

美国国家科学基金会;

关键词：

COMPLEXITY; GAPS;

D O I：

10.1103/PhysRevA.86.052334

中图分类号：

O43 [光学];

学科分类号：

070207 ; 0803 ;

摘要：

In this paper we study the performance of the quantum adiabatic algorithm on random instances of two combinatorial optimization problems, 3-regular 3-XORSAT and 3-regular max-cut. The cost functions associated with these two clause-based optimization problems are similar as they are both defined on 3-regular hypergraphs. For 3-regular 3-XORSAT the clauses contain three variables and for 3-regular max-cut the clauses contain two variables. The quantum adiabatic algorithms we study for these two problems use interpolating Hamiltonians which are amenable to sign-problem free quantum Monte Carlo and quantum cavity methods. Using these techniques we find that the quantum adiabatic algorithm fails to solve either of these problems efficiently, although for different reasons.

引用

页数：17

共 51 条

[31] Simple glass models and their quantum annealing [J].