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:1112.1027 · Physical Review Letters

Measuring Tr ρ n on Single Copies of ρ Using Random Measurements

S. J. van Enk, C. W. J. Beenakker

Published Mar 16, 2012• 178 citations
arXivHTMLPDF

Abstract

While it is known that $\mathrm{Tr}{\ensuremath{\rho}}^{n}$ can be measured directly (i.e., without first reconstructing the density matrix) by performing joint measurements on $n$ copies of the same state $\ensuremath{\rho}$, it is shown here that random measurements on single copies suffice, too. Averaging over the random measurements directly yields estimates of $\mathrm{Tr}{\ensuremath{\rho}}^{n}$, even when it is not known what measurements were actually performed (so that $\ensuremath{\rho}$ cannot be reconstructed).

DOI
10.1103/physrevlett.108.110503

Related papers

Determining a Quantum State by Means of a Single Apparatus

ARMEN E. ALLAHVERDYAN, Roger Balian, Theo M. Nieuwenhuizen

The unknown state rho of a quantum system S is determined by letting it interact with an auxiliary system A, the initial state of which is known. A one-to-one mapping can thus be realized between the density matrix rho and the probabilities of the occurrence of the eigenvalues of a single and factorized observable of S+A, so that rho can be determined by repeated measurements using a single apparatus. If S and A are spins, it suffices to measure simultaneously their z components after a controlled interaction. The most robust setups are determined in this case for an initially pure or a completely disordered state of A. They involve an Ising or anisotropic Heisenberg coupling and an external field.

arXiv:cond-mat/0311488•Physical Review Letters•Mar 25, 2004•94 citations

Measuring polynomial functions of states

Todd A. Brun

In this paper I show that any $m$th-degree polynomial function of the elements of the density matrix $\rho$ can be determined by finding the expectation value of an observable on $m$ copies of $\rho$, without performing state tomography. Since a circuit exists which can approximate the measurement of any observable, in principle one can find a circuit which will estimate any such polynomial function by averaging over many runs. I construct some simple examples and compare these results to existing procedures.

arXiv:quant-ph/0401067•Quantum Information and Computation•Sep 1, 2004•98 citations

Sample-optimal classical shadows for pure states

Daniel Grier, Hakop Pashayan, Luke Schaeffer

We consider the classical shadows task for pure states in the setting of both joint and independent measurements. The task is to measure few copies of an unknown pure state ρ in order to learn a classical description which suffices to later estimate expectation values of observables. Specifically, the goal is to approximate Tr(Oρ) for any Hermitian observable O to within additive error ϵ provided Tr(O2)≤B and ‖O‖=1 . Our main result applies to the joint measurement setting, where we show Θ~(Bϵ−1+ϵ−2) samples of ρ are necessary and sufficient to succeed with high probability. The upper bound is a quadratic improvement on the previous best sample complexity known for this problem. For the lower bound, we see that the bottleneck is not how fast we can learn the state but rather how much any classical description of ρ can be compressed for observable estimation. In the independent measurement setting, we show that O(Bdϵ−1+ϵ−2) samples suffice. Notably, this implies that the random Clifford measurements algorithm of Huang, Kueng, and Preskill, which is sample-optimal for mixed states, is not optimal for pure states. Interestingly, our result also uses the same random Clifford measurements but employs a different estimator.

arXiv:2211.11810•Quantum•Jun 17, 2024•33 citations

Some problems on the measurement of quantum observables and determination of joint entropy in quantum statistics

V. D. Vainshtein, Stanislav D. Tvorogov

Communications in Mathematical Physics•Aug 1, 1975•5 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

Distributed Quantum inner product estimation

Anurag Anshu, Zeph A. Landau, Yunchao Liu

As small quantum computers are becoming available on different physical platforms, a benchmarking task known as cross-platform verification has been proposed that aims to estimate the fidelity of states prepared on two quantum computers. This task is fundamentally distributed, as no quantum communication can be performed between the two physical platforms due to hardware constraints, which prohibits a joint SWAP test. In this paper we settle the sample complexity of this task across all measurement and communication settings. The essence of the task, which we call distributed quantum inner product estimation, involves two players Alice and Bob who have k copies of unknown states ρ,σ (acting on ℂd) respectively. Their goal is to estimate Tr(ρσ) up to additive error ε∈(0,1), using local quantum operations and classical communication. In the weakest setting where only non-adaptive single-copy measurements and simultaneous message passing are allowed, we show that k=O(max{1/ε2,√d/ε}) copies suffice. This achieves a savings compared to full tomography which takes Ω(d3) copies with single-copy measurements. Surprisingly, we also show that the sample complexity must be at least Ω(max{1/ε2,√d/ε}), even in the strongest setting where adaptive multi-copy measurements and arbitrary rounds of communication are allowed. This shows that the success achieved by shadow tomography, for sample-efficiently learning the properties of a single system, cannot be generalized to the distributed setting. Furthermore, the fact that the sample complexity remains the same with single and multi-copy measurements contrasts with single system quantum property testing, which often demonstrate exponential separations in sample complexity with single and multi-copy measurements.

