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

arXiv:1901.06526 · Frontiers in Physics

Floating-Point Calculations on a Quantum Annealer: Division and Matrix Inversion

Michael L. Rogers, Robert Singleton

Published Nov 6, 2020• 25 citations
arXivHTMLPDF

Abstract

Systems of linear equations are employed almost universally across a wide range of disciplines, from physics and engineering to biology, chemistry and statistics. Traditional solution methods such as Gaussian elimination become very time consuming for large matrices, and more efficient computational methods are desired. In the twilight of Moore\rq{}s Law, quantum computing is perhaps the most direct path out of the darkness. There are two complementary paradigms for quantum computing, namely, gated systems and quantum annealers. In this paper, we express floating point operations such as division and matrix inversion in terms of a {\em quadratic unconstrained binary optimization} (QUBO) problem, a formulation that is ideal for a quantum annealer. We first address floating point division, and then move on to matrix inversion. We provide a general algorithm for any number of dimensions, but we provide results from the D-Wave quantum anneler for 2x2 and 3x3 general matrices. Our algorithm scales to very large numbers of linear equations. We should also mention that our algorithm provides the full solution the the matrix problem, while HHL provides only an expectation value.

DOI
10.3389/fphy.2020.00265

Related papers

Solving linear systems by quadratic unconstrained binary optimization on D-Wave quantum annealing device

Kyungtaek Jun, Rebecca Conley, Yecheng Huang +2 more

Many quantum computing algorithms are being developed with the advent of quantum computers. Solving linear systems is one of the most fundamental problems in almost all of science and engineering. HHL algorithm, a monumental quantum algorithm for solving linear systems on the gate model quantum computers, was invented and several advanced variations have been developed. However, HHL-based algorithms have a lot of limitations in spite of their importance. We address solving linear systems on a D-Wave quantum annealing device. To formulate a quadratic unconstrained binary optimization (QUBO) model for a linear system solving problem, we make use of a linear least-square problem with binary representation of the solution. We validate this QUBO model on the D-Wave system and discuss the results.

•Apr 9, 2021•6 citations

Toward a QUBO-Based Density Matrix Electronic Structure Method

Christian F. A. Negre, Alejandro López‐Bezanilla, Yu Zhang +4 more

Density matrix electronic structure theory is used in many quantum chemistry methods to "alleviate" the computational cost that arises from directly using wave functions. Although density matrix based methods are computationally more efficient than wave function based methods, significant computational effort is involved. Because the Schrödinger equation needs to be solved as an eigenvalue problem, the time-to-solution scales cubically with the system size in mean-field type approaches such as Hartree-Fock and density functional theory and is solved as many times in order to reach charge or field self-consistency. We hereby propose and study a method to compute the density matrix by using a quadratic unconstrained binary optimization (QUBO) solver. This method could be useful to solve the problem with quantum computers and, more specifically, quantum annealers. Our proposed approach is based on a direct construction of the density matrix using a QUBO eigensolver. We explore the main parameters of the algorithm focusing on precision and efficiency. We show that, while direct construction of the density matrix using a QUBO formulation is possible, the efficiency and precision have room for improvement. Moreover, calculations performed with quantum annealing on D-Wave's new Advantage quantum computer are compared with results obtained with classical simulated annealing, further highlighting some problems of the proposed method. We also suggest alternative methods that could lead to a more efficient QUBO-based density matrix construction.

arXiv:2201.04720•Journal of Chemical Theory and Computation•Jun 3, 2022•8 citations

On the application of matrix congruence to QUBO formulations for systems of linear equations

Sun Woo Park, Hyunju Lee, Byung Chun Kim +2 more

Recent studies on quantum computing algorithms focus on excavating features of quantum computers which have potential for contributing to computational model enhancements. Among various approaches, quantum annealing methods effectively parallelize quadratic unconstrained binary optimization (QUBO) formulations of systems of linear equations. In this paper, we simplify these formulations by exploiting congruence of real symmetric matrices to diagonal matrices. We further exhibit computational merits of the proposed QUBO models, which can outperform classical algorithms such as QR and SVD decomposition.

arXiv:2111.00747•International Conference on Information and Communication Technology Convergence (ICTC)•Oct 20, 2021•1 citation

HUBO formulations for solving the eigenvalue problem

Kyungtaek Jun, Hyunju Lee

