Efficiently embedding QUBO problems on adiabatic quantum computers

Date, Prasanna; Patton, Robert; Schuman, Catherine; Potok, Thomas

doi:10.1007/s11128-019-2236-3

Title: Efficiently embedding QUBO problems on adiabatic quantum computers

Journal Article · Tue Mar 05 00:00:00 EST 2019 · Quantum Information Processing

DOI:https://doi.org/10.1007/s11128-019-2236-3· OSTI ID:1557505

^[1];

^[2];

^[2]

Rensselaer Polytechnic Inst., Troy, NY (United States)
Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

Adiabatic quantum computers like the D-Wave 2000Q can approximately solve the QUBO problem, which is an NP-hard problem, and have been shown to outperform classical computers on several instances. Solving the QUBO problem literally means solving virtually any NP-hard problem like the traveling salesman problem, airline scheduling problem, protein folding problem, genotype imputation problem, thereby enabling significant scientific progress, and potentially saving millions/billions of dollars in logistics, airlines, healthcare and many other industries. Yet, before QUBO problems are solved on quantum computers, they must be embedded (or compiled) onto the hardware of quantum computers, which in itself is a very hard problem. Here, we propose an efficient embedding algorithm, that lets us embed QUBO problems fast, uses less qubits and gets the objective function value close to the global minimum value. We then compare the performance of our embedding algorithm to that of D-Wave’s embedding algorithm, which is the current state of the art, and show that our embedding algorithm convincingly outperforms D-Wave’s embedding algorithm. Our embedding approach works with perfect Chimera graphs, i.e., Chimera graphs with no missing qubits.

View Accepted Manuscript (DOE)

Cite

Export

Save

Research Organization:: Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)

Sponsoring Organization:: USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)

Grant/Contract Number:: AC05-00OR22725

OSTI ID:: 1557505

Journal Information:: Quantum Information Processing, Vol. 18, Issue 4; ISSN 1570-0755

Publisher:: SpringerCopyright Statement

Country of Publication:: United States

Language:: English

Citation Metrics:

Cited by: 22 works

Citation information provided by
Web of Science

References (40)