arXiv:2111.03273•ACM Symposium on Theory of Computing (STOC)•Jun 9, 2022•50 citations
While it is known that Tr\ensuremathρn\mathrm{Tr}{\ensuremath{\rho}}^{n}Tr\ensuremathρn can be measured directly (i.e., without first reconstructing the density matrix) by performing joint measurements on nnn copies of the same state \ensuremathρ\ensuremath{\rho}\ensuremathρ, it is shown here that random measurements on single copies suffice, too. Averaging over the random measurements directly yields estimates of Tr\ensuremathρn\mathrm{Tr}{\ensuremath{\rho}}^{n}Tr\ensuremathρn, even when it is not known what measurements were actually performed (so that \ensuremathρ\ensuremath{\rho}\ensuremathρ cannot be reconstructed).
The unknown state rho of a quantum system S is determined by letting it interact with an auxiliary system A, the initial state of which is known. A one-to-one mapping can thus be realized between the density matrix rho and the probabilities of the occurrence of the eigenvalues of a single and factorized observable of S+A, so that rho can be determined by repeated measurements using a single apparatus. If S and A are spins, it suffices to measure simultaneously their z components after a controlled interaction. The most robust setups are determined in this case for an initially pure or a completely disordered state of A. They involve an Ising or anisotropic Heisenberg coupling and an external field.
In this paper I show that any mmmth-degree polynomial function of the elements of the density matrix ρ\rhoρ can be determined by finding the expectation value of an observable on mmm copies of ρ\rhoρ, without performing state tomography. Since a circuit exists which can approximate the measurement of any observable, in principle one can find a circuit which will estimate any such polynomial function by averaging over many runs. I construct some simple examples and compare these results to existing procedures.
We consider the classical shadows task for pure states in the setting of both joint and independent measurements. The task is to measure few copies of an unknown pure state ρ in order to learn a classical description which suffices to later estimate expectation values of observables. Specifically, the goal is to approximate Tr(Oρ) for any Hermitian observable O to within additive error ϵ provided Tr(O2)≤B and ‖O‖=1 . Our main result applies to the joint measurement setting, where we show Θ~(Bϵ−1+ϵ−2) samples of ρ are necessary and sufficient to succeed with high probability. The upper bound is a quadratic improvement on the previous best sample complexity known for this problem. For the lower bound, we see that the bottleneck is not how fast we can learn the state but rather how much any classical description of ρ can be compressed for observable estimation. In the independent measurement setting, we show that O(Bdϵ−1+ϵ−2) samples suffice. Notably, this implies that the random Clifford measurements algorithm of Huang, Kueng, and Preskill, which is sample-optimal for mixed states, is not optimal for pure states. Interestingly, our result also uses the same random Clifford measurements but employs a different estimator.
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.
As small quantum computers are becoming available on different physical platforms, a benchmarking task known as cross-platform verification has been proposed that aims to estimate the fidelity of states prepared on two quantum computers. This task is fundamentally distributed, as no quantum communication can be performed between the two physical platforms due to hardware constraints, which prohibits a joint SWAP test. In this paper we settle the sample complexity of this task across all measurement and communication settings. The essence of the task, which we call distributed quantum inner product estimation, involves two players Alice and Bob who have k copies of unknown states ρ,σ (acting on ℂd) respectively. Their goal is to estimate Tr(ρσ) up to additive error ε∈(0,1), using local quantum operations and classical communication. In the weakest setting where only non-adaptive single-copy measurements and simultaneous message passing are allowed, we show that k=O(max{1/ε2,√d/ε}) copies suffice. This achieves a savings compared to full tomography which takes Ω(d3) copies with single-copy measurements. Surprisingly, we also show that the sample complexity must be at least Ω(max{1/ε2,√d/ε}), even in the strongest setting where adaptive multi-copy measurements and arbitrary rounds of communication are allowed. This shows that the success achieved by shadow tomography, for sample-efficiently learning the properties of a single system, cannot be generalized to the distributed setting. Furthermore, the fact that the sample complexity remains the same with single and multi-copy measurements contrasts with single system quantum property testing, which often demonstrate exponential separations in sample complexity with single and multi-copy measurements.