Efficient Bayesian Phase Estimation
Nathan Wiebe, Christopher E Granade

TL;DR
This paper introduces a new adaptive Bayesian phase estimation algorithm that directly infers phase and uncertainty, offering improved flexibility, robustness, and speed over existing methods, even under experimental imperfections.
Contribution
The paper presents a novel adaptive Bayesian algorithm for phase estimation that bypasses bit-by-bit inference, enhancing efficiency and robustness in noisy quantum experiments.
Findings
Algorithm is highly flexible and recovers from failures.
Performs well under substantial decoherence and imperfections.
Comparable or faster than existing phase estimation methods.
Abstract
We provide a new efficient adaptive algorithm for performing phase estimation that does not require that the user infer the bits of the eigenphase in reverse order; rather it directly infers the phase and estimates the uncertainty in the phase directly from experimental data. Our method is highly flexible, recovers from failures, and can be run in the presence of substantial decoherence and other experimental imperfections and is as fast or faster than existing algorithms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFault Detection and Control Systems · Blind Source Separation Techniques · Target Tracking and Data Fusion in Sensor Networks
