Generic and scalable differential-equation solver for quantum scientific computing

One of the most important topics in quantum scientific computing is solving differential equations. In this paper, a generalized quantum functional expansion (QFE) framework is proposed. In the QFE framework, a functional expansion of the solution is encoded into a quantum state and the time evolution of the quantum state is solved with variational quantum simulation (VQS). The quantum functional encoding supports different numerical schemes of functional expansions. If the solution space is infinite-order differentiable, the lower bound of the required number of qubits under the quantum function encoding scheme is the double logarithm of the inverse error bound. Furthermore, a parallel Pauli operation strategy is proposed to significantly improve the scalability of VQS. The number of circuits in VQS is exponentially reduced to only the quadratic order of the number of ansatz parameters. Four example differential equations are solved to demonstrate the generic QFE framework.

Authors

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2025-01-27
DOI
https://doi.org/10.1103/physreva.111.012625
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generic and scalable differential-equation solver for quantum scientific computing

Yan Wang, Jinhwan Sul
1 citations
Physical review. A/Physical review, A
Quantum Computing Algorithms and Architecture
2.48
article

Generic and scalable differential-equation solver for quantum scientific computing

Yan Wang, Jinhwan Sul
article en
1 citations

Abstract

One of the most important topics in quantum scientific computing is solving differential equations. In this paper, a generalized quantum functional expansion (QFE) framework is proposed. In the QFE framework, a functional expansion of the solution is encoded into a quantum state and the time evolution of the quantum state is solved with variational quantum simulation (VQS). The quantum functional encoding supports different numerical schemes of functional expansions. If the solution space is infinite-order differentiable, the lower bound of the required number of qubits under the quantum function encoding scheme is the double logarithm of the inverse error bound. Furthermore, a parallel Pauli operation strategy is proposed to significantly improve the scalability of VQS. The number of circuits in VQS is exponentially reduced to only the quadratic order of the number of ansatz parameters. Four example differential equations are solved to demonstrate the generic QFE framework.

Physical review. A/Physical review, AVol. 111(1)
Georgia Institute of Technology (US)
Openalex Percentile: Top 12%
Quantum Computing Algorithms and Architecture
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Generic and scalable differential-equation solver for quantum scientific computing — Yan Wang, Jinhwan Sul · Physical review. A/Physical review, A (2025) | TGRS Research Map | TGRS