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

Journal of Systems and Software

Dynamic analysis of quantum annealing programs

Ricardo Pérez‐Castillo, Luis Jiménez-Navajas, Mario G. Piattini

Published Mar 24, 2023• 2 citations
Publisher
DOI
10.1016/j.jss.2023.111683

Related papers

Analytic study of quantum annealing

悟史 森田

•Jan 1, 2008•1 citation

Comparative Studies of Quantum Annealing, Digital Annealing, and Classical Solvers for Reaction Network Pathway Analysis and mRNA Codon Selection

Milind Upadhyay, Mark Jones

For various optimization problems, the classical time to solution is super-polynomial and intractable to solve with classical bit-based computing hardware to date. Digital and quantum annealers have the potential to identify near-optimal solutions for such optimization problems using a quadratic unconstrained binary optimization (QUBO) problem formulation. This work benchmarks two use cases to evaluate the utility of QUBO solvers for combinatorial optimization problems, in order to determine if a QUBO formulation and annealing-based algorithms have an advantage over classical mixed-integer programming (MIP) and constraint programming (CP) solvers. Various QUBO and solver metrics such as problem mapping, quantitative interconnectivity, penalty structure, solver minimum cost (obtained optimal value) and solver time to solution have been applied to evaluate different QUBO problems. Constrained and unconstrained QUBO solvers are compared including the Fujitsu digital annealer (DA), various D-Wave hybrid quantum annealing solvers (QA, HQA), and the classical MIP/CP solvers HiGHS, Gurobi, SCIP, and CP-SAT. The two industrially relevant use cases are reaction network pathway analysis and mRNA codon selection. For reaction pathway analysis, classical MIP/CP solvers (especially Gurobi and CP-SAT) are observed to solve the problem to optimality in reasonable time frames. For mRNA codon selection, Gurobi outperformed all other solvers in time to solution for all problem sizes, followed by CP-SAT and the D-Wave Nonlinear (NL) HQA solver.

arXiv:2509.09862•Sep 11, 2025•0 citations

Statistical Analysis of Quantum Annealing

Yazhen Wang, Shang Wu, Hongzhi Liu

Statistica Sinica•Nov 29, 2021•0 citations

Hybrid Algorithm of Linear Programming Relaxation and Quantum Annealing

Taisei Takabayashi, Masayuki Ohzeki

The demand for classical-quantum hybrid algorithms to solve large-scale combinatorial optimization problems using quantum annealing (QA) has increased. One approach involves obtaining an approximate solution using classical algorithms and refining it using QA. In previous studies, such variables were determined using molecular dynamics (MD) as a continuous optimization method. We propose a method that uses the simple continuous relaxation technique called linear programming (LP) relaxation. Our method demonstrated superiority through comparative experiments with the minimum vertex cover problem versus the previous MD-based approach. Furthermore, the hybrid approach of LP relaxation and simulated annealing showed advantages in accuracy and speed compared to solving with simulated annealing alone.

arXiv:2308.10765•Journal of the Physical Society of Japan•Feb 5, 2024•7 citations

Reverse Engineering of Hamiltonian Expressions from D-Wave programs

Ricardo Pérez‐Castillo, Luis Jiménez-Navajas, Mario G. Piattini

Quantum annealing software has achieved a certain market penetration since it has demonstrated a good performance for optimization problems. The problem definitions (Hamiltonians functions to be minimized) are usually built in combination with classical software that can evolve over time. Thus, it is difficult to comprehend the underlying Hamiltonian and represent it in an accurate way for maintaining such programs. Although some reverse engineering techniques have been proposed for gate-based software, there are no choices to accomplish reverse engineering in quantum annealing. This research proposes a dynamic analysis technique of D-Wave (python) programs for reversing Hamiltonians, which has been preliminarily evaluated with nine programs. The technique also represents those expressions by using the Knowledge Discovery Metamodel (ISO/IEC 19506). Due to the usage of this standard, the outgoing expressions can be represented in combination with other parts of classical-quantum software systems. Thus, the main implication is that this technique contributes to the software modernization of/towards hybrid information systems.

IEEE International Conference on Quantum Software (QSW)•Jul 1, 2022•3 citations

Optimization algorithms for Quantum Annealing

E. Arvidsson

•Jan 1, 2020•0 citations
For various optimization problems, the classical time to solution is super-polynomial and intractable to solve with classical bit-based computing hardware to date. Digital and quantum annealers have the potential to identify near-optimal solutions for such optimization problems using a quadratic unconstrained binary optimization (QUBO) problem formulation. This work benchmarks two use cases to evaluate the utility of QUBO solvers for combinatorial optimization problems, in order to determine if a QUBO formulation and annealing-based algorithms have an advantage over classical mixed-integer programming (MIP) and constraint programming (CP) solvers. Various QUBO and solver metrics such as problem mapping, quantitative interconnectivity, penalty structure, solver minimum cost (obtained optimal value) and solver time to solution have been applied to evaluate different QUBO problems. Constrained and unconstrained QUBO solvers are compared including the Fujitsu digital annealer (DA), various D-Wave hybrid quantum annealing solvers (QA, HQA), and the classical MIP/CP solvers HiGHS, Gurobi, SCIP, and CP-SAT. The two industrially relevant use cases are reaction network pathway analysis and mRNA codon selection. For reaction pathway analysis, classical MIP/CP solvers (especially Gurobi and CP-SAT) are observed to solve the problem to optimality in reasonable time frames. For mRNA codon selection, Gurobi outperformed all other solvers in time to solution for all problem sizes, followed by CP-SAT and the D-Wave Nonlinear (NL) HQA solver.
The demand for classical-quantum hybrid algorithms to solve large-scale combinatorial optimization problems using quantum annealing (QA) has increased. One approach involves obtaining an approximate solution using classical algorithms and refining it using QA. In previous studies, such variables were determined using molecular dynamics (MD) as a continuous optimization method. We propose a method that uses the simple continuous relaxation technique called linear programming (LP) relaxation. Our method demonstrated superiority through comparative experiments with the minimum vertex cover problem versus the previous MD-based approach. Furthermore, the hybrid approach of LP relaxation and simulated annealing showed advantages in accuracy and speed compared to solving with simulated annealing alone.
Quantum annealing software has achieved a certain market penetration since it has demonstrated a good performance for optimization problems. The problem definitions (Hamiltonians functions to be minimized) are usually built in combination with classical software that can evolve over time. Thus, it is difficult to comprehend the underlying Hamiltonian and represent it in an accurate way for maintaining such programs. Although some reverse engineering techniques have been proposed for gate-based software, there are no choices to accomplish reverse engineering in quantum annealing. This research proposes a dynamic analysis technique of D-Wave (python) programs for reversing Hamiltonians, which has been preliminarily evaluated with nine programs. The technique also represents those expressions by using the Knowledge Discovery Metamodel (ISO/IEC 19506). Due to the usage of this standard, the outgoing expressions can be represented in combination with other parts of classical-quantum software systems. Thus, the main implication is that this technique contributes to the software modernization of/towards hybrid information systems.