Ising formulations of many NP problems

Frontiers in Physics

Volumn 2, Issue , 2014, Pages 1-14

  Lucas, Andrew ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Adiabatic quantum computation; Algorithms; Complexity theory; NP; Spin glasses

Indexed keywords

COMPUTATIONAL COMPLEXITY; QUANTUM COMPUTERS; SPIN GLASS;

ADIABATIC QUANTUM COMPUTATION; COMPLEXITY THEORY; NP; NP COMPLETE; NP PROBLEMS; OPTIMIZATION ALGORITHMS; QUANTUM OPTIMIZATION; SATISFIABILITY; SPIN-GLASS;

ISING MODEL;

EID: 84937141373     PISSN: None     EISSN: 2296424X     Source Type: Journal    
DOI: 10.3389/fphy.2014.00005     Document Type: Article

References (64)

1. Farhi E, Goldstone J, Gutmann S, Lapan J, Lundgren A, Preda D. A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science (2001) 292:472. doi: 10.1126/science.1057726
2. Das A, Chakrabarti BK. Colloquium: quantum annealing and analog quantum computation. Rev Mod Phy. (2008) 80:1061. doi: 10.1103/RevModPhys.80.1061
3. Altshuler B, Krovi H, Roland J. Anderson localization makes adiabatic quantum optimization fail. Proc Natl Acad Sci USA. (2010) 107:12446. doi: 10.1073/pnas.1002116107
4. Dickson NG, Amin MHS. Does adiabatic quantum optimization fail for NP-complete problems?. Phys Rev Lett. (2011) 106:050502. doi: 10.1103/PhysRevLett.106.050502
5. Bapst V, Foini L, Krzakala F, Semerjian G, Zamponi F. The quantum adiabatic algorithm applied to random optimization problems: the quantum spin glass perspective. Phys Rep. (2013) 523:127. doi: 10.1016/j.physrep.2012.10.002
6. Farhi E, Goldstone J, Gosset D, Gutmann S, Shor P. Unstructured randomness, small gaps and localization. Quantum Comput Inform. (2011) 11:840. Available online at:http://arxiv.org/abs/1010.0009
7. Farhi E, Gosset D, Hen I, Sandvik AW, Shor P, Young AP, et al. The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs. Phys Rev. (2012) A86:052334. doi: 10.1103/PhysRevA.86.052334
8. Hen I, Young AP. Exponential complexity of the quantum adiabatic algorithm for certain satisfiability problems. Phys Rev. (2011) E84:061152. doi: 10.1103/PhysRevE.84.061152
9. Jorg T, Krzakala F, Semerjian G, Zamponi F. First-order transitions and the performance of quantum algorithms in random optimization problems. Phys Rev Lett. (2010) 104:207206. doi: 10.1103/PhysRevLett.104.207206
10. Santoro GE, Martonak R, Tosatti E, Car R. Theory of quantum annealing of an Ising spin glass. Science (2002) 295:2427. doi: 10.1126/science.1068774
11. Boixo S, Albash T, Spedalieri FM, Chancellor N, Lidar DA. Experimental signature of programmable quantum annealing. Nat Commun. (2013) 4:3067. doi: 10.1038/ncomms3067
12. Boixo S, Rønnow TF, Isakov SV, Wang Z, Wecker D, Lidar DA, et al. Quantum annealing with more than one hundred qubits (2013). Available online at: http://arxiv.org/abs/1304.4595
13. Johnson MW, Amin MHS, Gildert S, Lanting T, Hamze F, Dickson N, et al. Quantum annealing with manufactured spins. Nature (2011) 473:194. doi: 10.1038/nature10012
14. Whitfield JD, Faccin M, Biamonte JD. Ground state spin logic. Europhys Lett. (2012)99:57004. doi: 10.1209/0295-5075/99/57004
15. Biamonte JD, Love PJ. Realizable Hamiltonians for universal adiabatic quantum computers. Phys Rev. (2008) A78:012352. doi: 10.1103/PhysRevA.78.012352
16. Bravyi S, DiVincenzo DP, Oliveira RI, Terhal BM. The complexity of stoquastic local Hamiltonian problems. Quantum Inform Comput. (2008) 8:0361. Available online at:http://arxiv.org/abs/quant-ph/0606140
17. Barahona F. On the computational complexity of Ising spin glass models. J Phys. (1982)A15:3241.
18. Karp RM. Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, and Bohlinger JD, editors. Complexity of Computer Computations. New York, NY: Plenum Press (1972), p. 85. doi: 10.1007/978-1-4684-2001-2_9
19. Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA : W.H. Freeman (1979).
20. Fu Y, Anderson PW. Application of statistical mechanics to NP-complete problems in combinatorial optimisation. J Phys. (1986) A19:1605.
21. Mézard M, Parisi G, Virasoro M. Spin Glass Theory and Beyond. Singapore: World Scientific (1987).
22. Hartmann AK, Weigt M. Phase Transitions in Combinatorial Optimization Problems: Basics, Algorithms and Statistical Mechanics. Weinheim: Wiley-VCH (2006).
23. Kirkpatrick S, Gelatt CD, Vecchi MP. Optimization by simulated annealing. Science (1983)220:671. doi: 10.1126/science.220.4598.671
24. Mézard M, Montanari A. Information, Physics and Computation. Oxford: Oxford University Press (2009). doi: 10.1093/acprof:oso/9780198570837.001.0001
25. Bryngelson JD, Wolynes PG. Spin glasses and the statistical mechanics of protein folding. Proc Natl Acad Sci USA. (1987) 84:7524. doi: 10.1073/pnas.84.21.7524
26. Berger B, Leighton T. Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete. J Comput Biol. (1998) 5:27. doi: 10.1089/cmb.1998.5.27
27. Hopfield JJ. Neural networks and physical systems with emergent collective computational abilities. Proc Natl Acad Sci USA. (1982) 79:2554. doi: 10.1073/pnas.79.8.2554
28. Bouchaud JP. Crises and collective socio-economic phenomena: simple models and challenges. J Stat Phys. (2013) 151:567. doi: 10.1007/s10955-012-0687-3
29. Lucas A, Lee CH. Multistable binary decision making on networks. Phys Rev. (2013)E87:032806. doi: 10.1103/PhysRevE.87.032806. Available online at:http://arxiv.org/abs/1210.6044
30. Xu N, Zhu J, Lu D, Zhou X, Peng X, Du J. Quantum factorization of 143 on a dipolar-coupling nuclear magnetic resonance system. Phys Rev Lett. (2012) 108:130501 [Erratum (2012)109:269902E]. doi: 10.1103/PhysRevLett.108.130501
31. Bian Z, Chudak F, Macready WG, Clark L, Gaitan F. Experimental determination of Ramsey numbers. Phys Rev Lett. (2013) 111:130505. doi: 10.1103/PhysRevLett.111.130505
32. Perdomo-Ortiz A, Dickson N, Drew-Brook M, Rose G, Aspuru-Guzik A. Finding low-energy conformations of lattice protein models by quantum annealing. Sci Rep. (2012) 2:571. doi: 10.1038/srep00571
33. Babbush R, Perdomo-Ortiz A, O'Gorman B, Macready W, Aspuru-Guzik A. Construction of energy functions for lattice heteropolymer models: a case study in constraint satisfaction programming and adiabatic quantum optimization (2013). Available online at:http://arxiv.org/abs/1211.3422
34. Neven H, Rose G, Macready WG. Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization (2008). Available online at:http://arxiv.org/abs/0804.4457
35. Denchev V, Ding N, Vishwanathan SVN, Neven H. “Robust classification with adiabatic quantum optimization.” Proceedings of the 29th International Conference on Machine Learning. (Edinburgh), p. 863 (2012).
36. Boros E, Hammer PL. The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds. Annal Operat Res. (1991) 33:151. doi: 10.1007/BF02115753
37. Boros E, Hammer PL. Pseudo-Boolean optimization. Discrete Appl Math. (2002) 123:155. doi: 10.1016/S0166-218X(01)00341-9
38. Boros E, Hammer PL, Tavares G. Preprocessing of unconstrained quadratic binary optimization. RUTCOR Research Report 10-2006 (2006).
39. Billionnet A, Jaumard B. A decomposition method for minimizing quadratic pseudo-Boolean functions. Operat Res Lett. (1989) 8:161. doi: 10.1016/0167-6377(89)90043-6
40. Biamonte JD. Non-perturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins. Phys Rev. (2008) A77:052331. doi: 10.1103/PhysRevA.77.052331
41. Babbush R, O'Gorman B, Aspuru-Guzik A. Resource efficient gadgets for compiling adiabatic quantum optimization problems. Annal. Phys. (2013) 525:877. doi: 10.1002/andp.201300120
42. Peng X, Liao Z, Xu N, Qin G, Zhou X, Suter D, et al. A quantum adiabatic algorithm for factorization and its experimental implementation. Phys Rev Lett. (2008) 101:220405. doi: 10.1103/PhysRevLett.101.220405
43. Choi V. Minor-embedding in adiabatic quantum computation: I the parameter setting problem. Quantum Inform Process. (2008) 7:193. doi: 10.1007/s11128-008-0082-9
44. Choi V. Minor-embedding in adiabatic quantum computation: II Minor-universal graph design. Quantum Inform Process. (2011) 10:343. doi: 10.1007/s11128-010-0200-3
45. Klymko C, Sullivan BD, Humble TS. Adiabatic quantum programming: minor embedding with hard faults. Quantum Inform Process. Available online at: http://arxiv.org/abs/1210.8395
46. Alon N, Krivelevich M, Sudakov B. Finding a large hidden clique in a random graph. Random Struct Algorith. (1998) 13:457. doi: 10.1002/(SICI)1098-2418(199810/12)13:3/4<457::AID-RSA14>3.3.CO;2-K
47. Childs AM, Farhi E, Goldstone J, Gutmann S. Finding cliques by quantum adiabatic evolution. Quantum Inform Comput. (2002) 2:181. Available online at: http://arxiv.org/abs/quant-ph/0012104
48. Schrijver A. Theory of Integer and Linear Programming. Chichester, NY: Wiley (1998).
49. Choi V. Adiabatic quantum algorithms for the NP-complete maximum-weight independent set, exact cover and 3SAT problems (2010). Available online at: http://arxiv.org/abs/1004.2226
50. Kellerer H, Pferschy U. Knapsack Problems. Berlin: Springer (2004). doi: 10.1007/978-3-540-24777-7
51. Wu FY. The Potts model. Rev Mod Phys. (1982) 54:1. doi: 10.1103/RevModPhys.54.235
52. Appel K, Haken W. Every planar map is four colorable I: discharging. Illinois J Math. (1977)21:429.
53. Appel K, Haken W, Koch J. Every planar map is four colorable II Reducibility. Illinois J Math. (1977) 21:491.
54. Zhou HJ. Spin glass approach to the feedback vertex set problem. Eur Phys J (2013) B86:455. doi: 10.1140/epjb/e2013-40690-1
55. Johnson DS. The NP-completeness column. ACM Trans Algorith. (2005) 1:160. doi: 10.1145/1077464.1077476
56. Hen I, Young AP. Solving the graph isomorphism problem with a quantum annealer. Phys Rev. (2012) A86:042310. doi: 10.1103/PhysRevA.86.042310
57. Nielsen MA, Chuang IA. Quantum Computation and Quantum Information. Cambridge: Cambridge University Press (2000).
58. Beier R, Vöcking B. “Random knapsack in expected polynomial time.” Proceedings of the 35th Annual ACM Symposium on the Theory of Computing, (San Diego, CA), p. 232 (2004).
59. Krivelevich M, Vilenchik D. “Solving random satisfiable 3CNF formulas in expected polynomial time.” Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms(Miami, FL), p. 454 (2006). doi: 10.1145/1109557.1109608
60. Dyer M, Frieze A, Kannan R. A random polynomial-time algorithm for approximating the volume of convex bodies. J ACM. (1991) 38:1. doi: 10.1145/102782.102783
61. Vazirani VV. Approximation Algorithms. Berlin: Springer (2003). doi: 10.1007/978-3-662-04565-7
62. Liberty E, Woolfe F, Martinsson PG, Rokhlin V, Tygert M. Randomized algorithms for the low-rank approximation of matrices. Proc Natl Acad Sci USA. (2007) 104:20167. doi: 10.1073/pnas.0709640104
63. Halko N, Martinsson P, Tropp JA. Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev. (2011) 53:217. doi: 10.1137/090771806
64. Lucas A, Stalzer M, Feo J. Parallel implementation of a fast randomized algorithm for the decomposition of low rank matrices. Parallel Process Lett. (accepted). Available online at:http://arxiv.org/abs/1205.3830