Pure-State Quantum Tomography with Minimal Rank-One POVMs

2025-11-12

AI Summary

This work addresses the construction of minimal informationally complete rank-one POVMs for pure-state quantum tomography—i.e., uniquely determining any pure state up to a global phase using the fewest possible measurements. We introduce the notion of “critical POVMs” and establish tight upper bounds on the minimal number of measurement elements: $inom{n+1}{2}$ for real Hilbert spaces and $n^2$ for complex ones. Crucially, we uncover, for the first time, a deep connection between such optimal POVMs and combinatorial block designs—particularly symmetric balanced incomplete block designs (BIBDs). Leveraging tools from pure-state informational completeness analysis, POVM theory, algebraic geometry, and combinatorial design, we provide explicit constructions for multiple parameter regimes. Our results resolve a long-standing open problem concerning the achievability of these tight bounds and furnish both a theoretical foundation and a practical measurement framework for efficient pure-state tomography.

Technology Category

• Constraint Satisfaction and Optimization: Other Foundations of Constraint Satisfaction
• Search and Optimization: Combinatorial Optimization
• Reasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Security and Privacy: Large-scale security measurements
• Web Mining and Content Analysis: Web measurements

Abstract

Quantum state tomography seeks to reconstruct an unknown state from measurement statistics. A finite measurement (POVM) is emph{pure-state informationally complete} (PSI-Complete) if the outcome probabilities determine any pure state up to a global phase. We study emph{rank-one} POVMs that are minimally sufficient for this task. We call such a POVM emph{vital} if it is PSI-Complete but every proper subcollection is not PSI-Complete. We prove sharp upper bounds on the size of vital rank-one POVMs in dimension (n): the size is at most (inom{n+1}{2}) over (mathbb{R}) and at most (n^{2}) over (mathbb{C}), and we give constructions that attain these bounds. In the real case, we further exhibit a connection to block designs: whenever (w mid n(n-1)), an ((n,w,w-1)) design produces a vital rank-one POVM with (n + n(n-1)/w) outcomes. We provide explicit constructions for (w=2,n-1), and (n).

Problem

• Determining minimal rank-one POVMs for pure-state quantum tomography
• Establishing upper bounds for vital POVM size in different dimensions
• Constructing optimal POVMs using combinatorial design connections

Innovation

• Minimal rank-one POVMs for pure-state tomography
• Upper bounds on vital POVM size in dimensions
• Connections to block designs for explicit constructions