A silicon-based nuclear spin quantum computer Kane, B. E. Nature, Vol. 393, Issue 6681 https://doi.org/10.1038/30156	journal	May 1998
Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis Bian, Zhengbing; Chudak, Fabian; Israel, Robert Brian Frontiers in ICT, Vol. 3 https://doi.org/10.3389/fict.2016.00014	journal	July 2016
A single-atom electron spin qubit in silicon Pla, Jarryd J.; Tan, Kuan Y.; Dehollain, Juan P. Nature, Vol. 489, Issue 7417 https://doi.org/10.1038/nature11449	journal	September 2012
Optimizing adiabatic quantum program compilation using a graph-theoretic framework Goodrich, Timothy D.; Sullivan, Blair D.; Humble, Travis S. Quantum Information Processing, Vol. 17, Issue 5 https://doi.org/10.1007/s11128-018-1863-4	journal	April 2018
Adiabatic quantum computation Albash, Tameem; Lidar, Daniel A. Reviews of Modern Physics, Vol. 90, Issue 1 https://doi.org/10.1103/RevModPhys.90.015002	journal	January 2018
The Protein-Folding Problem, 50 Years On Dill, K. A.; MacCallum, J. L. Science, Vol. 338, Issue 6110 https://doi.org/10.1126/science.1219021	journal	November 2012
The Multiple Sequence Alignment Problem in Biology Carrillo, Humberto; Lipman, David SIAM Journal on Applied Mathematics, Vol. 48, Issue 5 https://doi.org/10.1137/0148063	journal	October 1988
A fast quantum mechanical algorithm for database search Grover, Lov K. Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 https://doi.org/10.1145/237814.237866	conference	January 1996
A case study in programming a quantum annealer for hard operational planning problems Rieffel, Eleanor G.; Venturelli, Davide; O’Gorman, Bryan Quantum Information Processing, Vol. 14, Issue 1 https://doi.org/10.1007/s11128-014-0892-x	journal	December 2014
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design Choi, Vicky Quantum Information Processing, Vol. 10, Issue 3 https://doi.org/10.1007/s11128-010-0200-3	journal	October 2010
Adiabatic quantum programming: minor embedding with hard faults Klymko, Christine; Sullivan, Blair D.; Humble, Travis S. Quantum Information Processing, Vol. 13, Issue 3 https://doi.org/10.1007/s11128-013-0683-9	journal	November 2013
Algorithms for quantum computation: discrete logarithms and factoring Shor, P. W. Proceedings 35th Annual Symposium on Foundations of Computer Science https://doi.org/10.1109/SFCS.1994.365700	conference	January 1994
Genotype Imputation Li, Yun; Willer, Cristen; Sanna, Serena Annual Review of Genomics and Human Genetics, Vol. 10, Issue 1 https://doi.org/10.1146/annurev.genom.9.081307.164242	journal	September 2009
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods Cristianini, Nello; Shawe-Taylor, John https://doi.org/10.1017/CBO9780511801389	book	January 2013
Probabilistic quantum logic operations using polarizing beam splitters Pittman, T. B.; Jacobs, B. C.; Franson, J. D. Physical Review A, Vol. 64, Issue 6 https://doi.org/10.1103/PhysRevA.64.062311	journal	November 2001
The complexity of theorem-proving procedures Cook, Stephen A. Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 https://doi.org/10.1145/800157.805047	conference	January 1971
Digitized adiabatic quantum computing with a superconducting circuit Barends, R.; Shabani, A.; Lamata, L. Nature, Vol. 534, Issue 7606 https://doi.org/10.1038/nature17658	journal	June 2016
Airline Scheduling: An Overview Etschmaier, Maximilian M.; Mathaisel, Dennis F. X. Transportation Science, Vol. 19, Issue 2 https://doi.org/10.1287/trsc.19.2.127	journal	May 1985
A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers Potok, Thomas E.; Schuman, Catherine D.; Young, Steven R. 2016 2nd Workshop on Machine Learning in HPC Environments (MLHPC) https://doi.org/10.1109/MLHPC.2016.009	conference	November 2016
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets Hamilton, Kathleen E.; Humble, Travis S. Quantum Information Processing, Vol. 16, Issue 4 https://doi.org/10.1007/s11128-016-1513-7	journal	February 2017
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer Shor, Peter W. SIAM Review, Vol. 41, Issue 2 https://doi.org/10.1137/S0036144598347011	journal	January 1999
On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction Turing, A. M. Proceedings of the London Mathematical Society, Vol. s2-43, Issue 1 https://doi.org/10.1112/plms/s2-43.6.544	journal	January 1938
Fast clique minor generation in Chimera qubit connectivity graphs Boothby, Tomas; King, Andrew D.; Roy, Aidan Quantum Information Processing, Vol. 15, Issue 1 https://doi.org/10.1007/s11128-015-1150-6	journal	October 2015
Adiabatic quantum computation with Rydberg-dressed atoms Keating, Tyler; Goyal, Krittika; Jau, Yuan-Yu Physical Review A, Vol. 87, Issue 5, Article No. 052314 https://doi.org/10.1103/PhysRevA.87.052314	journal	May 2013
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis Lewis, Mark; Glover, Fred Networks, Vol. 70, Issue 2 https://doi.org/10.1002/net.21751	journal	June 2017
Investigating TSP Heuristics for Location-Based Services Huang, Weihuang; Yu, Jeffrey Xu Data Science and Engineering, Vol. 2, Issue 1 https://doi.org/10.1007/s41019-016-0030-0	journal	February 2017
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem Choi, Vicky Quantum Information Processing, Vol. 7, Issue 5 https://doi.org/10.1007/s11128-008-0082-9	journal	September 2008
Quantum Information Processing Using Quantum Dot Spins and Cavity QED Imamog¯lu, A.; Awschalom, D. D.; Burkard, G. Physical Review Letters, Vol. 83, Issue 20 https://doi.org/10.1103/PhysRevLett.83.4204	journal	November 1999
Hybrid quantum annealing via molecular dynamics Irie, Hirotaka; Liang, Haozhao; Doi, Takumi Scientific Reports, Vol. 11, Issue 1 https://doi.org/10.1038/s41598-021-87676-z	journal	April 2021
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer Shor, Peter W. SIAM Journal on Computing, Vol. 26, Issue 5 https://doi.org/10.1137/s0097539795293172	journal	October 1997
An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem Shmygelska, Alena; Hoos, Holger H. BioMed Central https://doi.org/10.14288/1.0223754	text	January 2005
Genotype imputation Yun, Li,; Serena, Sanna,; Cristen, Willer, The University of North Carolina at Chapel Hill University Libraries https://doi.org/10.17615/53ch-qy35	text	January 2009
Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem Choi, Vicky arXiv https://doi.org/10.48550/arxiv.0804.4884	text	January 2008
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design Choi, Vicky arXiv https://doi.org/10.48550/arxiv.1001.3116	text	January 2010
Adiabatic quantum computation with Rydberg-dressed atoms Keating, Tyler; Goyal, Krittika; Jau, Yuan-Yu arXiv https://doi.org/10.48550/arxiv.1209.4112	text	January 2012
A single-atom electron spin qubit in silicon Pla, Jarryd J.; Tan, Kuan Y.; Dehollain, Juan P. arXiv https://doi.org/10.48550/arxiv.1305.4481	text	January 2013
A case study in programming a quantum annealer for hard operational planning problems Rieffel, Eleanor G.; Venturelli, Davide; O'Gorman, Bryan arXiv https://doi.org/10.48550/arxiv.1407.2887	text	January 2014
Mapping constrained optimization problems to quantum annealing with application to fault diagnosis Bian, Zhengbing; Chudak, Fabian; Israel, Robert arXiv https://doi.org/10.48550/arxiv.1603.03111	preprint	January 2016
Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis Lewis, Mark; Glover, Fred arXiv https://doi.org/10.48550/arxiv.1705.09844	preprint	January 2017
A fast quantum mechanical algorithm for database search Grover, Lov K. arXiv https://doi.org/10.48550/arxiv.quant-ph/9605043	preprint	January 1996

