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:2604.03725

Quantum Algebraic Diversity: Single-Copy Density Matrix Estimation via Group-Structured Measurements

Mitchell A. Thornton

quant-phcs.ITeess.SPSubmitted Apr 4, 2026• Announced Apr 7, 2026• 3 citations• Revised Apr 13, 2026 (v2)
v1 · Apr 4, 2026v2 · Apr 13, 2026v3 · Jun 17, 2026
arXivHTMLPDF

Abstract

We extend the algebraic diversity (AD) framework from classical signal processing to quantum measurement theory. The central result -- the Quantum Algebraic Diversity (QAD) Theorem -- establishes that a group-structured positive operator-valued measure (POVM) applied to a single copy of a quantum state produces a group-averaged density matrix estimator that recovers the spectral structure of the true density matrix, analogous to the classical result that a group-averaged outer product recovers covariance eigenstructure from a single observation. We establish a formal Classical-Quantum Duality Map connecting classical covariance estimation to quantum state tomography, and prove an Optimality Inheritance Theorem showing that classical group optimality transfers to quantum settings via the Born map. SIC-POVMs are identified as algebraic diversity with the Heisenberg-Weyl group, and mutually unbiased bases (MUBs) as algebraic diversity with the Clifford group, revealing the hierarchy $\mathrm{HW}(d) \subseteq \mathcal{C}(d) \subseteq S_d$ that mirrors the classical hierarchy $\mathbb{Z}_M \subseteq G_{\min} \subseteq S_M$. The double-commutator eigenvalue theorem provides polynomial-time adaptive POVM selection. A worked qubit example demonstrates that the group-averaged estimator from a single Pauli measurement recovers a full-rank approximation to a mixed qubit state, achieving fidelity 0.91 where standard single-basis tomography produces a rank-1 estimate with fidelity 0.71. Monte Carlo simulations on qudits of dimension $d = 2$ through $d = 13$ (200 random states per dimension) confirm that the Heisenberg-Weyl QAD estimator maintains fidelity above 0.90 across all dimensions from a single measurement outcome, while standard tomography fidelity degrades as $\sim 1/d$, with the improvement ratio scaling linearly with $d$ as predicted by the $O(d)$ copy reduction theorem.

Related papers

Experimental Single-Setting Quantum State Tomography

Roman Stricker, M. Meth, Lukas Postler +7 more

Quantum computers solve ever more complex tasks using steadily growing system sizes.Characterizing these quantum systems is vital, yet becoming increasingly challenging.The gold-standard method for this task is quantum state tomography (QST), capable of fully reconstructing a quantum state without prior knowledge.The measurement and classical computing costs, however, increase exponentially with the number of constituents (e.g., qubits)-a daunting bottleneck given the scale of existing and nearterm quantum devices.Here, we demonstrate a scalable and practical QST approach that only uses a single measurement setting, namely symmetric informationally complete (SIC) positive operator-valued measures (POVMs).We implement these nonorthogonal measurements on an ion trap quantum processor by utilizing additional energy levels within each ion-without requiring ancillary ions to assist in measurements.More precisely, we locally map the SIC POVM to orthogonal states embedded in a higher-dimensional system, which we read out using repeated in-sequence detections, thereby providing full tomographic information in every shot.Combining this SIC tomography with the recently developed randomized measurement toolbox ("classical shadows") proves to be a powerful combination.SIC tomography alleviates the need for choosing measurement settings at random ("derandomization"), while classical shadows enable the estimation of arbitrary polynomial functions of the density matrix orders of magnitudes faster than standard methods.The latter enables in-depth entanglement characterization, which we experimentally showcase on a five-qubit absolutely maximally entangled state.Moreover, the fact that the full tomography information is available in every shot enables online QST in real time (i.e., while the experiment is running).We demonstrate this on an eight-qubit entangled state (which has 2 8 • 2 8 -1 = 65 535 degrees of freedom), as well as for fast state identification.All in all, these features single out SIC-based classical shadow estimation as a highly scalable and convenient tool for quantum state characterization.

arXiv:2206.00019•PRX Quantum•Oct 21, 2022•88 citations

Tomography by Design: An Algebraic Approach to Low-Rank Quantum States

Shakir Showkat Sofi, Charlotte Vermeylen, Lieven De Lathauwer

