Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Frontiers in Computer Science

Quantum annealing research at CMU: algorithms, hardware, applications

SRIDHAR R. TAYUR, Ananth Tenneti

Published Jan 5, 2024• 3 citations
Publisher

Abstract

In this mini-review, we introduce and summarize research from the Quantum Technologies Group (QTG) at Carnegie Mellon University related to computational experience with quantum annealing, performed in collaboration with several other institutions including IIT-Madras and NASA (QuAIL). We present a novel hybrid quantum-classical heuristic algorithm (GAMA, Graver Augmented Multi-seed Algorithm) for non-linear, integer optimization, and illustrate it on an application (in cancer genomics). We then present an algebraic geometry-based algorithm for embedding a problem onto a hardware that is not fully connected, along with a companion Integer Programming (IP) approach. Next, we discuss the performance of two photonic devices - the Temporal Multiplexed Ising Machine (TMIM) and the Spatial Photonic Ising Machine (SPIM) - on Max-Cut and Number Partitioning instances. We close with an outline of the current work.

DOI
10.3389/fcomp.2023.1286860

Related papers

Quantum Annealing for Combinatorial Optimization: Foundations, Architectures, Benchmarks, and Emerging Directions

Rudraksh Sharma, Ravi Katukam, Arjun Nagulapally

Critical decision-making issues in science, engineering, and industry are based on combinatorial optimization; however, its application is inherently limited by the NP-hard nature of the problem. A specialized paradigm of analogue quantum computing, quantum annealing (QA), has been proposed to solve these problems by encoding optimization problems into physical energy landscapes and solving them by quantum tunnelling systematically through exploration of solution space. This is a critical review that summarizes the current applications of quantum annealing to combinatorial optimization and includes a theoretical background, hardware designs, algorithm implementation strategies, encoding and embedding schemes, protocols to benchmark quantum annealing, areas of implementation, and links with the quantum algorithms implementation with gate-based hardware and classical solvers. We develop a unified framework, relating adiabatic quantum dynamics, Ising and QUBO models, stoquastic and non-stoquastic Hamiltonians, and diabatic transitions to modern flux-qubit annealers (Chimera, Pegasus, Zephyr topologies), and emergent architectures (Lechner-Hauke-Zoller systems, Rydberg atom platforms), and hybrids of quantum and classical computation. Through our analysis, we find that overhead in embedding and encoding is the largest determinant of the scalability and performance (this is not just the number of qubits). Minor embeddings also usually have a physical qubit count per logical variable of between 5 and 12 qubits, which limits effective problem capacity by 80-92% and, due to chain-breaking errors, compromises the quality of solutions.

quant-pharXiv:2602.03101•International Journal for Research in Applied Science and Engineering Technology•Feb 4, 2026•3 citations

Graver Bases via Quantum Annealing with Application to Non-Linear Integer Programs

Hedayat Alghassi, Raouf Dridi, SRIDHAR R. TAYUR

We propose a novel hybrid quantum-classical approach to calculate Graver bases, which have the potential to solve a variety of hard linear and non-linear integer programs, as they form a test set (optimality certificate) with very appealing properties. The calculation of Graver bases is exponentially hard (in general) on classical computers, so they not used for solving practical problems on commercial solvers. With a quantum annealer, however, it may be a viable approach to use them. We test two hybrid quantum-classical algorithms (on D-Wave)--one for computing Graver basis and a second for optimizing non-linear integer programs that utilize Graver bases--to understand the strengths and limitations of the practical quantum annealers available today. Our experiments suggest that with a modest increase in coupler precision--along with near-term improvements in the number of qubits and connectivity (density of hardware graph) that are expected--the ability to outperform classical best-in-class algorithms is within reach, with respect to non-linear integer optimization.

arXiv:1902.04215•Feb 12, 2019•18 citations

Optimization with photonic wave-based annealers

Anil Prabhakar, Parth S Shah, Gautham Umasankar +4 more

Many NP-hard combinatorial optimization (CO) problems can be cast as a quadratic unconstrained binary optimization model, which maps naturally to an Ising model. The final spin configuration in the Ising model can adiabatically arrive at a solution to a Hamiltonian, given a known set of interactions between spins. We enhance two photonic Ising machines (PIMs) and compare their performance against classical (Gurobi) and quantum (D-Wave) solvers. The temporal multiplexed coherent Ising machine (TMCIM) uses the bistable response of an electro-optic modulator to mimic the spin up and down states. We compare TMCIM performance on Max-cut problems. A spatial photonic Ising machine (SPIM) convolves the wavefront of a coherent laser beam with the pixel distribution of a spatial light modulator to adiabatically achieve a minimum energy configuration, and solve a number partitioning problem (NPP). Our computational results on Max-cut indicate that classical solvers are still a better choice, while our NPP results show that SPIM is better as the problem size increases. In both cases, connectivity in Ising hardware is crucial for performance. Our results also highlight the importance of better understanding which CO problems are most likely to benefit from which type of PIM. This article is part of the theme issue 'Quantum annealing and computation: challenges and perspectives'.

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Dec 4, 2022•17 citations