Cited By (2)

Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models Glover, Fred; Kochenberger, Gary; Du, Yu 4OR, Vol. 17, Issue 4 https://doi.org/10.1007/s10288-019-00424-y	journal	November 2019
Embedding Equality Constraints of Optimization Problems into a Quantum Annealer Vyskocil, Tomas; Djidjev, Hristo Algorithms, Vol. 12, Issue 4 https://doi.org/10.3390/a12040077	journal	April 2019

Similar Records

Posiform planting: generating QUBO instances for benchmarking

Journal Article · Tue Nov 21 00:00:00 EST 2023 · Frontiers in Computer Science · OSTI ID:1557505

Hahn, Georg; Pelofske, Elijah; Djidjev, Hristo N.

Noise dynamics of quantum annealers: estimating the effective noise using idle qubits

Journal Article · Fri Apr 21 00:00:00 EDT 2023 · Quantum Science and Technology · OSTI ID:1557505

Pelofske, Elijah; Hahn, Georg; Djidjev, Hristo N.

Sampling electronic structure quadratic unconstrained binary optimization problems (QUBOs) with Ocean and Mukai solvers

Journal Article · Fri Feb 11 00:00:00 EST 2022 · PLoS ONE · OSTI ID:1557505

Teplukhin, Alexander; Kendrick, Brian K.; Mniszewski, Susan M.; +3 more

Related Subjects

97 MATHEMATICS AND COMPUTING
Adiabatic quantum computing
Embedding
Quadratic unconstrained binary optimization (QUBO)

Title: Efficiently embedding QUBO problems on adiabatic quantum computers

Citation Formats

References (40)

Cited By (2)

Similar Records

Related Subjects