Solving the eigenvalue problem is particularly important in almost all fields of science and engineering. With the development of quantum computers, multiple algorithms have been proposed for this purpose. However, such methods are usually only applicable to matrices of specific types, such as unitary or Hermitian matrices. The quantum annealer of the D-Wave, a quantum computer, returns the minimum value of the quadratic unconstrained binary optimization (QUBO) model. Thus, quantum annealers can be leveraged to solve arbitrary eigenvalue problems by formulating corresponding QUBO models. In this paper, we propose two higher-order unconstrained optimization (HUBO) formulations to solve eigenvalue problems involving n×n general matrices. In addition, we use a formula to reduce the order and convert the HUBO model into a QUBO model. Further, by using a quantum approximate optimization algorithm, this method can be extended to a gate-model quantum computer.

Results in Control and Optimization•Jan 1, 2022•9 citations

Quantum linear solvers for scientific computing: a comparison of VQLS, HHL and quantum annealing on time-fractional diffusion problems

Amir Hossein Salehi Shayegan

Time-fractional diffusion equations have emerged as powerful models for describing anomalous transport phenomena in physics, biology and engineering. To address the computational challenges arising from their non-local operators, we employ the WEB-spline finite element method, which provides a flexible and accurate discretization framework. The resulting linear system of equations are then explored in the context of quantum computing. Specifically, we investigate three prominent quantum linear solvers: the variational quantum linear solver (VQLS), the Harrow-Hassidim-Lloyd (HHL) algorithm and quantum annealing (QA). VQLS leverages hybrid variational techniques and shallow circuits, making it well-suited for noisy intermediate-scale quantum (NISQ) devices, while HHL offers a theoretically exponential speedup for sparse systems but requires deep fault-tolerant circuits. QA, in contrast, reformulates the problem into a quadratic unconstrained binary optimization (QUBO) instance, enabling approximate solutions through energy minimization on specialized hardware. We present a comparative analysis in terms of circuit depth, noise resilience, scalability and solution extraction, including the role of quantum state tomography in reconstructing classical information. Numerical experiments on a time-fractional diffusion problem highlight the complementary strengths and limitations of each method. This study bridges advanced numerical discretization with emerging quantum algorithms, providing insights into the feasibility and future potential of quantum-enhanced solvers for fractional partial differential equations.

Scientific Reports•Feb 23, 2026•3 citations

Solving Standard and Generalized EMPM Eigenvalue Problems: A QUBO Approach for the D-Wave Quantum Annealer

G. De Gregorio, C. De Lucia, Angelo Martone +6 more

Within the Equation of Motion Phonon Method (EMPM) framework, we address the computation of the ground-state eigenpair of nuclear Hamiltonians by reformulating the eigenvalue problem as a Quadratic Unconstrained Binary Optimization (QUBO). To this end, we adopt a QUBO-based iterative steepest-descent algorithm and validate its performance using Simulated An­nealing, demonstrating its feasibility for nuclear many-body calculations. This work represents a first step toward implementations on quantum annealers and extensions to the full eigenspectrum.

