Learning Integer Winding Evolution Times in Quantum Phase Estimation

Understand this faster with AI
Quantum Physics arXiv:2611.25124 (quant-ph) [Submitted on 18 Nov 2026] Title:Learning Integer Winding Evolution Times in Quantum Phase Estimation Authors:Elijah Pelofske, Stephan Eidenbenz View a PDF of the paper titled Learning Integer Winding Evolution Times in Quantum Phase Estimation, by Elijah Pelofske and 1 other authors View PDF HTML (experimental) Abstract:Learning a Hamiltonian evolution time in Quantum Phase Estimation that produces phase distributions with low Shannon entropy circumvents the fundamental limit of digitization error of phase, independent of the number of phase qubits of accuracy. By introducing an optimization loop to minimize the Shannon entropy of measured eigenvalues produced by a QPE quantum circuit, minimum eigenvalue computation accuracy is greatly improved, which we show numerically on quantum magnet models. This technique works because standard QPE has a natural correspondence between entropy of the phase distribution and the analog accuracy of the minimum eigenvalue phase. This introduces for the first time a type of parameter learning to QPE, which makes near term practicality of QPE for fundamental sciences more feasible by using shorter depth QPE circuits. Subjects: Quantum Physics (quant-ph); Disordered Systems and Neural Networks (cond-mat.dis-nn); Information Theory (cs.IT) Report number: LA-UR-26-30083 Cite as: arXiv:2611.25124 [quant-ph] (or arXiv:2611.25124v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2611.25124 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Elijah Pelofske [view email] [v1] Wed, 18 Nov 2026 20:03:18 UTC (573 KB) Full-text links: Access Paper: View a PDF of the paper titled Learning Integer Winding Evolution Times in Quantum Phase Estimation, by Elijah Pelofske and 1 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-11 Change to browse by: cond-mat cond-mat.dis-nn cs cs.IT math math.IT References & Citations INSPIRE HEP SciXGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: 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 Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs 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?)
Tags
Source Information
Discussion
0 professional contributions
Sign in to join this professional discussion.
Be the first to add a constructive contribution.
