Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2511.09505

Pure-State Quantum Tomography with Minimal Rank-One POVMs

Dan Edidin, Ivan Gonzalez, Itzhak Tamo

quant-phcs.ITmath.COSubmitted Nov 12, 2025• Announced Nov 13, 2025• 1 citation
arXivHTMLPDF

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 \(\binom{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\).

Comments
15 pages

Related papers

Tight informationally complete quantum measurements

A J Scott

We introduce a class of informationally complete positive-operator-valued measures which are, in analogy with a tight frame, ‘as close as possible’ to orthonormal bases for the space of quantum states. These measures are distinguished by an exceptionally simple state-reconstruction formula which allows ‘painless’ quantum state tomography. Complete sets of mutually unbiased bases and symmetric informationally complete positive-operator-valued measures are both members of this class, the latter being the unique minimal rank-one members. Recast as ensembles of pure quantum states, the rank-one members are in fact equivalent to weighted 2-designs in complex projective space. These measures are shown to be optimal for quantum cloning and linear quantum state tomography.

arXiv:quant-ph/0604049•Journal of Physics A Mathematical and General•Oct 10, 2006•307 citations

Pure-state informationally complete and “really” complete measurements

J. Finkelstein

I construct a positive-operator-valued measure (POVM) which has $2d$ rank-1 elements and which is informationally complete for generic pure states in $d$ dimensions, thus confirming a conjecture made by Flammia, Silberfarb, and Caves (e-print quant-ph∕0404137). I show that if a rank-1 POVM is required to be informationally complete for all pure states in $d$ dimensions, it must have at least $3d\ensuremath{-}2$ elements. I also show that, in a POVM which is informationally complete for all pure states in $d$ dimensions, for any vector there must be at least $2d\ensuremath{-}1$ POVM elements which do not annihilate that vector.

arXiv:quant-ph/0407078•Physical Review A•Nov 12, 2004•80 citations

Optimal Low-Rank Quantum State Tomography with Bounded-Sample Joint Measurements

Ashwin Nayak, Xingyu Zhou

We determine the optimal sample complexity of low-rank quantum state tomography when each measurement may act jointly on at most $t$ samples. For sufficiently small $\varepsilon$, estimating an unknown state on $\mathbb{C}^d$ of rank at most $r$ to trace norm error $\varepsilon$ with constant success probability requires, and is achievable with, $$Θ\left(\frac{dr}{\varepsilon^2}\mathop{\mathrm{max}}\left\{1,\frac{r}{\sqrt{t}}\right\}\right)$$ samples. The lower bound allows the protocol to choose each joint measurement adaptively using all previous classical outcomes; the matching upper bound is nonadaptive. Thus joint measurements on at most $t$ samples improve the complexity of algorithms making single-sample measurements by at most a factor $\sqrt{t}$. Further, measuring order $r^2$ samples jointly is necessary and sufficient to attain the unrestricted collective rate. For the lower bound, we vary the support of a state with fixed uniform spectrum and bound the Fisher information trace of every joint measurement on $t$ samples. The adaptive Fisher chain rule and the van Trees inequality then give the trace norm lower bound. For the upper bound, we construct and analyze a nonadaptive tomography protocol based on a Gaussian joint measurement. An explicit second moment identity and a conditional Gaussian law outside the state's support give a rank-dependent error analysis, yielding the matching rate.

quant-pharXiv:2609.10514•Sep 10, 2026•6 citations

Stable pure state quantum tomography from five orthonormal bases

Claudio Carmeli, Teiko Heinosaari, Michael Kech +2 more

For any finite-dimensional Hilbert space, we construct explicitly five orthonormal bases such that the corresponding measurements allow for efficient tomography of an arbitrary pure quantum state. This means that such measurements can be used to distinguish an arbitrary pure state from any other state, pure or mixed, and the pure state can be reconstructed from the outcome distribution in a feasible way. The set of measurements we construct is independent of the unknown state, and therefore our results provide a fixed scheme for pure state tomography, as opposed to the adaptive (state-dependent) scheme proposed by Goyeneche et al. ( Phys. Rev. Lett. , 115 (2015) 090401). We show that our scheme is robust with respect to noise, in the sense that any measurement scheme which approximates these measurements well enough is equally suitable for pure state tomography. Finally, we present two convex programs which can be used to reconstruct the unknown pure state from the measurement outcome distributions.

arXiv:1604.02970•Europhysics Letters (EPL)•Aug 1, 2016•34 citations

Sample-Efficient Quantum State Tomography for Structured Quantum States in One Dimension

Zhen Qin, Casey Jameson, Alireza Goldar +3 more

In this paper, we answer this fundamental question affirmatively by using a class of informationally complete positive operator-valued measures (IC-POVMs), including symmetric IC-POVMs (SIC-POVMs) and spherical $t$-designs, focusing on sample complexity while not accounting for the implementation complexity of the measurement settings. For SIC-POVMs and spherical 2-designs, we show that the number of state copies to guarantee bounded recovery error of an MPO state with a constrained least-squares estimator depends on the probability distribution of the MPO under the POVM but scales only linearly with $n$ when the distribution is approximately uniform. For general spherical $t$-designs with a sufficiently large $t$, we prove that only a number of state copies proportional to the number of independent parameters in the MPO is sufficient for a guaranteed recovery of any state represented by an MPO. In addition, we establish a sample complexity lower bound based on the Cramer-Rao bound, showing that, for strictly positive definite MPO states and unbiased estimators, a number of state copies proportional to the number of independent parameters in the MPO is also necessary, although the upper and lower bounds do not yet match in their dependence on the target accuracy. Furthermore, we propose a spectral method and a projected gradient descent (PGD) algorithm to solve the constrained least-squares problem, both equipped with rigorous recovery error guarantees.

arXiv:2410.02583•Oct 3, 2024•12 citations

Tasks and premises in quantum state determination

Claudio Carmeli, Teiko Heinosaari, Jussi Schultz +1 more

The purpose of quantum tomography is to determine an unknown quantum state from measurement outcome statistics. There are two obvious ways to generalize this setting. First, our task need not be the determination of any possible input state but only some input states, for instance pure states. Second, we may have some prior information, or premise, which guarantees that the input state belongs to some subset of states, for instance the set of states with rank less than half of the dimension of the Hilbert space. We investigate state determination under these two supplemental features, concentrating on the cases where the task and the premise are statements about the rank of the unknown state. We characterize the structure of quantum observables (positive operator valued measures) that are capable of fulfilling these type of determination tasks. After the general treatment we focus on the class of covariant phase space observables, thus providing physically relevant examples of observables both capable and incapable of performing these tasks. In this context, the effect of noise is discussed.

arXiv:1308.5502•Journal of Physics A Mathematical and Theoretical•Feb 3, 2014•22 citations
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 (\binom{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).
We introduce a class of informationally complete positive-operator-valued measures which are, in analogy with a tight frame, ‘as close as possible’ to orthonormal bases for the space of quantum states. These measures are distinguished by an exceptionally simple state-reconstruction formula which allows ‘painless’ quantum state tomography. Complete sets of mutually unbiased bases and symmetric informationally complete positive-operator-valued measures are both members of this class, the latter being the unique minimal rank-one members. Recast as ensembles of pure quantum states, the rank-one members are in fact equivalent to weighted 2-designs in complex projective space. These measures are shown to be optimal for quantum cloning and linear quantum state tomography.
I construct a positive-operator-valued measure (POVM) which has 2d2d2d rank-1 elements and which is informationally complete for generic pure states in ddd dimensions, thus confirming a conjecture made by Flammia, Silberfarb, and Caves (e-print quant-ph∕0404137). I show that if a rank-1 POVM is required to be informationally complete for all pure states in ddd dimensions, it must have at least $3d\ensuremath{-}2$ elements. I also show that, in a POVM which is informationally complete for all pure states in ddd dimensions, for any vector there must be at least $2d\ensuremath{-}1$ POVM elements which do not annihilate that vector.
We determine the optimal sample complexity of low-rank quantum state tomography when each measurement may act jointly on at most ttt samples. For sufficiently small ε\varepsilonε, estimating an unknown state on Cd\mathbb{C}^dCd of rank at most rrr to trace norm error ε\varepsilonε with constant success probability requires, and is achievable with, Θ(drε2max{1,rt})Θ\left(\frac{dr}{\varepsilon^2}\mathop{\mathrm{max}}\left\{1,\frac{r}{\sqrt{t}}\right\}\right)Θ(ε2dr​max{1,t​r​}) samples. The lower bound allows the protocol to choose each joint measurement adaptively using all previous classical outcomes; the matching upper bound is nonadaptive. Thus joint measurements on at most ttt samples improve the complexity of algorithms making single-sample measurements by at most a factor t\sqrt{t}t​. Further, measuring order r2r^2r2 samples jointly is necessary and sufficient to attain the unrestricted collective rate. For the lower bound, we vary the support of a state with fixed uniform spectrum and bound the Fisher information trace of every joint measurement on ttt samples. The adaptive Fisher chain rule and the van Trees inequality then give the trace norm lower bound. For the upper bound, we construct and analyze a nonadaptive tomography protocol based on a Gaussian joint measurement. An explicit second moment identity and a conditional Gaussian law outside the state's support give a rank-dependent error analysis, yielding the matching rate.
For any finite-dimensional Hilbert space, we construct explicitly five orthonormal bases such that the corresponding measurements allow for efficient tomography of an arbitrary pure quantum state. This means that such measurements can be used to distinguish an arbitrary pure state from any other state, pure or mixed, and the pure state can be reconstructed from the outcome distribution in a feasible way. The set of measurements we construct is independent of the unknown state, and therefore our results provide a fixed scheme for pure state tomography, as opposed to the adaptive (state-dependent) scheme proposed by Goyeneche et al. ( Phys. Rev. Lett. , 115 (2015) 090401). We show that our scheme is robust with respect to noise, in the sense that any measurement scheme which approximates these measurements well enough is equally suitable for pure state tomography. Finally, we present two convex programs which can be used to reconstruct the unknown pure state from the measurement outcome distributions.
In this paper, we answer this fundamental question affirmatively by using a class of informationally complete positive operator-valued measures (IC-POVMs), including symmetric IC-POVMs (SIC-POVMs) and spherical ttt-designs, focusing on sample complexity while not accounting for the implementation complexity of the measurement settings. For SIC-POVMs and spherical 2-designs, we show that the number of state copies to guarantee bounded recovery error of an MPO state with a constrained least-squares estimator depends on the probability distribution of the MPO under the POVM but scales only linearly with nnn when the distribution is approximately uniform. For general spherical ttt-designs with a sufficiently large ttt, we prove that only a number of state copies proportional to the number of independent parameters in the MPO is sufficient for a guaranteed recovery of any state represented by an MPO. In addition, we establish a sample complexity lower bound based on the Cramer-Rao bound, showing that, for strictly positive definite MPO states and unbiased estimators, a number of state copies proportional to the number of independent parameters in the MPO is also necessary, although the upper and lower bounds do not yet match in their dependence on the target accuracy. Furthermore, we propose a spectral method and a projected gradient descent (PGD) algorithm to solve the constrained least-squares problem, both equipped with rigorous recovery error guarantees.
The purpose of quantum tomography is to determine an unknown quantum state from measurement outcome statistics. There are two obvious ways to generalize this setting. First, our task need not be the determination of any possible input state but only some input states, for instance pure states. Second, we may have some prior information, or premise, which guarantees that the input state belongs to some subset of states, for instance the set of states with rank less than half of the dimension of the Hilbert space. We investigate state determination under these two supplemental features, concentrating on the cases where the task and the premise are statements about the rank of the unknown state. We characterize the structure of quantum observables (positive operator valued measures) that are capable of fulfilling these type of determination tasks. After the general treatment we focus on the class of covariant phase space observables, thus providing physically relevant examples of observables both capable and incapable of performing these tasks. In this context, the effect of noise is discussed.