Optimizing adiabatic quantum program compilation using a graph-theoretic framework
Abstract
Adiabatic quantum computing has evolved in recent years from a theoretical field into an immensely practical area, a change partially sparked by D-Wave System’s quantum annealing hardware. These multimillion-dollar quantum annealers offer the potential to solve optimization problems millions of times faster than classical heuristics, prompting researchers at Google, NASA and Lockheed Martin to study how these computers can be applied to complex real-world problems such as NASA rover missions. Unfortunately, compiling (embedding) an optimization problem into the annealing hardware is itself a difficult optimization problem and a major bottleneck currently preventing widespread adoption. Additionally, while finding a single embedding is difficult, no generalized method is known for tuning embeddings to use minimal hardware resources. To address these barriers, we introduce a graph-theoretic framework for developing structured embedding algorithms. Using this framework, we introduce a biclique virtual hardware layer to provide a simplified interface to the physical hardware. Additionally, we exploit bipartite structure in quantum programs using odd cycle transversal (OCT) decompositions. By coupling an OCT-based embedding algorithm with new, generalized reduction methods, we develop a new baseline for embedding a wide range of optimization problems into fault-free D-Wave annealing hardware. Furthermore, to encourage the reuse and extension of thesemore »
- Authors:
-
[2]
- North Carolina State Univ., Raleigh, NC (United States)
- Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
- Publication Date:
- Research Org.:
- Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
- Sponsoring Org.:
- USDOE
- OSTI Identifier:
- 1460229
- Grant/Contract Number:
- AC05-00OR22725
- Resource Type:
- Accepted Manuscript
- Journal Name:
- Quantum Information Processing
- Additional Journal Information:
- Journal Volume: 17; Journal Issue: 5; Journal ID: ISSN 1570-0755
- Publisher:
- Springer
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING
Citation Formats
Goodrich, Timothy D., Sullivan, Blair D., and Humble, Travis S. Optimizing adiabatic quantum program compilation using a graph-theoretic framework. United States: N. p., 2018.
Web. doi:10.1007/s11128-018-1863-4.
Goodrich, Timothy D., Sullivan, Blair D., & Humble, Travis S. Optimizing adiabatic quantum program compilation using a graph-theoretic framework. United States. https://doi.org/10.1007/s11128-018-1863-4
Goodrich, Timothy D., Sullivan, Blair D., and Humble, Travis S. Sat .
"Optimizing adiabatic quantum program compilation using a graph-theoretic framework". United States. https://doi.org/10.1007/s11128-018-1863-4. https://www.osti.gov/servlets/purl/1460229.
@article{osti_1460229,
title = {Optimizing adiabatic quantum program compilation using a graph-theoretic framework},
author = {Goodrich, Timothy D. and Sullivan, Blair D. and Humble, Travis S.},
abstractNote = {Adiabatic quantum computing has evolved in recent years from a theoretical field into an immensely practical area, a change partially sparked by D-Wave System’s quantum annealing hardware. These multimillion-dollar quantum annealers offer the potential to solve optimization problems millions of times faster than classical heuristics, prompting researchers at Google, NASA and Lockheed Martin to study how these computers can be applied to complex real-world problems such as NASA rover missions. Unfortunately, compiling (embedding) an optimization problem into the annealing hardware is itself a difficult optimization problem and a major bottleneck currently preventing widespread adoption. Additionally, while finding a single embedding is difficult, no generalized method is known for tuning embeddings to use minimal hardware resources. To address these barriers, we introduce a graph-theoretic framework for developing structured embedding algorithms. Using this framework, we introduce a biclique virtual hardware layer to provide a simplified interface to the physical hardware. Additionally, we exploit bipartite structure in quantum programs using odd cycle transversal (OCT) decompositions. By coupling an OCT-based embedding algorithm with new, generalized reduction methods, we develop a new baseline for embedding a wide range of optimization problems into fault-free D-Wave annealing hardware. Furthermore, to encourage the reuse and extension of these techniques, we provide an implementation of the framework and embedding algorithms.},
doi = {10.1007/s11128-018-1863-4},
journal = {Quantum Information Processing},
number = 5,
volume = 17,
place = {United States},
year = {Sat Apr 07 00:00:00 EDT 2018},
month = {Sat Apr 07 00:00:00 EDT 2018}
}
Free Publicly Available Full Text
Publisher's Version of Record
Other availability
Search WorldCat to find libraries that may hold this journal
Cited by: 17 works
Citation information provided by
Web of Science
Web of Science
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.
Works referenced in this record:
Pseudo-Boolean optimization
journal, November 2002
- Boros, Endre; Hammer, Peter L.
- Discrete Applied Mathematics, Vol. 123, Issue 1-3
An integrated programming and development environment for adiabatic quantum optimization
journal, January 2014
- S. Humble, T.; J. McCaskey, A.; S. Bennink, R.
- Computational Science & Discovery, Vol. 7, Issue 1
Finding odd cycle transversals
journal, July 2004
- Reed, Bruce; Smith, Kaleigh; Vetta, Adrian
- Operations Research Letters, Vol. 32, Issue 4
A simple test on 2-vertex- and 2-edge-connectivity
journal, April 2013
- Schmidt, Jens M.
- Information Processing Letters, Vol. 113, Issue 7
Parallel recognition of series-parallel graphs
journal, May 1992
- Eppstein, David
- Information and Computation, Vol. 98, Issue 1
Quantum annealing in the transverse Ising model
journal, November 1998
- Kadowaki, Tadashi; Nishimori, Hidetoshi
- Physical Review E, Vol. 58, Issue 5
OR-Library: Distributing Test Problems by Electronic Mail
journal, November 1990
- Beasley, J. E.
- Journal of the Operational Research Society, Vol. 41, Issue 11
Ising formulations of many NP problems
journal, January 2014
- Lucas, Andrew
- Frontiers in Physics, Vol. 2
Simulating Chemistry Using Quantum Computers
journal, May 2011
- Kassal, Ivan; Whitfield, James D.; Perdomo-Ortiz, Alejandro
- Annual Review of Physical Chemistry, Vol. 62, Issue 1
Statistical mechanics of complex networks
journal, January 2002
- Albert, Réka; Barabási, Albert-László
- Reviews of Modern Physics, Vol. 74, Issue 1
The node-deletion problem for hereditary properties is NP-complete
journal, April 1980
- Lewis, John M.; Yannakakis, Mihalis
- Journal of Computer and System Sciences, Vol. 20, Issue 2
Graph Minors .XIII. The Disjoint Paths Problem
journal, January 1995
- Robertson, N.; Seymour, P. D.
- Journal of Combinatorial Theory, Series B, Vol. 63, Issue 1
Fast clique minor generation in Chimera qubit connectivity graphs
journal, October 2015
- Boothby, Tomas; King, Andrew D.; Roy, Aidan
- Quantum Information Processing, Vol. 15, Issue 1
Performance Models for Split-Execution Computing Systems
conference, May 2016
- Humble, Travis S.; McCaskey, Alexander J.; Schrock, Jonathan
- 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
A case study in programming a quantum annealer for hard operational planning problems
journal, December 2014
- Rieffel, Eleanor G.; Venturelli, Davide; O’Gorman, Bryan
- Quantum Information Processing, Vol. 14, Issue 1
Ollivier-Ricci curvature and fast approximation to tree-width in embeddability of QUBO problems
conference, May 2014
- Wang, Chi; Jonckheere, Edmond; Brun, Todd
- 2014 6th International Symposium on Communications, Control and Signal Processing (ISCCSP)
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
journal, October 2010
- Choi, Vicky
- Quantum Information Processing, Vol. 10, Issue 3
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
journal, September 2008
- Choi, Vicky
- Quantum Information Processing, Vol. 7, Issue 5
Adiabatic quantum programming: minor embedding with hard faults
journal, November 2013
- Klymko, Christine; Sullivan, Blair D.; Humble, Travis S.
- Quantum Information Processing, Vol. 13, Issue 3
Greed is good: approximating independent sets in sparse and bounded-degree graphs
conference, January 1994
- Halldórsson, Magnús; Radhakrishnan, Jaikumar
- Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
journal, February 2017
- Hamilton, Kathleen E.; Humble, Travis S.
- Quantum Information Processing, Vol. 16, Issue 4
OR-Library: Distributing Test Problems by Electronic Mail
journal, November 1990
- Beasley, J. E.
- Journal of the Operational Research Society, Vol. 41, Issue 11
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
conference, January 2005
- Agarwal, Amit; Charikar, Moses; Makarychev, Konstantin
- Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05
Hybrid quantum annealing via molecular dynamics
journal, April 2021
- Irie, Hirotaka; Liang, Haozhao; Doi, Takumi
- Scientific Reports, Vol. 11, Issue 1
Algorithm Engineering for Optimal Graph Bipartization
journal, January 2009
- Hüffner, Falk
- Journal of Graph Algorithms and Applications, Vol. 13, Issue 2
OR-Library: Distributing Test Problems by Electronic Mail
journal, November 1990
- Beasley, J. E.
- The Journal of the Operational Research Society, Vol. 41, Issue 11
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
journal, May 1997
- Halldórsson, M. M.; Radhakrishnan, J.
- Algorithmica, Vol. 18, Issue 1
Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem
text, January 2008
- Choi, Vicky
- arXiv
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
text, January 2010
- Choi, Vicky
- arXiv
A case study in programming a quantum annealer for hard operational planning problems
text, January 2014
- Rieffel, Eleanor G.; Venturelli, Davide; O'Gorman, Bryan
- arXiv
Works referencing / citing this record:
Efficiently embedding QUBO problems on adiabatic quantum computers
journal, March 2019
- Date, Prasanna; Patton, Robert; Schuman, Catherine
- Quantum Information Processing, Vol. 18, Issue 4
Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
journal, February 2019
- Okada, Shuntaro; Ohzeki, Masayuki; Terabe, Masayoshi
- Scientific Reports, Vol. 9, Issue 1
Graph Partitioning using Quantum Annealing on the D-Wave System
conference, January 2017
- Ushijima-Mwesigwa, Hayato; Negre, Christian F. A.; Mniszewski, Susan M.
- Proceedings of the Second International Workshop on Post Moores Era Supercomputing - PMES'17
Embedding Equality Constraints of Optimization Problems into a Quantum Annealer
journal, April 2019
- Vyskocil, Tomas; Djidjev, Hristo
- Algorithms, Vol. 12, Issue 4
Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
text, January 2019
- Okada, Shuntaro; Ohzeki, Masayuki; Terabe, Masayoshi
- arXiv