EPJ Web of Conferences•Jan 1, 2025•0 citations
Systems of linear equations are employed almost universally across a wide range of disciplines, from physics and engineering to biology, chemistry and statistics. Traditional solution methods such as Gaussian elimination become very time consuming for large matrices, and more efficient computational methods are desired. In the twilight of Moore\rq{}s Law, quantum computing is perhaps the most direct path out of the darkness. There are two complementary paradigms for quantum computing, namely, gated systems and quantum annealers. In this paper, we express floating point operations such as division and matrix inversion in terms of a {\em quadratic unconstrained binary optimization} (QUBO) problem, a formulation that is ideal for a quantum annealer. We first address floating point division, and then move on to matrix inversion. We provide a general algorithm for any number of dimensions, but we provide results from the D-Wave quantum anneler for 2x2 and 3x3 general matrices. Our algorithm scales to very large numbers of linear equations. We should also mention that our algorithm provides the full solution the the matrix problem, while HHL provides only an expectation value.
Many quantum computing algorithms are being developed with the advent of quantum computers. Solving linear systems is one of the most fundamental problems in almost all of science and engineering. HHL algorithm, a monumental quantum algorithm for solving linear systems on the gate model quantum computers, was invented and several advanced variations have been developed. However, HHL-based algorithms have a lot of limitations in spite of their importance. We address solving linear systems on a D-Wave quantum annealing device. To formulate a quadratic unconstrained binary optimization (QUBO) model for a linear system solving problem, we make use of a linear least-square problem with binary representation of the solution. We validate this QUBO model on the D-Wave system and discuss the results.
Density matrix electronic structure theory is used in many quantum chemistry methods to "alleviate" the computational cost that arises from directly using wave functions. Although density matrix based methods are computationally more efficient than wave function based methods, significant computational effort is involved. Because the Schrödinger equation needs to be solved as an eigenvalue problem, the time-to-solution scales cubically with the system size in mean-field type approaches such as Hartree-Fock and density functional theory and is solved as many times in order to reach charge or field self-consistency. We hereby propose and study a method to compute the density matrix by using a quadratic unconstrained binary optimization (QUBO) solver. This method could be useful to solve the problem with quantum computers and, more specifically, quantum annealers. Our proposed approach is based on a direct construction of the density matrix using a QUBO eigensolver. We explore the main parameters of the algorithm focusing on precision and efficiency. We show that, while direct construction of the density matrix using a QUBO formulation is possible, the efficiency and precision have room for improvement. Moreover, calculations performed with quantum annealing on D-Wave's new Advantage quantum computer are compared with results obtained with classical simulated annealing, further highlighting some problems of the proposed method. We also suggest alternative methods that could lead to a more efficient QUBO-based density matrix construction.
Recent studies on quantum computing algorithms focus on excavating features of quantum computers which have potential for contributing to computational model enhancements. Among various approaches, quantum annealing methods effectively parallelize quadratic unconstrained binary optimization (QUBO) formulations of systems of linear equations. In this paper, we simplify these formulations by exploiting congruence of real symmetric matrices to diagonal matrices. We further exhibit computational merits of the proposed QUBO models, which can outperform classical algorithms such as QR and SVD decomposition.
Solving the eigenvalue problem is particularly important in almost all fields of science and engineering. With the development of quantum computers, multiple algorithms have been proposed for this purpose. However, such methods are usually only applicable to matrices of specific types, such as unitary or Hermitian matrices. The quantum annealer of the D-Wave, a quantum computer, returns the minimum value of the quadratic unconstrained binary optimization (QUBO) model. Thus, quantum annealers can be leveraged to solve arbitrary eigenvalue problems by formulating corresponding QUBO models. In this paper, we propose two higher-order unconstrained optimization (HUBO) formulations to solve eigenvalue problems involving n×n general matrices. In addition, we use a formula to reduce the order and convert the HUBO model into a QUBO model. Further, by using a quantum approximate optimization algorithm, this method can be extended to a gate-model quantum computer.
Time-fractional diffusion equations have emerged as powerful models for describing anomalous transport phenomena in physics, biology and engineering. To address the computational challenges arising from their non-local operators, we employ the WEB-spline finite element method, which provides a flexible and accurate discretization framework. The resulting linear system of equations are then explored in the context of quantum computing. Specifically, we investigate three prominent quantum linear solvers: the variational quantum linear solver (VQLS), the Harrow-Hassidim-Lloyd (HHL) algorithm and quantum annealing (QA). VQLS leverages hybrid variational techniques and shallow circuits, making it well-suited for noisy intermediate-scale quantum (NISQ) devices, while HHL offers a theoretically exponential speedup for sparse systems but requires deep fault-tolerant circuits. QA, in contrast, reformulates the problem into a quadratic unconstrained binary optimization (QUBO) instance, enabling approximate solutions through energy minimization on specialized hardware. We present a comparative analysis in terms of circuit depth, noise resilience, scalability and solution extraction, including the role of quantum state tomography in reconstructing classical information. Numerical experiments on a time-fractional diffusion problem highlight the complementary strengths and limitations of each method. This study bridges advanced numerical discretization with emerging quantum algorithms, providing insights into the feasibility and future potential of quantum-enhanced solvers for fractional partial differential equations.
Within the Equation of Motion Phonon Method (EMPM) framework, we address the computation of the ground-state eigenpair of nuclear Hamiltonians by reformulating the eigenvalue problem as a Quadratic Unconstrained Binary Optimization (QUBO). To this end, we adopt a QUBO-based iterative steepest-descent algorithm and validate its performance using Simulated An­nealing, demonstrating its feasibility for nuclear many-body calculations. This work represents a first step toward implementations on quantum annealers and extensions to the full eigenspectrum.