Estimation of pure states using three measurement bases
L. Zambrano, L. Pereira, D. Mart\'inez, G. Ca\~nas, G. Lima, A., Delgado

TL;DR
This paper presents a novel method for estimating unknown pure quantum states in high dimensions using only three measurement bases, validated through experiments on photonic and superconducting platforms.
Contribution
The paper introduces a new measurement-based protocol for pure state estimation using only three bases, applicable to high-dimensional quantum systems.
Findings
Successfully estimated 8-dimensional pure states with high accuracy.
Demonstrated the method's effectiveness on a superconducting qubit processor.
Validated the protocol on two different quantum platforms.
Abstract
We introduce a new method to estimate unknown pure -dimensional quantum states using the probability distributions associated with only three measurement bases. Measurement results of projectors are employed to generate a set of possible states, the likelihood of which is evaluated using the measurement results of the remaining projectors. The state with the highest likelihood is the estimate of the unknown state. The method estimates all pure states but a null-measure set. The viability of the protocol is experimentally demonstrated using two different and complementary high-dimensional quantum information platforms. First, by exploring the photonic path-encoding strategy, we validate the method on a single 8-dimensional quantum system. Then, we resort to the five superconducting qubit IBM quantum processor to demonstrate the high performance of the method in the…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Neural Networks and Reservoir Computing · Quantum Computing Algorithms and Architecture
