Max 2-SAT with up to 108 qubits

New Journal of Physics

Volumn 16, Issue , 2014, Pages

  Santra, Siddhartha ^a   Quiroz, Gregory ^a   Ver Steeg, Greg ^a,b   Lidar, Daniel A ^a  

^a University of Southern California   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

adiabatic quantum computation; computational complexity; quantum annealing

Indexed keywords

COMPUTATIONAL COMPLEXITY; HARDNESS; QUANTUM THEORY;

ADIABATIC QUANTUM COMPUTATION; CLAUSE DENSITY; CRITICAL VALUE; PROBLEM HARDNESS; QUANTUM ANNEALING; RANDOM PROBLEM; RELATIVE PERFORMANCE; STATE-OF-THE-ART ALGORITHMS;

QUANTUM COMPUTERS;

EID: 84899547203     PISSN: 13672630     EISSN: None     Source Type: Journal    
DOI: 10.1088/1367-2630/16/4/045006     Document Type: Article

References (67)

1. Farhi E, Goldstone J, Gutmann S and Sipser M 2000 arXiv:quant-ph/0001106
2. Farhi E, Goldstone J, Gutmann S, Lapan J, Lundgren A and Preda D 2001 Science 292 472
3. Aharonov D, van Dam W, Kempe J, Landau Z, Lloyd S and Regev O 2007 SIAM J.Comp. 37 166
4. Kempe J, Kitaev A and Regev O 2006 SIAM J. Comp. 35 1070-97
5. Siu M S 2005 Phys. Rev. A 71 062314
6. Oliveira R and Terhal B 2005 Quantum Inf. Comput. 8 0900
7. Mizel A, A Lidar D and Mitchell M 2007 Phys. Rev. Lett. 99 70502
8. Childs A M, Farhi E and Preskill J 2001 Phys. Rev. A 65 012322
9. Sarandy M S and Lidar D A 2005 Phys. Rev. Lett. 95 250503
10. Roland J and Cerf N J 2005 Phys. Rev. A 71 032330
11. Tiersch M and Schützhold R 2007 Phys. Rev. A 75 062313
12. Amin M H S, Averin D V and Nesteroff J A 2009 Phys. Rev. A 79 022107
13. Amin M H S, Love P J and Truncik C J S 2008 Phys. Rev. Lett. 100 060503
14. Harris R et al 2010 Phys. Rev. B 82 024511
15. Johnson M W et al 2011 Nature 473 194-8
16. Dickson N G et al 2013 Nat. Commun. 4 1903
17. Boixo S, Albash T, Spedalieri F M, Chancellor N and Lidar D A 2013 Nat. Commun. 4 3067
18. Boixo S et al 2013 arXiv:1304.4595
19. Wang L et al 2013 arXiv:1305.5837
20. Brooke J, Bitko D, Rosenbaum F T and Aeppli G 1999 Science 284 779-81
21. Finnila A B, Gomez M A, Sebenik C, Stenson C and Doll J D 1994 Chem. Phys. Lett. 219 343-8
22. Kadowaki T and Nishimori H 1998 Phys. Rev. E 58 5355-63
23. Santoro G E, Martoňák R, Tosatti E and Car R 2002 Science 295 2427-30
24. Das A and Chakrabarti B K 2008 Rev. Mod. Phys. 80 1061-81
25. Young A P, Knysh S and Smelyanskiy V N 2008 Phys. Rev. Lett. 101 170503
26. Martoňák R, Santoro G E and Tosatti E 2002 Phys. Rev. B 66 094203
27. Battaglia D A, Santoro G E and Tosatti E 2005 Phys. Rev. E 71 066707
28. Morita S and Nishimori H 2008 J. Math. Phys. 49 125210
29. Farhi E, Gosset D, Hen I, Sandvik A W, Shor P, Young A P and Zamponi F 2012 Phys. Rev. A 86 052334
30. Garcia-Ripoll J J and Bañuls 2008 arXiv:0812.1760
31. Kirkpatrick S, Gelatt C D and Vecchi M P 1983 Science 220 671-80
32. Mezard M and Montanari A 2009 Information Physics and Computation (New York: Oxford University Press)
33. Coppersmith D, Gamarnik D, Hajiaghayi M and Sorkin G B 2004 Random Struct. Algorithms 24 502-45
34. de la Vega W F 2001 Theor. Comput. Sci. 265 131-46
35. McGeoch C C and Wang C 2013 Experimental evaluation of an adiabatic quantum system for combinatorial optimization Proc. 2013 ACM Conf. on Computing Frontiers (New York: ACM) 23
36. Selby A 2013 D-Wave: Comment on Comparison with Classical Computers www.archduke.org/stuff/d-wave-comment-on-comparison-with-classical-computers/
37. Puget J F 2013 D-Wave vs CPLEX Comparison. Part 2: QUBO 48 45 www.ibm.com/developerworks/community/blogs/jfp/entry/ dwavevscplexcomparisonpart2qubo
38. Jordan S P, Farhi E and Shor P W 2006 Phys. Rev. A 74 052322
39. Lidar D A 2008 Phys. Rev. Lett. 100 160506
40. Quiroz G and Lidar D A 2012 Phys. Rev. A 86 042333
41. Paz-Silva G A, Rezakhani A T, Dominy J M and Lidar D A 2012 Phys. Rev. Lett. 108 080501
42. Young K C and Sarovar M 2012 arXiv:1208.6371
43. Kuegel A 2012 Improved exact solver for the weighted Max-SAT problem POS-10 (EPiC Series) vol 8 ed D L Berre (Manchester: EasyChair) 15-27
44. Choi V 2008 Quantum Inf. Proc. 7 193-209
45. Choi V 2011 Quantum Inf. Proc. 10 343-53
46. Rendl F, Rinaldi G and Wiegele A 2010 Math. Program. 121 307-35
47. Spin glass server www.informatik.uni-koeln.de/spinglass/
48. Dechter R 1999 Artif. Intell. 113 41-85
49. Aspvall B, Plass M F and Tarjan R E 1979 Inf. Proc. Lett. 8 121-3
50. Papadimitriou C 1995 Computational Complexity
51. Bollobás B, Borgs C, Chayes J T, Kim J H and Wilson D B 2001 Random Struct. Algorithms 18 201-56
52. Goerdt A 1996 J. Comput. System Sci. 53 469
53. Monasson R, Zecchina R, Kirkpatrick S, Selman B and Troyansky L 1999 Nature 400 133-7
54. Shen H and Zhag H 2003 Electron. Notes Discrete Math. 16 80-92
55. Goemans M and Williamson D 1995 J. Assoc. Comput. Mach. 42 1115-45
56. Lewin M, Livnat D and Zwick U 2002 Integer Program. Comb. Optim. 2337 67-82
57. Hàstad J 2001 J. ACM 48 798-859
58. 2013 Annual Max-SAT Evaluations http://maxsat.ia.udl.cat/introduction/
59. Davis M and Putnam H 1960 J. ACM 7 201-15
60. Feigenbaum J and Fortnow L 1993 SIAM J. Comp. 22 994-1005
61. Ajtai M 1999 Generating hard instances of the short basis problem Proc. XXVI Int. Colloq. on Automata, Languages and Programming ed J Wiedermann, P van Emde Boas and M Nielsen (London: Springer) 1-9 (ICAL '99) http://dl.acm.org/ citation.cfm?id=646229.681554
62. Austrin P 2007 Balanced MAX 2-SAT might not be the hardest Proc. 39th Ann. ACM Symp. on Theory of Computing (New York: ACM) 189-97 (STOC '07)
63. Albash T, Boixo S, Lidar D A and Zanardi P 2012 New J. Phys. 14 123016
64. Amin M H, Dickson N G and Smith P 2013 Quantum Inf. Proc. 12 1819-29
65. Berkley A J, Johnson M W, Bunyk P, Harris R, Johansson J, Lanting T, Ladizinsky E, Tolkacheva E, Amin M H S and Rose G 2010 Supercond. Sci. Technol. 23 105014
66. Johnson M W et al 2010 Supercond. Sci. Technol. 23 065004
67. Lanting T 2013 D-Wave Inc. private communication