Quantum Annealing versus Digital Computing: An Experimental Comparison

Michael Jünger, Elisabeth Lobe, Petra Mutzel +4 more

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.

arXiv:1904.11965•ACM Journal of Experimental Algorithmics•Jul 9, 2021•62 citations

Hybrid Quantum Classical Integration

Aayushee G

Quantum annealing has emerged as an effective meta-heuristic for solving combinatorial optimization problems by leveraging quantum tunnelling to navigate complex energy landscapes. This paper examines both the theoretical foundations and the practical implementation of quantum annealing for project scheduling and resource-allocation problems formulated as Ising or Quadratic Unconstrained Binary Optimization (QUBO) models. A comprehensive explanation of the quantum annealing process is provided through a stage-by-stage process flowchart. In addition, the study discusses hybrid quantum classical frameworks in which quantum annealing is integrated with Monte Carlo simulations or digital twin environments, supported by illustrations of the optimization energy landscape and the hybrid system architecture. The adaptability of the proposed approach is further demonstrated through analogies with unit load device (ULD) configuration and other related combinatorial optimization problems across multiple application domains. Finally, the paper outlines key implementation considerations and evaluates the current level of technological maturity of quantum annealing for applications in construction planning and logistics optimization. Keywords: quantum annealing implementation; Ising model; QUBO; combinatorial optimization; project scheduling; hybrid quantum-classical; energy landscape; digital twin; Monte Carlo; supply-chain resilience; ULD configuration

International Journal of Creative and Open Research in Engineering and Management•Aug 22, 2026•0 citations

A Survey of Quantum Computing Algorithms for Mathematical Optimization: State-Of-The-Art in Research & Exploration of Further Possibilities

Sambuddha Chakrabarti, Satyasaran Changdar, Rajat Khanda

This paper presents a comprehensive review and systematic coverage of foundational quantum optimization algorithms-QAOA, Quantum Annealing, VQE, VQLS, and HHL-tracing their development all the way from Schrödinger's equation through gate-based quantum computing (Deutsch, Deutsch-Jozsa, Bernstein-Vazirani, QFT, Shor's, and Grover's algorithms) to hybrid quantum-classical approaches for NISQ-era hardware. We also present the transverse field Ising model's role in quantum annealing as well as practical hardware implementations with the Chimera, Pegasus, and Zephyr topologies of the D-Wave quantum annealer, addressing key challenges including barren plateaus, circuit trainability, and noise resilience. In the simulations section, quantum computing applications to collaborative filtering and social network optimization have been presented. We introduce two original contributions: (1) a quantum collaborative filtering model based on VQE principles that leverages quantum entanglement to represent user-item relationships, requiring logarithmically fewer parameters than classical embedding methods while accessing exponentially larger state spaces, and demonstrating test RMSE of 0.85 on synthetic data; and (2) a Quantum Social Network (QSN) framework modeling belief dynamics through superposition and entanglement, revealing emergent consensus and polarization phenomena validated via Qiskit simulations. By demonstrating that variational quantum algorithms can tackle real-world recommendation and network optimization problems on current hardware, we bridge theoretical quantum computing with practical machine learning applications and identify concrete pathways toward quantum advantage beyond traditional combinatorial optimization.

