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

International Journal of Theoretical Physics

Quantum Algorithms and Circuits for Linear Equations with Infinite or No Solutions

Jin‐Min Liang, Shu‐Qian Shen, Ming Li

Published May 28, 2019• 7 citations
Publisher
DOI
10.1007/s10773-019-04151-2

Related papers

Quantum algorithm and circuit design solving the Poisson equation

Yudong Cao, Anargyros Papageorgiou, Iasonas Petras +2 more

The Poisson equation occurs in many areas of science and engineering. Here we focus on its numerical solution for an equation in d dimensions. In particular we present a quantum algorithm and a scalable quantum circuit design which approximates the solution of the Poisson equation on a grid with error ε . We assume we are given a superposition of function evaluations of the right-hand side of the Poisson equation. The algorithm produces a quantum state encoding the solution. The number of quantum operations and the number of qubits used by the circuit is almost linear in d and polylog in ε −1 . We present quantum circuit modules together with performance guarantees which can also be used for other problems.

arXiv:1207.2485•New Journal of Physics•Jan 11, 2013•234 citations

Quantum algorithm for linear systems

Yunah Choi, Jeihee Cho, Shiho Kim

Advances in computers•Nov 29, 2025•0 citations

A quantum algorithm for linear differential equations with layerwise parameterized quantum circuits

Junxiang Xiao, Jingwei Wen, Zengrong Zhou +4 more

Abstract Solving linear differential equations is a common problem in almost all fields of science and engineering. Here, we present a variational algorithm with shallow circuits for solving such a problem: given an $$N \times N$$ N × N matrix $${\varvec{A}}$$ A , an N-dimensional vector $$\varvec{b}$$ b , and an initial vector $$\varvec{x}(0)$$ x ( 0 ) , how to obtain the solution vector $$\varvec{x}(T)$$ x ( T ) at time T according to the constraint $$\textrm{d}\varvec{x}(t)/\textrm{d} t = {\varvec{A}}\varvec{x}(t) + \varvec{b}$$ d x ( t ) / d t = A x ( t ) + b . The core idea of the algorithm is to encode the equations into a ground state problem of the Hamiltonian, which is solved via hybrid quantum-classical methods with high fidelities. Compared with the previous works, our algorithm requires the least qubit resources and can restore the entire evolutionary process. In particular, we show its application in simulating the evolution of harmonic oscillators and dynamics of non-Hermitian systems with $$\mathcal{P}\mathcal{T}$$ P T -symmetry. Our algorithm framework provides a key technique for solving so many important problems whose essence is the solution of linear differential equations.

AAPPS bulletin•Mar 4, 2024•3 citations

Quantum Algorithms and Applications

Melinda Andrews, Joseph Stephen Dulny, Andrew N. Glaudell +6 more

•Sep 1, 2020•0 citations

Quantum algorithm for solving linear differential equations: Theory and experiment

Tao Xin, Shijie Wei, Jianlian Cui +7 more

Solving linear differential equations (LDEs) is a hard problem for classical computers, while quantum algorithms have been proposed to be capable of speeding up the calculation. However, they are yet to be realized in experiment as it cannot be easily converted into an implementable quantum circuit. Here, we present and experimentally realize an implementable gate-based quantum algorithm for efficiently solving the LDE problem: given an $N\ifmmode\times\else\texttimes\fi{}N$ matrix $\mathcal{M}$, an $N$-dimensional vector $\mathbf{b}$, and an initial vector $\mathbf{x}(0)$, we obtain a target vector $\mathbf{x}(t)$ as a function of time $t$ according to the constraint $d\mathbf{x}(t)/dt=\mathcal{M}\mathbf{x}(t)+\mathbf{b}$. We show that our algorithm exhibits an exponential speedup over its classical counterpart in certain circumstances, and a gate-based quantum circuit is produced which is friendly to the experimentalists and implementable in current quantum techniques. In addition, we experimentally solve a $4\ifmmode\times\else\texttimes\fi{}4$ linear differential equation using our quantum algorithm in a four-qubit nuclear magnetic resonance quantum information processor. Our algorithm provides a key technique for solving many important problems which rely on the solutions to linear differential equations.

arXiv:1807.04553•Physical Review A•Mar 6, 2020•91 citations

Algorithms for Quantum Computers

Jamie Smith, Michele Mosca

arXiv:1001.0767•Springer eBooks•Jan 1, 2012•27 citations
The Poisson equation occurs in many areas of science and engineering. Here we focus on its numerical solution for an equation in d dimensions. In particular we present a quantum algorithm and a scalable quantum circuit design which approximates the solution of the Poisson equation on a grid with error ε . We assume we are given a superposition of function evaluations of the right-hand side of the Poisson equation. The algorithm produces a quantum state encoding the solution. The number of quantum operations and the number of qubits used by the circuit is almost linear in d and polylog in ε −1 . We present quantum circuit modules together with performance guarantees which can also be used for other problems.
Abstract Solving linear differential equations is a common problem in almost all fields of science and engineering. Here, we present a variational algorithm with shallow circuits for solving such a problem: given an N×NN \times NN×N N × N matrix $${\varvec{A}}$$ A , an N-dimensional vector $$\varvec{b}$$ b , and an initial vector $$\varvec{x}(0)$$ x ( 0 ) , how to obtain the solution vector $$\varvec{x}(T)$$ x ( T ) at time T according to the constraint $$\textrm{d}\varvec{x}(t)/\textrm{d} t = {\varvec{A}}\varvec{x}(t) + \varvec{b}$$ d x ( t ) / d t = A x ( t ) + b . The core idea of the algorithm is to encode the equations into a ground state problem of the Hamiltonian, which is solved via hybrid quantum-classical methods with high fidelities. Compared with the previous works, our algorithm requires the least qubit resources and can restore the entire evolutionary process. In particular, we show its application in simulating the evolution of harmonic oscillators and dynamics of non-Hermitian systems with PT\mathcal{P}\mathcal{T}PT P T -symmetry. Our algorithm framework provides a key technique for solving so many important problems whose essence is the solution of linear differential equations.
Solving linear differential equations (LDEs) is a hard problem for classical computers, while quantum algorithms have been proposed to be capable of speeding up the calculation. However, they are yet to be realized in experiment as it cannot be easily converted into an implementable quantum circuit. Here, we present and experimentally realize an implementable gate-based quantum algorithm for efficiently solving the LDE problem: given an $N\ifmmode\times\else\texttimes\fi{}N$ matrix M\mathcal{M}M, an NNN-dimensional vector b\mathbf{b}b, and an initial vector x(0)\mathbf{x}(0)x(0), we obtain a target vector x(t)\mathbf{x}(t)x(t) as a function of time ttt according to the constraint dx(t)/dt=Mx(t)+bd\mathbf{x}(t)/dt=\mathcal{M}\mathbf{x}(t)+\mathbf{b}dx(t)/dt=Mx(t)+b. We show that our algorithm exhibits an exponential speedup over its classical counterpart in certain circumstances, and a gate-based quantum circuit is produced which is friendly to the experimentalists and implementable in current quantum techniques. In addition, we experimentally solve a $4\ifmmode\times\else\texttimes\fi{}4$ linear differential equation using our quantum algorithm in a four-qubit nuclear magnetic resonance quantum information processor. Our algorithm provides a key technique for solving many important problems which rely on the solutions to linear differential equations.