Quantum Solvers for Nonlinear Matrix Equations in Quantum Chemistry
- URL: http://arxiv.org/abs/2605.16189v1
- Date: Fri, 15 May 2026 17:07:14 GMT
- Title: Quantum Solvers for Nonlinear Matrix Equations in Quantum Chemistry
- Abstract summary: We present a quantum algorithm for solving Riccati equations.<n>This work provides a framework for quantum algorithms for nonlinear matrix equations in quantum chemistry.
- Score: 11.218945427523701
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We present a quantum algorithm for solving algebraic Riccati equations, with applications to quantum-chemical random-phase approximation (RPA) and higher-order RPA theories. Our method block-encodes stabilizing Riccati solutions via Riesz projectors onto invariant subspaces of an associated non-normal matrix, implemented using contour-integral resolvents and quantum singular value transformations. Applied to $m$-particle, $m$-hole RPA, our algorithm yields a block-encoding of the amplitude solution and estimates the electronic correlation-energy density with it. Under localized-orbital sparsity assumptions, the end-to-end cost scales linearly with system size and polynomially with excitation rank $m$, suggesting an exponential advantage in $m$ over plausible classical local-correlation heuristics. More broadly, this work provides a framework for quantum algorithms for nonlinear matrix equations in quantum chemistry and opens a possible route toward developing quantum algorithms for coupled-cluster theory.
Related papers
- Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems [0.007807026251125201]
We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations.<n>For unitary or dissipative dynamics, the algorithm computes an entry of the solution matrix with query $widetildemathcalO(mathcalL t/)$.<n>We demonstrate the utility of the algorithm through an end-to-end application, namely the simulation of dissipative dynamics for non-interacting fermions.
arXiv Detail & Related papers (2026-05-15T17:11:07Z) - Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
arXiv Detail & Related papers (2026-02-11T07:24:33Z) - Quantum Orthogonal Separable Physics-Informed Neural Networks [0.0]
This paper introduces Quantum Orthogonal Separable Physics-Informed Neural Networks (QO-SPINNs), a novel architecture for solving Partial Differential Equations.<n>We leverage a quantum algorithm for accelerating matrix multiplication within each layer, achieving a $mathcal O(dlog d/2)$ complexity.<n>We provide a robust and efficient framework for uncertainty quantification (UQ) which, to our knowledge, is the first UQ method specifically designed for Separable PINNs.
arXiv Detail & Related papers (2025-11-16T14:15:19Z) - Quantum Algorithms for Solving Generalized Linear Systems via Momentum Accelerated Gradient and Schrödingerization [34.04094622012203]
We propose a quantum algorithm that combines the momentum accelerated gradient method with Schr"odingerization.<n>The algorithm achieves speedup over its classical counterpark in solving linear systems.<n>It can overcome the practical limitations of existing non-Schr"odingerization-based quantum linear system algorithms.
arXiv Detail & Related papers (2025-09-20T08:40:53Z) - Quantum Algorithms for Stochastic Differential Equations: A Schrödingerisation Approach [29.662683446339194]
We propose quantum algorithms for linear differential equations.<n>The gate complexity of our algorithms exhibits an $mathcalO(dlog(Nd))$ dependence on the dimensions.<n>The algorithms are numerically verified for the Ornstein-Uhlenbeck processes, Brownian motions, and one-dimensional L'evy flights.
arXiv Detail & Related papers (2024-12-19T14:04:11Z) - Design nearly optimal quantum algorithm for linear differential equations via Lindbladians [14.546015336189297]
We propose a new quantum algorithm for solving ODEs by harnessing open quantum systems.<n>We use non-diagonal density matrix encoding to encode general linear ODEs into the non-diagonal blocks of density matrices.<n>Our algorithm can outperform all existing quantum ODE algorithms and achieve near-optimal dependence on all parameters under a plausible input model.
arXiv Detail & Related papers (2024-10-25T15:27:41Z) - Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Hybrid quantum-classical and quantum-inspired classical algorithms for
solving banded circulant linear systems [0.8192907805418583]
We present an efficient algorithm based on convex optimization of combinations of quantum states to solve for banded circulant linear systems.
By decomposing banded circulant matrices into cyclic permutations, our approach produces approximate solutions to such systems with a combination of quantum states linear to $K$.
We validate our methods with classical simulations and actual IBM quantum computer implementation, showcasing their applicability for solving physical problems such as heat transfer.
arXiv Detail & Related papers (2023-09-20T16:27:16Z) - A hybrid quantum-classical algorithm for multichannel quantum scattering
of atoms and molecules [62.997667081978825]
We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions.
The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix.
We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
arXiv Detail & Related papers (2023-04-12T18:10:47Z) - Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron
Correlation [58.720142291102135]
We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer.
We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
arXiv Detail & Related papers (2021-06-22T18:00:00Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z) - Hybrid quantum variational algorithm for simulating open quantum systems
with near-term devices [0.0]
Hybrid quantum-classical (HQC) algorithms make it possible to use near-term quantum devices supported by classical computational resources.
We develop an HQC algorithm using an efficient variational optimization approach to simulate open system dynamics.
arXiv Detail & Related papers (2020-08-12T13:49:29Z)
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.