Pure state `really' informationally complete with rank-1 POVM
Yu Wang, Yun Shang

TL;DR
This paper investigates the minimal number of rank-1 POVM elements needed to uniquely determine pure states in a d-dimensional quantum system, providing bounds and constructions for various dimensions.
Contribution
It establishes new bounds on the minimal number of rank-1 POVMs for pure state determination and constructs adaptive measurement schemes across dimensions.
Findings
Lower bound of 3d-2 elements is not tight for most dimensions.
Minimal number for d=3 is exactly 8 elements.
Constructs adaptive measurement schemes with d+2k-2 elements.
Abstract
What is the minimal number of elements in a rank-1 positive-operator-valued measure (POVM) which can uniquely determine any pure state in -dimensional Hilbert space ? The known result is that the number is no less than . We show that this lower bound is not tight except for or 4. Then we give an upper bound of . For , many rank-1 POVMs with four elements can determine any pure states in . For , we show eight is the minimal number by construction. For , the minimal number is in the set of . We show that if this number is greater than 10, an unsettled open problem can be solved that three orthonormal bases can not distinguish all pure states in . For any dimension , we construct adaptive rank-1 positive operators for the reconstruction of any unknown pure state in ,…
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 · Numerical methods in inverse problems · Sparse and Compressive Sensing Techniques
