Efficiently embedding QUBO problems on adiabatic quantum computers

DOI10.1007/s11128-019-2236-3zbMath1417.81081OpenAlexW2919844071MaRDI QIDQ670075

Catherine Schuman, Thomas Potok, P. Date, Robert M. Patton

Publication date: 15 March 2019

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://www.osti.gov/biblio/1557505

zbMATH Keywords

embeddingadiabatic quantum computingquadratic unconstrained binary optimization (QUBO)

Mathematics Subject Classification ID

Related Items (8)

\(\mathrm{PUBO}_i\): a tunable benchmark with variable importance ⋮ Template-Based Minor Embedding for Adiabatic Quantum Optimization ⋮ Balanced \(k\)-means clustering on an adiabatic quantum computer ⋮ High-speed train timetable optimization based on space-time network model and quantum simulator ⋮ A complete restricted Boltzmann machine on an adiabatic quantum computer ⋮ Embedding equality constraints of optimization problems into a quantum annealer ⋮ Quantum bridge analytics. I: A tutorial on formulating and using QUBO models ⋮ Quantum bridge analytics. I: A tutorial on formulating and using QUBO models

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast clique minor generation in Chimera qubit connectivity graphs
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• Optimizing adiabatic quantum program compilation using a graph-theoretic framework
• Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report
• Learning Bayesian networks: The combination of knowledge and statistical data
• A case study in programming a quantum annealer for hard operational planning problems
• Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
• Adiabatic quantum programming: minor embedding with hard faults
• The Multiple Sequence Alignment Problem in Biology
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Multiprocessor Scheduling for Real-Time Systems
• The complexity of theorem-proving procedures
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction

This page was built for publication: Efficiently embedding QUBO problems on adiabatic quantum computers