arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2601.05077quant-ph
收藏

预条件多变量量子解提取

Preconditioned Multivariate Quantum Solution Extraction

Fujitsu Research of America, Inc(富士通美国研究所);Department of Computing, Imperial College London(帝国理工学院计算系);Fujitsu Research of Europe Ltd.(富士通欧洲有限公司)

Gumaro Rendon, Stepan Smid

AI总结:

本文提出了一种预条件多变量量子解提取技术,通过减少量子复杂度和去除函数最小值依赖,实现海森堡极限的缩放,用于高效求解偏微分方程。

摘要:

数值求解偏微分方程是许多科学领域中普遍的计算任务。量子计算机可能为求解PDEs提供高次多项式加速,然而许多算法仅仅停留在准备量子态以编码解的幅度。试图通过量子幅度估计直接获取解的显式性质可能会削弱潜在的加速效果。在本工作中,我们提出了一种技术,用于提取一个在量子态幅度中编码的光滑正函数,该技术实现了海森堡极限的缩放。我们通过允许更高维函数、显著减少量子复杂度(相对于编码函数的量子比特数量)以及通过预条件化去除对函数最小值的依赖,改进了先前的方法。我们的技术通过采样给定函数的累积分布,用切比雪夫多项式拟合它,并随后提取整个编码函数的表示。最后,我们通过进行小规模数值模拟来测试我们的方法。

英文摘要:

Numerically solving partial differential equations is a ubiquitous computational task with broad applications in many fields of science. Quantum computers can potentially provide high-degree polynomial speed-ups for solving PDEs, however many algorithms simply end with preparing the quantum state encoding the solution in its amplitudes. Trying to access explicit properties of the solution naively with quantum amplitude estimation can subsequently diminish the potential speed-up. In this work, we present a technique for extracting a smooth positive function encoded in the amplitudes of a quantum state, which achieves the Heisenberg limit scaling. We improve upon previous methods by allowing higher dimensional functions, by significantly reducing the quantum complexity with respect to the number of qubits encoding the function, and by removing the dependency on the minimum of the function using preconditioning. Our technique works by sampling the cumulative distribution of the given function, fitting it with Chebyshev polynomials, and subsequently extracting a representation of the whole encoded function. Finally, we trial our method by carrying out small scale numerical simulations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