跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.26582 · v1

End-to-End Quantum Algorithm for Differential Equations: Application to Simulating a Biomolecular System

端到端量子算法求解微分方程:在生物分子系统模拟中的应用

首次提交 2026-11-20 02:43
版本更新 2026-11-20 02:43
雷达观测 2026-11-20 12:52
arXiv ↗PDF ↗

摘要

Quantum algorithms for differential equations have the potential for substantial algorithmic speedups over classical methods. However, they rely on certain assumptions and abstract oracle specifications that leave their practical feasibility and computational advantages for realistic applications unclear. Here we formalize the concept of an end-to-end quantum algorithm for differential equations as one that accepts classical inputs and returns classical outputs, and provide implementations for algorithmic primitives in constructing such algorithms. We present a tailored end-to-end quantum algorithm for the linearized Poisson-Boltzmann (LPB) equation, a partial differential equation (PDE) with variable coefficients widely used in simulating a biomolecular system. We explicitly implement all aspects of the algorithm, from preparing an initial state to generating a quantum solution and estimating properties of the system. In particular, we develop a new discrete representation for variable-coefficient PDEs on a grid that enables efficient implementation of the operator oracle, and build on a recent technique based on optimal wavelet preconditioning to generate a quantum solution with a cost independent of the condition number of the discretized operator. We show the algorithm can be implemented by quantum circuits of size polylogarithmic in both the number of grid points NgN_g and the inverse of the desired accuracy ε\varepsilon, with an overall gate cost polylogarithmic in NgN_g and quasilinear in 1/ε1/\varepsilon. We also show the classical preprocessing to construct the circuits has polylogarithmic cost in NgN_g and 1/ε1/\varepsilon. Our work provides a concrete end-to-end quantum algorithm for a PDE of practical value, demonstrates an exponential improvement in scaling with NgN_g over classical methods, and provides a foundation for assessing its potential quantum advantage in practice.

作者备注:61 pages, 11 figures, 3 tables

AI 论文解读

基于摘要 · 非全文审阅

作者提出并实现了一个针对线性化泊松-玻尔兹曼方程的端到端量子算法,从经典输入到经典输出,展示了在网格点数上相对于经典方法的指数级扩展优势。

正在读取账号与研究记录…

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-20 02:43 · 最新观测版本

End-to-End Quantum Algorithm for Differential Equations: Application to Simulating a Biomolecular System

Quantum algorithms for differential equations have the potential for substantial algorithmic speedups over classical methods. However, they rely on certain assumptions and abstract oracle specifications that leave their practical feasibility and computational advantages for realistic applications unclear. Here we formalize the concept of an end-to-end quantum algorithm for differential equations as one that accepts classical inputs and returns classical outputs, and provide implementations for algorithmic primitives in constructing such algorithms. We present a tailored end-to-end quantum algorithm for the linearized Poisson-Boltzmann (LPB) equation, a partial differential equation (PDE) with variable coefficients widely used in simulating a biomolecular system. We explicitly implement all aspects of the algorithm, from preparing an initial state to generating a quantum solution and estimating properties of the system. In particular, we develop a new discrete representation for variable-coefficient PDEs on a grid that enables efficient implementation of the operator oracle, and build on a recent technique based on optimal wavelet preconditioning to generate a quantum solution with a cost independent of the condition number of the discretized operator. We show the algorithm can be implemented by quantum circuits of size polylogarithmic in both the number of grid points NgN_g and the inverse of the desired accuracy ε\varepsilon, with an overall gate cost polylogarithmic in NgN_g and quasilinear in 1/ε1/\varepsilon. We also show the classical preprocessing to construct the circuits has polylogarithmic cost in NgN_g and 1/ε1/\varepsilon. Our work provides a concrete end-to-end quantum algorithm for a PDE of practical value, demonstrates an exponential improvement in scaling with NgN_g over classical methods, and provides a foundation for assessing its potential quantum advantage in practice.

查看此版本解读 →查看此版本原文 ↗