Journal Article10.1007/s43673-023-00115-1
A quantum algorithm for linear differential equations with layerwise parameterized quantum circuits
Junxiang Xiao,Jingwei Wen,Zengrong Zhou,Ling Qian,Zhiguo Huang,Shijie Wei,Guilu Long +6 more
1
TL;DR: Researchers propose a quantum algorithm for solving linear differential equations using shallow parameterized quantum circuits, requiring fewer qubits than previous methods, and demonstrate its application in simulating harmonic oscillators and non-Hermitian systems with PT-symmetry.
read more
Abstract: 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$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>N</mml:mi> <mml:mo>×</mml:mo> <mml:mi>N</mml:mi> </mml:mrow> </mml:math> matrix $${\varvec{A}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>A</mml:mi> </mml:mrow> </mml:math> , an N -dimensional vector $$\varvec{b}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>b</mml:mi> </mml:mrow> </mml:math> , and an initial vector $$\varvec{x}(0)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mrow> <mml:mi>x</mml:mi> </mml:mrow> <mml:mo>(</mml:mo> <mml:mn>0</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> , how to obtain the solution vector $$\varvec{x}(T)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mrow> <mml:mi>x</mml:mi> </mml:mrow> <mml:mo>(</mml:mo> <mml:mi>T</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> at time T according to the constraint $$\textrm{d}\varvec{x}(t)/\textrm{d} t = {\varvec{A}}\varvec{x}(t) + \varvec{b}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mtext>d</mml:mtext> <mml:mrow> <mml:mi>x</mml:mi> </mml:mrow> <mml:mo>(</mml:mo> <mml:mi>t</mml:mi> <mml:mo>)</mml:mo> <mml:mo>/</mml:mo> <mml:mtext>d</mml:mtext> <mml:mi>t</mml:mi> <mml:mo>=</mml:mo> <mml:mrow> <mml:mi>A</mml:mi> </mml:mrow> <mml:mrow> <mml:mi>x</mml:mi> </mml:mrow> <mml:mo>(</mml:mo> <mml:mi>t</mml:mi> <mml:mo>)</mml:mo> <mml:mo>+</mml:mo> <mml:mrow> <mml:mi>b</mml:mi> </mml:mrow> </mml:mrow> </mml:math> . 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}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>P</mml:mi> <mml:mi>T</mml:mi> </mml:mrow> </mml:math> -symmetry. Our algorithm framework provides a key technique for solving so many important problems whose essence is the solution of linear differential equations.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Non-Hermitian Quantum Rényi Entropy Dynamics in Anyonic-PT Symmetric Systems
TL;DR: Non-Hermitian quantum Rényi entropy dynamics in anyonic-PT symmetric systems exhibit three information dynamics patterns: damped oscillations with an overall decrease, increase, and asymptotically stable damped oscillations.
1
References
Quantum Computation and Quantum Information
Michael A. Nielsen,Isaac L. Chuang +1 more
- 01 Dec 2010
TL;DR: This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
19.6K
Algorithms for quantum computation: discrete logarithms and factoring
Peter W. Shor
- 20 Nov 1994
TL;DR: Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.
9.1K
Entanglement of Formation of an Arbitrary State of Two Qubits
TL;DR: In this article, an explicit formula for the entanglement of formation of a pair of binary quantum objects (qubits) as a function of their density matrix was conjectured.
9K
A limited memory algorithm for bound constrained optimization
TL;DR: An algorithm for solving large nonlinear optimization problems with simple bounds is described, based on the gradient projection method and uses a limited memory BFGS matrix to approximate the Hessian of the objective function.
A variational eigenvalue solver on a photonic quantum processor
Alberto Peruzzo,Jarrod R. McClean,Peter Shadbolt,Man-Hong Yung,Xiao-Qi Zhou,Peter J. Love,Alán Aspuru-Guzik,Jeremy L. O'Brien +7 more
TL;DR: The proposed approach drastically reduces the coherence time requirements and combines this method with a new approach to state preparation based on ansätze and classical optimization, enhancing the potential of quantum resources available today and in the near future.