• Home
  • Search
  • Efficiently embedding QUBO problems on adiabatic quantum computers
  • Cite Icon90
  • https://doi.org/10.1007/s11128-019-2236-3Copy DOI Icon

Efficiently embedding QUBO problems on adiabatic quantum computers

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

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. However, 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. In this work, 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.

Similar Papers
  • Research Article
  • Citations165

Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice

  • Jul 31, 2014
  • Synthesis Lectures on Quantum Computing
  • Catherine C Mcgeoch
  • Book Chapter
  • Citations42

Adiabatic Quantum Computing and Quantum Annealing

  • Jul 30, 2020
  • Erica K Grant +1
  • Preprint Article

Quantum Computing: Foundational and Theoretical Models

  • Jul 24, 2025
  • Adam Nasser
  • Research Article
  • Citations33

Quantum Annealing versus Digital Computing

  • Jul 09, 2021
  • ACM Journal of Experimental Algorithmics
  • Michael Jünger +6
  • Research Article
  • Citations154

Decoherence in adiabatic quantum computation

  • Jun 17, 2015
  • Physical Review A
  • Tameem Albash +1
  • PDF
  • Research Article
  • Citations20

How to test the “quantumness” of a quantum computer?

  • May 30, 2014
  • Frontiers in Physics
  • Alexandre M Zagoskin +4
  • Research Article
  • Citations56

Experimental realization of quantum algorithms for a linear system inspired by adiabatic quantum computing

  • Jan 14, 2019
  • Physical Review A
  • Jingwei Wen +5
  • Book Chapter
  • Citations7

The Advantage of Intelligent Algorithms for TSP

  • Nov 30, 2010
  • Yuan-Bin Mo
  • Research Article

Revolutionizing Optimization and Deep Learning: A Thermodynamic Hybrid Network Inspired by the Nobel Prize in Physics 2024

  • Jan 01, 2024
  • International Journal of Computational Mathematical Ideas
  • Satyanarayana S
  • Research Article

Classical computation over quantum architectures

  • Jul 31, 2024
  • Journal of Logic and Computation
  • Alex Della Schiava +2
  • Book Chapter

Quasi-Optimization of the Time Dependent Traveling Salesman Problem by Intuitionistic Fuzzy Model and Memetic Algorithm

  • Jan 01, 2020
  • Ruba Almahasneh +3
  • Book Chapter
  • Citations2

Chapter 5 - Quantum Algorithms and Methods

  • Jan 01, 2021
  • Quantum Information Processing, Quantum Computing, and Quantum Error Correction
  • Ivan B Djordjević
  • PDF
  • Research Article
  • Citations4

Assessing the quantumness of the annealing dynamics via Leggett Garg\u2019s inequalities: a weak measurement approach

  • Sep 20, 2019
  • Scientific Reports
  • V Vitale +5
  • Research Article
  • Citations4

Hybrid Lion Swarm Optimization Algorithm for Solving Traveling Salesman Problem

  • May 01, 2020
  • Journal of Physics: Conference Series
  • Yan Yang +2
  • Conference Article
  • Citations29

An efficient genetic algorithm for solving the generalized traveling salesman problem

  • Aug 01, 2010
  • Oliviu Matei +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.