We present an algebraic algorithm for quantum state tomography that leverages measurements of certain observables to estimate structured entries of the underlying density matrix. Under low-rank assumptions, the remaining entries can be obtained solely using standard numerical linear algebra operations. The proposed algebraic matrix completion framework applies to a broad class of generic, low-rank mixed quantum states and, compared with state-of-the-art methods, is computationally efficient while providing deterministic recovery guarantees.

quant-pharXiv:2602.15202•Feb 18, 2026•1 citation

Optimal quantum state tomography with local informationally complete measurements

Casey Jameson, Zhen Qin, Alireza Goldar +3 more

Quantum state tomography (QST) remains the gold standard for benchmarking and verification of near-term quantum devices. While QST for a generic quantum many-body state requires an exponentially large amount of resources, most physical quantum states are structured and can often be represented by a much smaller number of parameters, making efficient QST potentially possible. A prominent example is a matrix product state (MPS) or a matrix product density operator (MPDO), which is believed to represent most physical states generated by one-dimensional (1D) quantum devices. We study whether a general MPS/MPDO state can be recovered with bounded errors using only a number of state copies polynomial in the number of qubits, which is necessary for efficient QST. To make this question practically interesting, we assume only local measurements of qubits directly on the target state. By using a local symmetric informationally complete positive operator-valued measurement (SIC-POVM), we provide a positive answer to the above question for a variety of common many-body quantum states, including typical short-range entangled states, random MPS/MPDO states, and thermal states of one-dimensional Hamiltonians. In addition, we also provide an affirmative no answer for certain long-range entangled states such as a family of generalized GHZ states, but with the exception of target states that are known to have real-valued wavefunctions. Our answers are supported by a near-perfect agreement between an efficient calculation of the Cramer-Rao bound that rigorously bounds the sample complexity and numerical optimization results using a machine learning assisted maximal likelihood estimation (MLE) algorithm. This agreement also leads to an optimal QST protocol using local SIC-POVM that can be practically implemented on current quantum hardware and is highly efficient for most 1D physical states.

arXiv:2408.07115•Aug 13, 2024•14 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

Minimax Quantum State Tomography with Periodic Clifford Measurements

Hongru Zhao

Quantum state tomography provides a foundation for characterizing state preparation and predicting measurement outcomes. We characterize the minimax expected trace norm risk of quantum state tomography over classes with polynomial spectral decay under randomized nonadaptive single copy measurements. Under an explicit sufficient block size condition for the two layer periodic Clifford ensemble, we establish statewise expected trace norm oracle inequalities for operator norm minimum distance and measurement weighted projected least squares, with bounds that depend on each state's actual spectral tail, while the estimators require no prior knowledge of the state's structural characteristics, including its rank, eigenbasis, or spectral structure. Over these polynomial spectral decay classes, both estimators attain the minimax expected trace norm rates up to constants. As a direct consequence, the same estimators attain the minimax rate over every fixed rank constrained class, while remaining adaptive to the unknown structural characteristics of the state. For admissible logarithmic block sizes, the periodic Clifford measurements attain these guarantees with logarithmic elementary gate depth. The main technical ingredient is a uniform bound on the fourth moment of projectors for the periodic Clifford ensemble. The bound is sharp in dimension and holds for arbitrary test states, including those entangled across blocks. Covariance concentration and positivity yield adaptive oracle bounds, while a shared rotation information argument on spectral tail packings establishes matching lower bounds. We also provide polynomial time reconstruction algorithms, numerical comparisons, and Lean formalizations of all labeled theoretical results.

quant-pharXiv:2610.00210•Sep 22, 2026•0 citations

Direct reconstruction of the quantum density matrix elements with classical shadow tomography

Yu Wang

We introduce a direct estimation framework for reconstructing multiple density matrix elements of an unknown quantum state using classical shadow tomography. Traditional direct measurement protocols (DMPs), while effective for individual elements, suffer from poor scalability due to post-selection losses and the need for element-specific measurement configurations. In contrast, our method, DMP-ST, leverages random Clifford or biased mutually unbiased basis measurements to enable global estimation: a single dataset suffices to estimate arbitrary off-diagonal entries with high accuracy. We prove that estimating \(K\) off-diagonal matrix elements up to additive error \(ε\) requires only \(\mathcal{O}(\log K/ε^2)\) samples, achieving exponential improvement over conventional DMPs. The number of required measurement configurations can also be exponentially reduced for large K. When extended to full state tomography, DMP-ST attains trace distance error \(\le ε\) with sample complexity \(\mathcal{O}(d^3 \log d/ε^2)\), which is closed to the optimal scaling for single-copy measurements. Moreover, biased MUB measurements reduce sample complexity by a constant factor than random Clifford measurements. This work provides both theoretical guarantees and explicit protocols for efficient, entrywise quantum state reconstruction. It significantly advances the practicality of direct tomography, especially for high-dimensional systems and near-term quantum platforms.