•Feb 11, 2026•0 citations
In this mini-review, we introduce and summarize research from the Quantum Technologies Group (QTG) at Carnegie Mellon University related to computational experience with quantum annealing, performed in collaboration with several other institutions including IIT-Madras and NASA (QuAIL). We present a novel hybrid quantum-classical heuristic algorithm (GAMA, Graver Augmented Multi-seed Algorithm) for non-linear, integer optimization, and illustrate it on an application (in cancer genomics). We then present an algebraic geometry-based algorithm for embedding a problem onto a hardware that is not fully connected, along with a companion Integer Programming (IP) approach. Next, we discuss the performance of two photonic devices - the Temporal Multiplexed Ising Machine (TMIM) and the Spatial Photonic Ising Machine (SPIM) - on Max-Cut and Number Partitioning instances. We close with an outline of the current work.
Critical decision-making issues in science, engineering, and industry are based on combinatorial optimization; however, its application is inherently limited by the NP-hard nature of the problem. A specialized paradigm of analogue quantum computing, quantum annealing (QA), has been proposed to solve these problems by encoding optimization problems into physical energy landscapes and solving them by quantum tunnelling systematically through exploration of solution space. This is a critical review that summarizes the current applications of quantum annealing to combinatorial optimization and includes a theoretical background, hardware designs, algorithm implementation strategies, encoding and embedding schemes, protocols to benchmark quantum annealing, areas of implementation, and links with the quantum algorithms implementation with gate-based hardware and classical solvers. We develop a unified framework, relating adiabatic quantum dynamics, Ising and QUBO models, stoquastic and non-stoquastic Hamiltonians, and diabatic transitions to modern flux-qubit annealers (Chimera, Pegasus, Zephyr topologies), and emergent architectures (Lechner-Hauke-Zoller systems, Rydberg atom platforms), and hybrids of quantum and classical computation. Through our analysis, we find that overhead in embedding and encoding is the largest determinant of the scalability and performance (this is not just the number of qubits). Minor embeddings also usually have a physical qubit count per logical variable of between 5 and 12 qubits, which limits effective problem capacity by 80-92% and, due to chain-breaking errors, compromises the quality of solutions.
We propose a novel hybrid quantum-classical approach to calculate Graver bases, which have the potential to solve a variety of hard linear and non-linear integer programs, as they form a test set (optimality certificate) with very appealing properties. The calculation of Graver bases is exponentially hard (in general) on classical computers, so they not used for solving practical problems on commercial solvers. With a quantum annealer, however, it may be a viable approach to use them. We test two hybrid quantum-classical algorithms (on D-Wave)--one for computing Graver basis and a second for optimizing non-linear integer programs that utilize Graver bases--to understand the strengths and limitations of the practical quantum annealers available today. Our experiments suggest that with a modest increase in coupler precision--along with near-term improvements in the number of qubits and connectivity (density of hardware graph) that are expected--the ability to outperform classical best-in-class algorithms is within reach, with respect to non-linear integer optimization.
Many NP-hard combinatorial optimization (CO) problems can be cast as a quadratic unconstrained binary optimization model, which maps naturally to an Ising model. The final spin configuration in the Ising model can adiabatically arrive at a solution to a Hamiltonian, given a known set of interactions between spins. We enhance two photonic Ising machines (PIMs) and compare their performance against classical (Gurobi) and quantum (D-Wave) solvers. The temporal multiplexed coherent Ising machine (TMCIM) uses the bistable response of an electro-optic modulator to mimic the spin up and down states. We compare TMCIM performance on Max-cut problems. A spatial photonic Ising machine (SPIM) convolves the wavefront of a coherent laser beam with the pixel distribution of a spatial light modulator to adiabatically achieve a minimum energy configuration, and solve a number partitioning problem (NPP). Our computational results on Max-cut indicate that classical solvers are still a better choice, while our NPP results show that SPIM is better as the problem size increases. In both cases, connectivity in Ising hardware is crucial for performance. Our results also highlight the importance of better understanding which CO problems are most likely to benefit from which type of PIM. This article is part of the theme issue 'Quantum annealing and computation: challenges and perspectives'.
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.
Quantum annealing has emerged as an effective meta-heuristic for solving combinatorial optimization problems by leveraging quantum tunnelling to navigate complex energy landscapes. This paper examines both the theoretical foundations and the practical implementation of quantum annealing for project scheduling and resource-allocation problems formulated as Ising or Quadratic Unconstrained Binary Optimization (QUBO) models. A comprehensive explanation of the quantum annealing process is provided through a stage-by-stage process flowchart. In addition, the study discusses hybrid quantum classical frameworks in which quantum annealing is integrated with Monte Carlo simulations or digital twin environments, supported by illustrations of the optimization energy landscape and the hybrid system architecture. The adaptability of the proposed approach is further demonstrated through analogies with unit load device (ULD) configuration and other related combinatorial optimization problems across multiple application domains. Finally, the paper outlines key implementation considerations and evaluates the current level of technological maturity of quantum annealing for applications in construction planning and logistics optimization. Keywords: quantum annealing implementation; Ising model; QUBO; combinatorial optimization; project scheduling; hybrid quantum-classical; energy landscape; digital twin; Monte Carlo; supply-chain resilience; ULD configuration
This paper presents a comprehensive review and systematic coverage of foundational quantum optimization algorithms-QAOA, Quantum Annealing, VQE, VQLS, and HHL-tracing their development all the way from Schrödinger's equation through gate-based quantum computing (Deutsch, Deutsch-Jozsa, Bernstein-Vazirani, QFT, Shor's, and Grover's algorithms) to hybrid quantum-classical approaches for NISQ-era hardware. We also present the transverse field Ising model's role in quantum annealing as well as practical hardware implementations with the Chimera, Pegasus, and Zephyr topologies of the D-Wave quantum annealer, addressing key challenges including barren plateaus, circuit trainability, and noise resilience. In the simulations section, quantum computing applications to collaborative filtering and social network optimization have been presented. We introduce two original contributions: (1) a quantum collaborative filtering model based on VQE principles that leverages quantum entanglement to represent user-item relationships, requiring logarithmically fewer parameters than classical embedding methods while accessing exponentially larger state spaces, and demonstrating test RMSE of 0.85 on synthetic data; and (2) a Quantum Social Network (QSN) framework modeling belief dynamics through superposition and entanglement, revealing emergent consensus and polarization phenomena validated via Qiskit simulations. By demonstrating that variational quantum algorithms can tackle real-world recommendation and network optimization problems on current hardware, we bridge theoretical quantum computing with practical machine learning applications and identify concrete pathways toward quantum advantage beyond traditional combinatorial optimization.