Fisher information based lower bounds on the cost of quantum phase estimation
arXiv QuantumArchived Mar 16, 2026✓ Full text saved
arXiv:2603.12706v1 Announce Type: new Abstract: Quantum phase estimation (QPE) is a cornerstone of quantum algorithms designed to estimate the eigenvalues of a unitary operator. QPE is typically implemented through two paradigms with distinct circuit structures: quantum Fourier transform-based QPE (QFT-QPE) and Hadamard test-based QPE (HT-QPE). Existing performance assessments fail to separate the statistical information inherent in the quantum circuit from the efficiency of classical post-proce
Full text archived locally
✦ AI Summary· Claude Sonnet
Quantum Physics
[Submitted on 13 Mar 2026]
Fisher information based lower bounds on the cost of quantum phase estimation
Ryosuke Kimura, Kosuke Mitarai
Quantum phase estimation (QPE) is a cornerstone of quantum algorithms designed to estimate the eigenvalues of a unitary operator. QPE is typically implemented through two paradigms with distinct circuit structures: quantum Fourier transform-based QPE (QFT-QPE) and Hadamard test-based QPE (HT-QPE). Existing performance assessments fail to separate the statistical information inherent in the quantum circuit from the efficiency of classical post-processing, thereby obscuring the limits intrinsic to the circuit structure itself. In this study, we employ Fisher information and the Cramer-Rao lower bound to formulate the performance limits of circuit designs independent of the efficiency of classical post-processing. Defining the circuit depth as T and the total runtime as t_{\rm total}, our results demonstrate that the achievable scaling is constrained by a non-trivial lower bound on their product T\,t_{\rm total}, although previous studies have typically treated the circuit depth T and the total runtime t_{\rm total} as separate resources. Notably, QFT-QPE possesses a more favorable scaling with respect to the overlap between the input state and the target eigenstate corresponding to the desired eigenvalue than HT-QPE. Numerical simulations confirm these theoretical findings, demonstrating a clear performance crossover between the two paradigms depending on the overlap. Furthermore, we verify that practical algorithms, specifically the quantum multiple eigenvalue Gaussian filtered search (QMEGS) and curve-fitted QPE, achieve performance levels closely approaching our derived limits. By elucidating the performance limits inherent in quantum circuit structures, this work concludes that the optimal choice of circuit configuration depends significantly on the overlap.
Comments: 18 pages, 12 figures
Subjects: Quantum Physics (quant-ph)
Cite as: arXiv:2603.12706 [quant-ph]
(or arXiv:2603.12706v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2603.12706
Focus to learn more
Submission history
From: Kimura Ryosuke [view email]
[v1] Fri, 13 Mar 2026 06:40:12 UTC (688 KB)
Access Paper:
HTML (experimental)
view license
Current browse context:
quant-ph
< prev | next >
new | recent | 2026-03
References & Citations
INSPIRE HEP
NASA ADS
Google Scholar
Semantic Scholar
Export BibTeX Citation
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Demos
Related Papers
About arXivLabs
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)