arXiv:2505.15243•May 21, 2025•2 citations
We extend the algebraic diversity (AD) framework from classical signal processing to quantum measurement theory. The central result -- the Quantum Algebraic Diversity (QAD) Theorem -- establishes that a group-structured positive operator-valued measure (POVM) applied to a single copy of a quantum state produces a group-averaged density matrix estimator that recovers the spectral structure of the true density matrix, analogous to the classical result that a group-averaged outer product recovers covariance eigenstructure from a single observation. We establish a formal Classical-Quantum Duality Map connecting classical covariance estimation to quantum state tomography, and prove an Optimality Inheritance Theorem showing that classical group optimality transfers to quantum settings via the Born map. SIC-POVMs are identified as algebraic diversity with the Heisenberg-Weyl group, and mutually unbiased bases (MUBs) as algebraic diversity with the Clifford group, revealing the hierarchy HW(d)⊆C(d)⊆Sd\mathrm{HW}(d) \subseteq \mathcal{C}(d) \subseteq S_dHW(d)⊆C(d)⊆Sd​ that mirrors the classical hierarchy ZM⊆Gmin⁡⊆SM\mathbb{Z}_M \subseteq G_{\min} \subseteq S_MZM​⊆Gmin​⊆SM​. The double-commutator eigenvalue theorem provides polynomial-time adaptive POVM selection. A worked qubit example demonstrates that the group-averaged estimator from a single Pauli measurement recovers a full-rank approximation to a mixed qubit state, achieving fidelity 0.91 where standard single-basis tomography produces a rank-1 estimate with fidelity 0.71. Monte Carlo simulations on qudits of dimension d=2d = 2d=2 through d=13d = 13d=13 (200 random states per dimension) confirm that the Heisenberg-Weyl QAD estimator maintains fidelity above 0.90 across all dimensions from a single measurement outcome, while standard tomography fidelity degrades as ∼1/d\sim 1/d∼1/d, with the improvement ratio scaling linearly with ddd as predicted by the O(d)O(d)O(d) copy reduction theorem.
Quantum computers solve ever more complex tasks using steadily growing system sizes.Characterizing these quantum systems is vital, yet becoming increasingly challenging.The gold-standard method for this task is quantum state tomography (QST), capable of fully reconstructing a quantum state without prior knowledge.The measurement and classical computing costs, however, increase exponentially with the number of constituents (e.g., qubits)-a daunting bottleneck given the scale of existing and nearterm quantum devices.Here, we demonstrate a scalable and practical QST approach that only uses a single measurement setting, namely symmetric informationally complete (SIC) positive operator-valued measures (POVMs).We implement these nonorthogonal measurements on an ion trap quantum processor by utilizing additional energy levels within each ion-without requiring ancillary ions to assist in measurements.More precisely, we locally map the SIC POVM to orthogonal states embedded in a higher-dimensional system, which we read out using repeated in-sequence detections, thereby providing full tomographic information in every shot.Combining this SIC tomography with the recently developed randomized measurement toolbox ("classical shadows") proves to be a powerful combination.SIC tomography alleviates the need for choosing measurement settings at random ("derandomization"), while classical shadows enable the estimation of arbitrary polynomial functions of the density matrix orders of magnitudes faster than standard methods.The latter enables in-depth entanglement characterization, which we experimentally showcase on a five-qubit absolutely maximally entangled state.Moreover, the fact that the full tomography information is available in every shot enables online QST in real time (i.e., while the experiment is running).We demonstrate this on an eight-qubit entangled state (which has 2 8 • 2 8 -1 = 65 535 degrees of freedom), as well as for fast state identification.All in all, these features single out SIC-based classical shadow estimation as a highly scalable and convenient tool for quantum state characterization.
We present an algebraic algorithm for quantum state tomography that leverages measurements of certain observables to estimate structured entries of the underlying density matrix. Under low-rank assumptions, the remaining entries can be obtained solely using standard numerical linear algebra operations. The proposed algebraic matrix completion framework applies to a broad class of generic, low-rank mixed quantum states and, compared with state-of-the-art methods, is computationally efficient while providing deterministic recovery guarantees.
Quantum state tomography (QST) remains the gold standard for benchmarking and verification of near-term quantum devices. While QST for a generic quantum many-body state requires an exponentially large amount of resources, most physical quantum states are structured and can often be represented by a much smaller number of parameters, making efficient QST potentially possible. A prominent example is a matrix product state (MPS) or a matrix product density operator (MPDO), which is believed to represent most physical states generated by one-dimensional (1D) quantum devices. We study whether a general MPS/MPDO state can be recovered with bounded errors using only a number of state copies polynomial in the number of qubits, which is necessary for efficient QST. To make this question practically interesting, we assume only local measurements of qubits directly on the target state. By using a local symmetric informationally complete positive operator-valued measurement (SIC-POVM), we provide a positive answer to the above question for a variety of common many-body quantum states, including typical short-range entangled states, random MPS/MPDO states, and thermal states of one-dimensional Hamiltonians. In addition, we also provide an affirmative no answer for certain long-range entangled states such as a family of generalized GHZ states, but with the exception of target states that are known to have real-valued wavefunctions. Our answers are supported by a near-perfect agreement between an efficient calculation of the Cramer-Rao bound that rigorously bounds the sample complexity and numerical optimization results using a machine learning assisted maximal likelihood estimation (MLE) algorithm. This agreement also leads to an optimal QST protocol using local SIC-POVM that can be practically implemented on current quantum hardware and is highly efficient for most 1D physical states.
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.
Quantum state tomography provides a foundation for characterizing state preparation and predicting measurement outcomes. We characterize the minimax expected trace norm risk of quantum state tomography over classes with polynomial spectral decay under randomized nonadaptive single copy measurements. Under an explicit sufficient block size condition for the two layer periodic Clifford ensemble, we establish statewise expected trace norm oracle inequalities for operator norm minimum distance and measurement weighted projected least squares, with bounds that depend on each state's actual spectral tail, while the estimators require no prior knowledge of the state's structural characteristics, including its rank, eigenbasis, or spectral structure. Over these polynomial spectral decay classes, both estimators attain the minimax expected trace norm rates up to constants. As a direct consequence, the same estimators attain the minimax rate over every fixed rank constrained class, while remaining adaptive to the unknown structural characteristics of the state. For admissible logarithmic block sizes, the periodic Clifford measurements attain these guarantees with logarithmic elementary gate depth. The main technical ingredient is a uniform bound on the fourth moment of projectors for the periodic Clifford ensemble. The bound is sharp in dimension and holds for arbitrary test states, including those entangled across blocks. Covariance concentration and positivity yield adaptive oracle bounds, while a shared rotation information argument on spectral tail packings establishes matching lower bounds. We also provide polynomial time reconstruction algorithms, numerical comparisons, and Lean formalizations of all labeled theoretical results.
We introduce a direct estimation framework for reconstructing multiple density matrix elements of an unknown quantum state using classical shadow tomography. Traditional direct measurement protocols (DMPs), while effective for individual elements, suffer from poor scalability due to post-selection losses and the need for element-specific measurement configurations. In contrast, our method, DMP-ST, leverages random Clifford or biased mutually unbiased basis measurements to enable global estimation: a single dataset suffices to estimate arbitrary off-diagonal entries with high accuracy. We prove that estimating KKK off-diagonal matrix elements up to additive error εεε requires only O(log⁡K/ε2)\mathcal{O}(\log K/ε^2)O(logK/ε2) samples, achieving exponential improvement over conventional DMPs. The number of required measurement configurations can also be exponentially reduced for large K. When extended to full state tomography, DMP-ST attains trace distance error ≤ε\le ε≤ε with sample complexity O(d3log⁡d/ε2)\mathcal{O}(d^3 \log d/ε^2)O(d3logd/ε2), which is closed to the optimal scaling for single-copy measurements. Moreover, biased MUB measurements reduce sample complexity by a constant factor than random Clifford measurements. This work provides both theoretical guarantees and explicit protocols for efficient, entrywise quantum state reconstruction. It significantly advances the practicality of direct tomography, especially for high-dimensional systems and near-term quantum platforms.