Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > quant-ph > arXiv:2407.01583v2

Help | Advanced Search

Quantum Physics

arXiv:2407.01583v2 (quant-ph)
[Submitted on 17 Jun 2024 (v1) , last revised 16 Feb 2025 (this version, v2)]

Title: Optimal Low-Depth Quantum Signal-Processing Phase Estimation

Title: 最优低深度量子信号处理相位估计

Authors:Yulong Dong, Jonathan A. Gross, Murphy Yuezhen Niu
Abstract: Quantum effects like entanglement and coherent amplification can be used to drastically enhance the accuracy of quantum parameter estimation beyond classical limits. However, challenges such as decoherence and time-dependent errors hinder Heisenberg-limited amplification. We introduce Quantum Signal-Processing Phase Estimation algorithms that are robust against these challenges and achieve optimal performance as dictated by the Cram\'{e}r-Rao bound. These algorithms use quantum signal transformation to decouple interdependent phase parameters into largely orthogonal ones, ensuring that time-dependent errors in one do not compromise the accuracy of learning the other. Combining provably optimal classical estimation with near-optimal quantum circuit design, our approach achieves a standard deviation accuracy of $10^{-4}$ radians for estimating unwanted swap angles in superconducting two-qubit experiments, using low-depth ($<10$) circuits. This represents up to two orders of magnitude improvement over existing methods. Theoretically and numerically, we demonstrate the optimality of our algorithm against time-dependent phase errors, observing that the variance of the time-sensitive parameter $\varphi$ scales faster than the asymptotic Heisenberg scaling in the small-depth regime. Our results are rigorously validated against the quantum Fisher information, confirming our protocol's ability to achieve unmatched precision for two-qubit gate learning.
Abstract: 量子效应如纠缠和相干放大可以用来显著提高量子参数估计的准确性,超越经典极限。 然而,诸如退相干和时变误差等挑战阻碍了海森堡极限的放大。 我们引入了量子信号处理相位估计算法,这些算法对这些挑战具有鲁棒性,并且按照Cramér-Rao界限实现了最佳性能。 这些算法使用量子信号变换将相互依赖的相位参数解耦为大致正交的参数,确保一个中的时变误差不会影响另一个的准确性。 结合可证明最优的经典估计和近最优的量子电路设计,我们的方法在超导双量子比特实验中估计不需要的交换角度时,实现了$10^{-4}$弧度的标准差精度,使用低深度($<10$)电路。 这比现有方法提高了多达两个数量级。 从理论上和数值上,我们证明了算法在时变相位误差下的最优性,观察到时间敏感参数$\varphi$的方差在浅深度范围内比渐近海森堡尺度增长得更快。 我们的结果经过量子费舍尔信息的严格验证,证实了我们协议在双量子比特门学习中实现无与伦比精度的能力。
Comments: 58 pages, 22 figures. arXiv admin note: substantial text overlap with arXiv:2209.11207
Subjects: Quantum Physics (quant-ph) ; Machine Learning (cs.LG); Numerical Analysis (math.NA); Data Analysis, Statistics and Probability (physics.data-an)
Cite as: arXiv:2407.01583 [quant-ph]
  (or arXiv:2407.01583v2 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2407.01583
arXiv-issued DOI via DataCite
Journal reference: Nature Communications 16, no. 1 (2025): 1504
Related DOI: https://doi.org/10.1038/s41467-025-56724-x
DOI(s) linking to related resources

Submission history

From: Yulong Dong [view email]
[v1] Mon, 17 Jun 2024 10:33:52 UTC (1,752 KB)
[v2] Sun, 16 Feb 2025 21:34:02 UTC (1,707 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2024-07
Change to browse by:
cs
cs.LG
cs.NA
math
math.NA
physics
physics.data-an

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号