Michael Jünger
Skip Abstract Section
Abstract
Quantum annealing is getting increasing attention in combinatorial optimization. The quantum processing unit by D-Wave is constructed to approximately solve Ising models on so-called Chimera graphs. Ising models are equivalent to quadratic unconstrained binary optimization (QUBO) problems and maximum cut problems on the associated graphs. We have tailored branch-and-cut as well as semidefinite programming algorithms for solving Ising models for Chimera graphs to provable optimality and use the strength of these approaches for comparing our solution values to those obtained on the current quantum annealing machine, D-Wave 2000Q. This allows for the assessment of the quality of solutions produced by the D-Wave hardware. In addition, we also evaluate the performance of a heuristic by Selby. It has been a matter of discussion in the literature how well the D-Wave hardware performs at its native task, and our experiments shed some more light on this issue. In particular, we examine how reliably the D-Wave computer can deliver true optimum solutions and present some surprising results.
- Tameem Albash and Daniel A. Lidar. 2018. Demonstration of a scaling advantage for a quantum annealer over simulated annealing. Physical Review X 8, 3 (July 2018), 031016. DOI:https://doi.org/10.1103/PhysRevX.8.031016Google Scholar
- Francisco Barahona. 1982. On the computational complexity of ising spin glass models. Journal of Physics A: Mathematical and General 15, 10 (1982), 3241.Google ScholarCross Ref
- Francisco Barahona. 1983. Balancing Signed Toroidal Graphs in Polynomial Time.Departamento de Matematicas, Universidad de Chile, Santiago, Chile.Google Scholar
- Francisco Barahona. 1983. The max-cut problem on graphs not contractible to . Operations Research Letters 2, 3 (1983), 107–111.Google ScholarDigital Library
- Francisco Barahona, Martin Grötschel, Michael Jünger, and Gerhard Reinelt. 1988. An application of combinatorial optimization to statistical physics and circuit layout design. Operations Research 36, 3 (1988), 493–513. DOI:https://doi.org/10.1287/opre.36.3.493Google ScholarCross Ref
- Francisco Barahona, Michael Jünger, and Gerhard Reinelt. 1989. Experiments in quadratic 0-1 programming. Mathematical Programming 44, 1 (1989), 127–137. DOI:https://doi.org/10.1007/BF01587084Google ScholarDigital Library
- Francisco Barahona and Ali Ridha Mahjoub. 1986. On the cut polytope. Mathematical Programming 36, 2 (1986), 157–173. DOI:https://doi.org/10.1007/BF02592023Google ScholarCross Ref
- Christian Bauckhage, Eduardo Brito, Kostadin Cvejoski, César Ojeda, Rafet Sifa, and Stefan Wrobel. 2018. Ising models for binary clustering via adiabatic quantum computing. In Energy Minimization Methods in Computer Vision and Pattern Recognition - 11th International Conference (EMMCVPR’17), Revised Selected Papers (Lecture Notes in Computer Science), Marcello Pelillo and Edwin R. Hancock (Eds.), Vol. 10746. Springer, 3–17. DOI:https://doi.org/10.1007/978-3-319-78199-0_1Google Scholar
- Biq Mac 2009. Biq Mac Solver – Binary quadratic and Max cut Solver. http://biqmac.uni-klu.ac.at.Google Scholar
- Hans L. Bodlaender and Klaus Jansen. 2000. On the complexity of the maximum cut problem. Nordic Journal of Computing 7, 1 (2000), 14–31.Google ScholarDigital Library
- Sergio Boixo, Troels F. Rønnow, Sergei V. Isakov, Zhihui Wang, David Wecker, Daniel A. Lidar, John M. Martinis, and Matthias Troyer. 2013. Evidence for quantum annealing with more than one hundred qubits. Nature Physics 10, 3 (2013), 218–224. DOI:https://doi.org/10.1038/nphys2900 arXiv:quant-ph/1304.4595.Google ScholarCross Ref
- Thorsten Bonato, Michael Jünger, Gerhard Reinelt, and Giovanni Rinaldi. 2014. Lifting and separation procedures for the cut polytope. Mathematical Programming 146, 1–2 (2014), 351–378. DOI:https://doi.org/10.1007/s10107-013-0688-2Google ScholarDigital Library
- Tomas Boothby, Andrew D. King, and Aidan Roy. 2016. Fast clique minor generation in chimera qubit connectivity graphs. Quantum Information Processing 15, 1 (2016), 495–508.Google ScholarDigital Library
- Jun Cai, William G. Macready, and Aidan Roy. 2014. A practical heuristic for finding graph minors. arXiv e-prints (2014), arXiv:1406.2741.Google Scholar
- Cristian S. Calude, Michael J. Dinneen, and Richard Hua. 2017. QUBO formulations for the graph isomorphism problem and related problems. Theoretical Computer Science 701 (2017), 54–69. DOI:https://doi.org/10.1016/j.tcs.2017.04.016At the intersection of computer science with biology, chemistry and physics - In Memory of Solomon Marcus.Google ScholarDigital Library
- Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, and Alexander Nover. 2020. Maximum cut parameterized by crossing number. Journal of Graph Algorithms and Applications 24, 3 (2020), 155–170. DOI:https://doi.org/10.7155/jgaa.00523Google ScholarCross Ref
- Vicky Choi. 2008. Minor-embedding in adiabatic quantum computation: I. The parameter setting problem. Quantum Information Processing 7, 5 (2008), 193–209. DOI:https://doi.org/10.1007/s11128-008-0082-9Google ScholarDigital Library
- Carleton Coffrin, Harsha Nagarajan, and Russell Bent. 2017. Ising processing units: Potential and challenges for discrete optimization. arXiv e-prints (2017), arXiv:1707.00355.Google ScholarCross Ref
- William J. Cook, David L. Applegate, Robert E. Bixby, and Vasek Chvátal. 2011. The Traveling Salesman Problem. Princeton University Press. DOI:https://doi.org/10.1515/9781400841103Google Scholar
- D-Wave. 2020. D-Wave System Documentation. https://docs.dwavesys.com/docs/latest/c_timing_2.html.Google Scholar
- Christine Dahn, Nils M. Kriege, and Petra Mutzel. 2018. A fixed-parameter algorithm for the max-cut problem on embedded 1-planar graphs. In Combinatorial Algorithms - 29th International Workshop (IWOCA’18), Proceedings (Lecture Notes in Computer Science), Costas S. Iliopoulos, Hon Wai Leong, and Wing-Kin Sung (Eds.), Vol. 10979. Springer, 141–152. DOI:https://doi.org/10.1007/978-3-319-94667-2_12Google Scholar
- Christine Dahn, Nils M. Kriege, Petra Mutzel, and Julian Schilling. 2021. Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs. Theoretical Computer Science 852 (2021), 172–184. https://www.sciencedirect.com/science/article/pii/S0304397520306721.Google ScholarCross Ref
- Sanjeeb Dash. [n.d.]. Cutting planes from extended formulations of mixed-integer programs. Presentation at the Joint Mathematics Meeting, Baltimore, Jan. 2019. https://jointmathematicsmeetings.org/amsmtgs/2217_abstracts/1145-90-2271.pdf.Google Scholar
- Sanjeeb Dash and Jean-François Puget. 2015. On quadratic unconstrained binary optimization problems defined on Chimera graphs. OPTIMA 98 (2015), 2–6.Google Scholar
- Caterina De Simone, Martin Diehl, Michael Jünger, Petra Mutzel, Gerhard Reinelt, and Giovanni Rinaldi. 1995. Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm. Journal of Statistical Physics 80, 1–2 (1995), 487–496.Google ScholarCross Ref
- Caterina De Simone, Martin Diehl, Michael Jünger, Petra Mutzel, Gerhard Reinelt, and Giovanni Rinaldi. 1996. Exact ground states of two-dimensional Ising spin glasses. Journal of Statistical Physics 84, 5 (Sept. 1996), 1363–1371. DOI:https://doi.org/10.1007/BF02174135Google ScholarCross Ref
- Tony T. Tran Minh Do, Eleanor G. Rieffel, Jeremy Frank, Zhihui Wang, Bryan O’Gorman, Davide Venturelli, and J. Christopher Beck. 2016. A hybrid quantum-classical approach to solving scheduling problems. In 9th Annual Symposium on Combinatorial Search, 98–106.Google Scholar
- Iain Dunning, Swati Gupta, and John Silberholz. 2018. What works best when? a systematic evaluation of heuristics for max-cut and QUBO. INFORMS Journal on Computing 30, 3 (2018), 608–624. DOI:https://doi.org/10.1287/ijoc.2017.0798arXiv:https://doi.org/10.1287/ijoc.2017.0798Google ScholarDigital Library
- E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser. 2000. Quantum computation by adiabatic evolution. arXiv quant-ph/0001106.Google Scholar
- Alexander Fix, Joyce Chen, Endre Boros, and Ramin Zabih. 2012. Approximate MRF inference using bounded treewidth subgraphs. In Computer Vision (ECCV’12), Andrew Fitzgibbon, Svetlana Lazebnik, Pietro Perona, Yoichi Sato, and Cordelia Schmid (Eds.). Springer, Berlin, 385–398.Google Scholar
- Anna Galluccio and Martin Loebl. 1998. Max Cut in Toroidal Graphs. Technical Report R.471. Instituto di Analisi dei Sistemi ed Informatica, Consiglio Nazionale delle Ricerche.Google Scholar
- Michel X. Goemans and David P. Williamson. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42, 6 (1995), 1115–1145. DOI:https://doi.org/10.1145/227683.227684Google ScholarDigital Library
- Martin Grötschel, László Lovász, and Alexander Schrijver. 1981. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 2 (1981), 169–197. DOI:https://doi.org/10.1007/BF02579273Google ScholarCross Ref
- Martin Grötschel and George L. Nemhauser. 1984. A polynomial algorithm for the max-cut problem on graphs without long odd cycles. Mathematical Programming 29, 1 (1984), 28–40. DOI:https://doi.org/10.1007/BF02591727Google ScholarDigital Library
- Frank Hadlock. 1975. Finding a maximum cut of a planar graph in polynomial time. SIAM Journal on Computing 4, 3 (1975), 221–225. DOI:https://doi.org/10.1137/0204019Google ScholarCross Ref
- Ryan Hamerly, Takahiro Inagaki, Peter L. McMahon, Davide Venturelli, Alireza Marandi, Tatsuhiro Onodera, Edwin Ng, Carsten Langrock, Kensuke Inaba, Toshimori Honjo, Koji Enbutsu, Takeshi Umeki, Ryoichi Kasahara, Shoko Utsunomiya, Satoshi Kako, Ken-ichi Kawarabayashi, Robert L. Byer, Martin M. Fejer, Hideo Mabuchi, Dirk Englund, Eleanor Rieffel, Hiroki Takesue, and Yoshihisa Yamamoto. 2019. Experimental investigation of performance differences between coherent Ising machines and a quantum annealer. Science Advances 5, 5 (2019), 1–10. https://advances.sciencemag.org/content/5/5/eaau0823.Google ScholarCross Ref
- Firas Hamze and Nando de Freitas. 2004. From fields to trees. In Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence (UAI’04). AUAI Press, Arlington, VA, 243–250. http://dl.acm.org/citation.cfm?id=1036843.1036873.Google ScholarDigital Library
- Itay Hen, Joshua Job, Tameem Albash, Troels F. Rønnow, Matthias Troyer, and Daniel A. Lidar. 2015. Probing for quantum speedup in spin-glass problems with planted solutions. Physical Review A 92, 4 (Oct. 2015), 042325. DOI:https://doi.org/10.1103/PhysRevA.92.042325Google ScholarCross Ref
- IBM. 2020. CPLEX Optimization Studio. http://www.cplex.com.Google Scholar
- Kazuki Ikeda, Yuma Nakamura, and Travis S. Humble. 2019. Application of quantum annealing to nurse scheduling problem. Scientific Reports 9, 1 (Sept. 2019), 12837. DOI:https://doi.org/10.1038/s41598-019-49172-3Google ScholarCross Ref
- Richard M. Karp. 1972. Reducibility among combinatorial problems. In Proceedings of a Symposium on the Complexity of Computer Computations, New York (The IBM Research Symposia Series), Raymond E. Miller and James W. Thatcher (Eds.). Plenum Press, New York, 85–103. http://www.cs.berkeley.edu/ luca/cs172/karp.pdf.Google ScholarCross Ref
- Donald E. Knuth. 1993. The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press, New York.Google Scholar
- Frauke Liers, Michael Jünger, Gerhard Reinelt, and Giovanni Rinaldi. 2004. Computing exact ground states of hard ising spin glass problems by branch and cut. In New Optimization Algorithms in Physics, Alexander K. Hartmann and Heiko Rieger (Eds.). Wiley-VCH, 47–68. DOI:https://doi.org/10.1002/3527603794.ch4Google Scholar
- Frauke Liers and Gregor Pardella. 2012. Partitioning planar graphs: A fast combinatorial approach for max-cut. Computational Optimization and Applications 51, 1 (2012), 323–344. DOI:https://doi.org/10.1007/s10589-010-9335-5Google ScholarDigital Library
- Stefan Lörwald and Gerhard Reinelt. 2015. PANDA: A software for polyhedral transformations. EURO Journal on Computational Optimization 3, 4 (2015), 297–308. DOI:https://doi.org/10.1007/s13675-015-0040-0Google ScholarCross Ref
- Sanjeev Mahajan and Hariharan Ramesh. 1995. Derandomizing semidefinite programming based approximation algorithms. SIAM Journal on Computing 28, 5 (1995), 1641–1663.Google ScholarDigital Library
- S. Thomas McCormick, M. R. Rao, and Giovanni Rinaldi. 2003. Easy and difficult objective functions for max cut. Mathematical Programming 94, 2–3 (2003), 459–466.Google ScholarCross Ref
- Catherine C. McGeoch and Cong Wang. 2013. Experimental evaluation of an adiabiatic quantum system for combinatorial optimization. In Computing Frontiers Conference (CF’13), Hubertus Franke, Alexander Heinecke, Krishna V. Palem, and Eli Upfal (Eds.). ACM, 23:1–23:11. DOI:https://doi.org/10.1145/2482767.2482797Google Scholar
- Christian F. A. Negre, Hayato Ushijima-Mwesigwa, and Susan M. Mniszewski. 2019. Detecting multiple communities using quantum annealing on the D-Wave system. arXiv e-prints, Article arXiv:1901.09756 (2019), arXiv:1901.09756 pages. arxiv:cs.OH/1901.09756.Google Scholar
- Gurobi Optimization. 2020. Gurobi Optimizer 9.0. http://www.gurobi.com.Google Scholar
- Christos H. Papadimitriou and Mihalis Yannakakis. 1991. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 3 (1991), 425–440. DOI:https://doi.org/10.1016/0022-0000(91)90023-XGoogle ScholarCross Ref
- Ojas Parekh, Jeremy Wendt, Luke Shulenburger, Andrew Landahl, Jonathan Moussa, and John Aidun. 2016. Benchmarking adiabatic quantum optimization for complex network analysis. arXiv e-prints, Article arXiv:1604.00319 (2016), arXiv:1604.00319 pages. arxiv:quant-ph/1604.00319.Google Scholar
- Adam Pearson, Anurag Mishra, Itay Hen, and Daniel Lidar. 2019. Analog errors in quantum annealing: Doom and hope. npj Quantum Information 5 (2019), 107. DOI:https://doi.org/10.1038/s41534-019-0210-7Google Scholar
- Alejandro Perdomo-Ortiz, Joseph Fluegemann, Sriram Narasimhan, Rupak Biswas, and Vadim N. Smelyanskiy. 2015. A quantum annealing approach for fault detection and diagnosis of graph-based systems. European Physical Journal Special Topics 224, 1 (2015), 131–148. DOI:https://doi.org/10.1140/epjst/e2015-02347-yGoogle ScholarCross Ref
- Franz Rendl, Giovanni Rinaldi, and Angelika Wiegele. 2010. Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Mathematical Programming 121, 2 (2010), 307–335. DOI:https://doi.org/10.1007/s10107-008-0235-8Google ScholarDigital Library
- Eleanor G. Rieffel, Davide Venturelli, Bryan O’Gorman, Minh B. Do, Elicia M. Prystay, and Vadim N. Smelyanskiy. 2015. A case study in programming a quantum annealer for hard operational planning problems. Quantum Information Processing 14, 1 (2015), 1–36.Google ScholarDigital Library
- Troels F. Rønnow, Zhihui Wang, Joshua Job, Sergio Boixo, Sergei V. Isakov, David Wecker, John M. Martinis, Daniel A. Lidar, and Matthias Troyer. 2014. Defining and detecting quantum speedup. Science 345, 6195 (2014), 420–424. DOI:https://doi.org/10.1126/science.1252319arXiv:https://science.sciencemag.org/content/345/6195/420.full.pdf.Google Scholar
- Rishi Saket. 2013. A PTAS for the classical Ising spin glass problem on the Chimera graph structure. arXiv e-prints, Article arXiv:1306.6943 (2013), arXiv:1306.6943 pages. arxiv:cs.DS/1306.6943Google Scholar
- Siddhartha Santra, Gregory Quiroz, Greg Ver Steeg, and Daniel A. Lidar. 2014. Max 2-SAT with up to 108 qubits. New Journal of Physics 16, 4 (Apr. 2014), 045006. DOI:https://doi.org/10.1088/1367-2630/16/4/045006Google ScholarCross Ref
- Alex Selby. [n.d.]. Harder QUBO instances on a Chimera graph. http://www.archduke.org/stuff/d-wave-comment-on-comparison-with-classical-computers/harder-qubo-instances-on-a-chimera-graph.Google Scholar
- Alex Selby. 2013. QUBO-Chimera. Github: Social Coding.Google Scholar
- Alex Selby. 2014. Efficient subgraph-based sampling of Ising-type models with frustration. arXiv e-prints, Article arXiv:1409.3934 (2014), arXiv:1409.3934 pages. arxiv:cond-mat.stat-mech/1409.3934Google Scholar
- Wei-Kuan Shih, Sun Wu, and Yue-Sun Kuo. 1990. Unifying maximum cut and minimum cut of a planar graph. IEEE Transactions on Computers 39, 5 (1990), 694–697.Google ScholarDigital Library
- Spin Glass Solver 1996. The Spin Glass Ground State Server. https://informatik.uni-koeln.de/spinglass.Google Scholar
- Tobias Stollenwerk, Elisabeth Lobe, and Martin Jung. 2019. Flight gate assignment with a quantum annealer. In Quantum Technology and Optimization Problems, Sebastian Feld and Claudia Linnhoff-Popien (Eds.). Springer International Publishing, 99–110.Google Scholar
- Tobias Stollenwerk, Bryan O’Gorman, Davide Venturelli, Salvatore Mandrà, Olga Rodionova, Hokkwan Ng, Banavar Sridhar, Eleanor Gilbert Rieffel, and Rupak Biswas. 2020. Quantum annealing applied to de-conflicting optimal trajectories for air traffic management. IEEE Transactions on Intelligent Transportation Systems 21, 1 (2020), 285–297. DOI:https://doi.org/10.1109/TITS.2019.2891235Google ScholarCross Ref
- Davide Venturelli, Dominic J. J. Marchand, and Galo Rojo. 2015. Quantum annealing implementation of job-shop scheduling. arXiv preprint (2015), arXiv:1506.08479. http://arxiv.org/abs/1506.08479.Google Scholar
- Walter Vinci and Daniel A. Lidar. 2016. Optimally stopped optimization. Physical Review Applied 6, 5 (Nov. 2016), 054016. DOI:https://doi.org/10.1103/PhysRevApplied.6.054016Google ScholarCross Ref
- Sheir Yarkoni, Aske Plaat, and Thomas Bäck. 2018. First results solving arbitrarily structured maximum independent set problems using quantum annealing. 2018 IEEE Congress on Evolutionary Computation (CEC’18), 1–6.Google ScholarCross Ref
- Kevin Young, Robin Blume-Kohout, and Daniel Lidar. 2013. Adiabatic quantum optimization with the wrong Hamiltonian. Physical Review A 88, 6 (2013), 062314-1–062314-7. DOI:https://doi.org/10.1103/PhysRevA.88.062314Google ScholarCross Ref
Index Terms
- Quantum Annealing versus Digital Computing: An Experimental Comparison
Recommendations
Template-Based Minor Embedding for Adiabatic Quantum Optimization
Quantum annealing (QA) can be used to quickly obtain near-optimal solutions for quadratic unconstrained binary optimization (QUBO) problems. In QA hardware, each decision variable of a QUBO should be mapped to one or more adjacent qubits in such a way ...
Non-commuting two-local Hamiltonians for quantum error suppression
Physical constraints make it challenging to implement and control many-body interactions. For this reason, designing quantum information processes with Hamiltonians consisting of only one- and two-local terms is a worthwhile challenge. Enabling error ...
The potential of quantum annealing for rapid solution structure identification
AbstractThe recent emergence of novel computational devices, such as quantum computers, coherent Ising machines, and digital annealers presents new opportunities for hardware-accelerated hybrid optimization algorithms. Unfortunately, demonstrations of ...
Comments