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

• URL: http://arxiv.org/abs/2509.09862v2
• Date: Tue, 04 Nov 2025 14:03:05 GMT
• Title: Comparative Studies of Quantum Annealing, Digital Annealing, and Classical Solvers for Reaction Network Pathway Analysis and mRNA Codon Selection
• Abstract summary: Digital and quantum annealers have the potential to identify near-optimal solutions for optimisation problems.<n>This work benchmarks two use cases to evaluate the utility of QUBO solvers for optimization problems.<n>For reaction pathway analysis, classical MIP/CP solvers are observed to solve the problem to optimality in reasonable time frames.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Quantum Preconditioning For Constrained Optimization Problems [0.0]
  We study the effect of quantum preconditioning on constrained optimization problems.<n>The proposed approach uses two-point correlations between decision variables to construct a modified objective function.<n>Experiments on dense, weighted complete-graph instances show that the preconditioned problem instances reach near-optimal solutions faster.
  arXiv  Detail & Related papers  (2026-08-28T20:23:37Z)
• Efficient QAOA Architecture for Solving Multi-Constrained Optimization Problems [3.757262277494307]
  This paper proposes a novel combination of constraint encoding methods for the Quantum Approximate Optimization Ansatz.<n>One-hot constraints are enforced through $XY$-mixers that restrict the search space to the feasible sub-space naturally.<n>Since $XY$-mixers restrict the search space, specific state vector entries are always zero and can be omitted from the simulation, saving valuable memory and computing resources.
  arXiv  Detail & Related papers  (2025-06-03T17:46:53Z)
• Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling [0.0]
  We present a generic method to reformulate any problem into a Polynomial Unconstrained Binary Optimization (PUBO) problem. We also provide a generic reformulation into a Quadratic Unconstrained Binary Optimization (QUBO) problem. Our results illustrate that the PUBO reformulation outperforms the QUBO one for the problem at hand.
  arXiv  Detail & Related papers  (2024-11-15T09:23:52Z)
• Quantum optimization using a 127-qubit gate-model IBM quantum computer can outperform quantum annealers for nontrivial binary optimization problems [0.0]
  We introduce a comprehensive quantum solver for binary optimization problems on gate-model quantum computers. It consistently delivers correct solutions for problems with up to 127 qubits. We benchmark this solver on IBM quantum computers for several classically nontrivial unconstrained binary optimization problems.
  arXiv  Detail & Related papers  (2024-06-03T19:08:01Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• A hybrid Quantum-Classical Algorithm for Mixed-Integer Optimization in Power Systems [0.0]
  We present a framework for solving power system optimization problems with a Quantum Computer (QC) Our guiding applications are the optimal transmission switching and the verification of neural networks trained to solve a DC Optimal Power Flow.
  arXiv  Detail & Related papers  (2024-04-16T16:11:56Z)
• Guess What Quantum Computing Can Do for Test Case Optimization [43.89456212504871]
  In the near term, quantum approximate optimization algorithms (QAOAs) hold great potential to solve optimization problems. We present the first effort to formulate a software test case optimization problem as a QAOA problem and solve it on quantum computer simulators. To solve bigger test optimization problems that require many qubits, which are unavailable these days, we integrate a problem decomposition strategy with the QAOA.
  arXiv  Detail & Related papers  (2023-12-24T21:25:31Z)
• Evaluating the Practicality of Quantum Optimization Algorithms for Prototypical Industrial Applications [44.88678858860675]
  We investigate the application of the quantum approximate optimization algorithm (QAOA) and the quantum adiabatic algorithm (QAA) to the solution of a prototypical model in this field. We compare the performance of these two algorithms in terms of solution quality, using selected evaluation metrics.
  arXiv  Detail & Related papers  (2023-11-20T09:09:55Z)
• Quantum Annealing Solutions for the Closest String Problem with D-Wave Systems [0.0]
  Closest String Problem is an NP-complete problem which appears more commonly in bioinformatics and coding theory. Two QUBO formulations have been proposed, with one being a slight modification over the other. DWave annealers have been used, while providing guidelines for optimality on certain platform-specific concerns.
  arXiv  Detail & Related papers  (2023-10-19T16:03:25Z)
• A Review on Quantum Approximate Optimization Algorithm and its Variants [47.89542334125886]
  The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising variational quantum algorithm that aims to solve intractable optimization problems. This comprehensive review offers an overview of the current state of QAOA, encompassing its performance analysis in diverse scenarios. We conduct a comparative study of selected QAOA extensions and variants, while exploring future prospects and directions for the algorithm.
  arXiv  Detail & Related papers  (2023-06-15T15:28:12Z)
• Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors [48.68474702382697]
  Vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry. In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary variables.
  arXiv  Detail & Related papers  (2023-06-14T13:44:35Z)
• Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with GFlowNets [86.43523688236077]
  Combinatorial optimization (CO) problems are often NP-hard and out of reach for exact algorithms. GFlowNets have emerged as a powerful machinery to efficiently sample from composite unnormalized densities sequentially. In this paper, we design Markov decision processes (MDPs) for different problems and propose to train conditional GFlowNets to sample from the solution space.
  arXiv  Detail & Related papers  (2023-05-26T15:13:09Z)
• Evidence that PUBO outperforms QUBO when solving continuous optimization problems with the QAOA [4.670374869377859]
  A core step in solving optimization problems with quantum algorithms is the problem formulation. Recent studies show that many problems can be solved more efficiently in their native Polynomial Unconstrained Optimization forms. Our evaluation on suitable benchmark functions, shows that PUBO formulations generally yield better results, while requiring less qubits.
  arXiv  Detail & Related papers  (2023-05-05T09:37:48Z)
• Quantum-inspired optimization for wavelength assignment [51.55491037321065]
  We propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem. Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications.
  arXiv  Detail & Related papers  (2022-11-01T07:52:47Z)
• Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization [44.96576908957141]
  We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linear iterations problems on quantum computers.
  arXiv  Detail & Related papers  (2022-03-23T18:00:03Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)
• Multi-block ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers [3.04585143845864]
  We present a decomposition-based approach to extend the applicability of current approaches to "quadratic plus convex" mixed binary optimization problems. We show that the alternating direction method of multipliers (ADMM) can split the MBO into a binary unconstrained problem (that can be solved with quantum algorithms) The validity of the approach is then showcased by numerical results obtained on several optimization problems via simulations with VQE and QAOA on the quantum circuits implemented in Qiskit.
  arXiv  Detail & Related papers  (2020-01-07T14:43:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.