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

Toward Instance-Optimal State Certification With Incoherent Measurements

Sitan Chen, Jerry Zheng Li, Ryan O’Donnell

Published Feb 25, 2021• 8 citations
arXivHTMLPDF

Abstract

We revisit the basic problem of quantum state certification: given copies of unknown mixed state $ρ\in\mathbb{C}^{d\times d}$ and the description of a mixed state $σ$, decide whether $σ= ρ$ or $\|σ- ρ\|_{\mathsf{tr}} \ge ε$. When $σ$ is maximally mixed, this is mixedness testing, and it is known that $Ω(d^{Θ(1)}/ε^2)$ copies are necessary, where the exact exponent depends on the type of measurements the learner can make [OW15, BCL20], and in many of these settings there is a matching upper bound [OW15, BOW19, BCL20]. Can one avoid this $d^{Θ(1)}$ dependence for certain kinds of mixed states $σ$, e.g. ones which are approximately low rank? More ambitiously, does there exist a simple functional $f:\mathbb{C}^{d\times d}\to\mathbb{R}_{\ge 0}$ for which one can show that $Θ(f(σ)/ε^2)$ copies are necessary and sufficient for state certification with respect to any $σ$? Such instance-optimal bounds are known in the context of classical distribution testing, e.g. [VV17]. Here we give the first bounds of this nature for the quantum setting, showing (up to log factors) that the copy complexity for state certification using nonadaptive incoherent measurements is essentially given by the copy complexity for mixedness testing times the fidelity between $σ$ and the maximally mixed state. Surprisingly, our bound differs substantially from instance optimal bounds for the classical problem, demonstrating a qualitative difference between the two settings.

DOI
10.48550/arxiv.2102.13098

Related papers

Tight Bounds for Quantum State Certification with Incoherent Measurements

Sitan Chen, Jerry Zheng Li, Brice Huang +1 more

We consider the problem of quantum state certification, where we are given the description of a mixed state $\sigma\in\mathbb{C}^{d\times d},n$ copies of a mixed state $\rho\in\mathbb{C}^{d\times d}$, and $\varepsilon\gt 0$, and we are asked to determine whether $\rho=\sigma$ or whether $\|\rho-\sigma\|_{1}\gt \varepsilon$. When $\sigma$ is the maximally mixed state $\frac{1}{d}I_{d}$, this is known as mixedness testing. We focus on algorithms which use incoherent measurements, i.e. which only measure one copy of $\rho$ at a time. Unlike those that use entangled, multi-copy measurements, these can be implemented without persistent quantum memory and thus represent a large class of protocols that can be run on current or near-term devices. For mixedness testing, there is a folklore algorithm which uses incoherent measurements and only needs $O(d^{3/2}/\varepsilon^{2})$ copies. The algorithm is non-adaptive, that is, its measurements are fixed ahead of time, and is known to be optimal for non-adaptive algorithms. However, when the algorithm can make arbitrary incoherent measurements, the best known lower bound is only $\Omega(d^{4/3}/\varepsilon^{2})$ [5], and it has been an outstanding open problem to close this polynomial gap. In this work: •We settle the copy complexity of mixedness testing with incoherent measurements and show that $\Omega(d^{3/2}/\varepsilon^{2})$ copies are necessary. This fully resolves open questions of [15] and [5].•We show that the instance-optimal bounds for state certification to general $\sigma$ first derived in [7] for non-adaptive measurements also hold for arbitrary incoherent measurements. Qualitatively, our results say that adaptivity does not help at all for these problems. Our results are based on new techniques that allow us to reduce the problem to understanding the concentration of certain matrix martingales, which we believe may be of independent interest.

arXiv:2204.07155•Annual Symposium on Foundations of Computer Science•Oct 1, 2022•21 citations

Optimal Quantum State Testing Even with Limited Entanglement

Chirag Wadhwa, Sitan Chen

In this work, we consider the fundamental task of quantum state certification: given copies of an unknown quantum state $ρ$, test whether it matches some target state $σ$ or is $ε$-far from it. For certifying $d$-dimensional states, $Θ(d/ε^2)$ copies of $ρ$ are known to be necessary and sufficient. However, the algorithm achieving this complexity makes fully entangled measurements over all $O(d/ε^2)$ copies of $ρ$. Often, one is interested in certifying states to a high precision; this makes such joint measurements intractable even for low-dimensional states. Thus, we study whether one can obtain optimal rates for quantum state certification and related testing problems while only performing measurements on $t$ copies at once, for some $1 < t \ll d/ε^2$. While it is well-understood how to use intermediate entanglement to achieve optimal quantum state learning, the only protocol known to achieve optimal testing is the one using fully entangled measurements. Our main result is a smooth copy complexity upper bound for state certification as a function of $t$, which achieves a near-optimal rate at $t = d^2$. In the high-precision regime, i.e., for $ε< \frac{1}{\sqrt{d}}$, this is a strict improvement over the entanglement used by the aforementioned optimal protocol. We also extend our techniques to develop new algorithms for the related tasks of mixedness testing and purity estimation, and show tradeoffs achieving the optimal rates for these problems at $t = d^2$ as well. Our algorithms are based on novel reductions from testing to learning and leverage recent advances in quantum state tomography in a non-black-box fashion. We complement our testing upper bounds with a (nearly) matching lower bound that holds in the high-precision regime, implying that one must take $t \geq Ω(d^2)$ to achieve the optimal rate for certification.

quant-pharXiv:2604.07460•Apr 10, 2026•0 citations

Instance-Optimal Quantum State Certification with Entangled Measurements

Ryan O’Donnell, Chirag Wadhwa

We consider the task of quantum state certification: given a description of a hypothesis state σ and multiple copies of an unknown state ρ, a tester aims to determine whether the two states are equal or є-far in trace distance. It is known that Θ(d/є2) copies of ρ are necessary and sufficient for this task, assuming the tester can make entangled measurements over all copies. However, these bounds are for a worst-case σ, and it is not known what the optimal copy complexity is for this problem on an instance-by-instance basis. While such instance-optimal bounds have previously been shown for quantum state certification when the tester is limited to measurements unentangled across copies, they remained open when testers are unrestricted in the kind of measurements they can perform.

arXiv:2507.06010•ACM Symposium on Theory of Computing (STOC)•Jun 9, 2026•0 citations

Near-Optimal Mixedness Testing with Pauli Measurements

Jayadev Acharya, Abhilash Dharmavarapu, Yuhan Liu +1 more

We consider a fundamental problem of \emph{mixedness testing}: Given $n$ copies of an $N$-qubit state $ρ$, determine whether $ρ= \mathbb{I}_d/d$ or $\|ρ-\mathbb{I}_d/d\|_1 \geq \varepsilon$ with high probability, where $d = 2^N$. In particular, we focus on performing this task in the practical setting of single-qubit measurements, where measurements are prepared independently on each qubit. We provide a nearly complete picture of single-qubit mixedness tesing by showing $n = \tildeΘ\left(\sqrt{10}^N/\varepsilon^2\right)$. To establish our lower bound, we introduce a measurement-dependent lower bound framework for adaptive single-copy state certification. For the upper bound, we present a randomized Pauli basis measurement protocol, which relies on a new primitive for computationally efficient uniformity testing of correlation-concentrated distributions on the Boolean hypercube. In conjunction, we provide lower and upper bounds for mixedness testing with fixed Pauli measurement protocols.

quant-pharXiv:2608.18839•Aug 20, 2026•0 citations

On the Power of Adaptivity in Testing Quantum States in Fidelity

Jan Seyfried, Sayantan Sen, Marco Tomamichel

We study the problems of quantum state certification, equivalence testing and independence testing. In certification, given samples of an unknown quantum state $ρ$ and the description of a state $σ$, the goal is to test whether $ρ=σ$, or whether $ρ$ and $σ$ are far in a given distance measure. In equivalence testing, $σ$ is also unknown and only accessible via samples. Independence testing decides whether $ρ_{AC}=ρ_A\otimesρ_C$, or is far from being a product. The sample complexities of these problems are now well-understood for a decision gap $\varepsilon$ in trace distance: in the single-copy measurement setting with $d$-dimensional states, all three tasks can be solved using the same non-adaptive approach, which uses $Θ(d^{3/2}/\varepsilon^2)$ samples and is optimal in general, even without adaptivity. In this work, we consider decision gaps expressed in fidelity and study possible separations between these problems and how adaptivity can help. We prove that certification with respect to fidelity for a state $σ$ of rank $r$ does not benefit from adaptivity and requires $\widetildeΘ(r^{3/2}/\varepsilon)$ samples. For equivalence testing and independence testing, we provide adaptive algorithms using $\widetilde{O}(\min\{d^{3/2}/\varepsilon^2,d^{9/4}/\varepsilon\})$ and $\widetilde{O}(\min\{(d_Ad_C)^{3/2}/\varepsilon^2,d_A^{9/4}d_C^{3/4}/\varepsilon\})$ samples, for $d_A\geq d_C$, respectively. Our main technique is a framework that uses partial learning and a reduction to testing in $\ell_2$-distance, adapted from the distribution testing literature. We show that adaptivity matters for equivalence testing in fidelity by proving that $\widetildeΩ(1/\varepsilon^2)$ samples are necessary in the non-adaptive case even for qubits, showing a separation from certification.

quant-pharXiv:2609.08733•Sep 9, 2026•0 citations

Quantum state certification

Costin Bădescu, Ryan O’Donnell, John Wright

We consider the problem of quantum state certification, where one is given n copies of an unknown d-dimensional quantum mixed state ρ, and one wants to test whether ρ is equal to some known mixed state σ or else is є-far from σ. The goal is to use notably fewer copies than the Ω(d2) needed for full tomography on ρ (i.e., density estimation). We give two robust state certification algorithms: one with respect to fidelity using n = O(d/є) copies, and one with respect to trace distance using n = O(d/є2) copies. The latter algorithm also applies when σ is unknown as well. These copy complexities are optimal up to constant factors.

arXiv:1708.06002•ACM Symposium on Theory of Computing (STOC)•Jun 20, 2019•66 citations
We revisit the basic problem of quantum state certification: given copies of unknown mixed state ρ∈Cd×dρ\in\mathbb{C}^{d\times d}ρ∈Cd×d and the description of a mixed state σσσ, decide whether σ=ρσ= ρσ=ρ or ∥σ−ρ∥tr≥ε\|σ- ρ\|_{\mathsf{tr}} \ge ε∥σ−ρ∥tr​≥ε. When σσσ is maximally mixed, this is mixedness testing, and it is known that Ω(dΘ(1)/ε2)Ω(d^{Θ(1)}/ε^2)Ω(dΘ(1)/ε2) copies are necessary, where the exact exponent depends on the type of measurements the learner can make [OW15, BCL20], and in many of these settings there is a matching upper bound [OW15, BOW19, BCL20]. Can one avoid this dΘ(1)d^{Θ(1)}dΘ(1) dependence for certain kinds of mixed states σσσ, e.g. ones which are approximately low rank? More ambitiously, does there exist a simple functional f:Cd×d→R≥0f:\mathbb{C}^{d\times d}\to\mathbb{R}_{\ge 0}f:Cd×d→R≥0​ for which one can show that Θ(f(σ)/ε2)Θ(f(σ)/ε^2)Θ(f(σ)/ε2) copies are necessary and sufficient for state certification with respect to any σσσ? Such instance-optimal bounds are known in the context of classical distribution testing, e.g. [VV17]. Here we give the first bounds of this nature for the quantum setting, showing (up to log factors) that the copy complexity for state certification using nonadaptive incoherent measurements is essentially given by the copy complexity for mixedness testing times the fidelity between σσσ and the maximally mixed state. Surprisingly, our bound differs substantially from instance optimal bounds for the classical problem, demonstrating a qualitative difference between the two settings.
We consider the problem of quantum state certification, where we are given the description of a mixed state σ∈Cd×d,n\sigma\in\mathbb{C}^{d\times d},nσ∈Cd×d,n copies of a mixed state ρ∈Cd×d\rho\in\mathbb{C}^{d\times d}ρ∈Cd×d, and ε>0\varepsilon\gt 0ε>0, and we are asked to determine whether ρ=σ\rho=\sigmaρ=σ or whether ∥ρ−σ∥1>ε\|\rho-\sigma\|_{1}\gt \varepsilon∥ρ−σ∥1​>ε. When σ\sigmaσ is the maximally mixed state 1dId\frac{1}{d}I_{d}d1​Id​, this is known as mixedness testing. We focus on algorithms which use incoherent measurements, i.e. which only measure one copy of ρ\rhoρ at a time. Unlike those that use entangled, multi-copy measurements, these can be implemented without persistent quantum memory and thus represent a large class of protocols that can be run on current or near-term devices. For mixedness testing, there is a folklore algorithm which uses incoherent measurements and only needs O(d3/2/ε2)O(d^{3/2}/\varepsilon^{2})O(d3/2/ε2) copies. The algorithm is non-adaptive, that is, its measurements are fixed ahead of time, and is known to be optimal for non-adaptive algorithms. However, when the algorithm can make arbitrary incoherent measurements, the best known lower bound is only Ω(d4/3/ε2)\Omega(d^{4/3}/\varepsilon^{2})Ω(d4/3/ε2) [5], and it has been an outstanding open problem to close this polynomial gap. In this work: •We settle the copy complexity of mixedness testing with incoherent measurements and show that Ω(d3/2/ε2)\Omega(d^{3/2}/\varepsilon^{2})Ω(d3/2/ε2) copies are necessary. This fully resolves open questions of [15] and [5].•We show that the instance-optimal bounds for state certification to general σ\sigmaσ first derived in [7] for non-adaptive measurements also hold for arbitrary incoherent measurements. Qualitatively, our results say that adaptivity does not help at all for these problems. Our results are based on new techniques that allow us to reduce the problem to understanding the concentration of certain matrix martingales, which we believe may be of independent interest.
In this work, we consider the fundamental task of quantum state certification: given copies of an unknown quantum state ρρρ, test whether it matches some target state σσσ or is εεε-far from it. For certifying ddd-dimensional states, Θ(d/ε2)Θ(d/ε^2)Θ(d/ε2) copies of ρρρ are known to be necessary and sufficient. However, the algorithm achieving this complexity makes fully entangled measurements over all O(d/ε2)O(d/ε^2)O(d/ε2) copies of ρρρ. Often, one is interested in certifying states to a high precision; this makes such joint measurements intractable even for low-dimensional states. Thus, we study whether one can obtain optimal rates for quantum state certification and related testing problems while only performing measurements on ttt copies at once, for some 1<t≪d/ε21 < t \ll d/ε^21<t≪d/ε2. While it is well-understood how to use intermediate entanglement to achieve optimal quantum state learning, the only protocol known to achieve optimal testing is the one using fully entangled measurements. Our main result is a smooth copy complexity upper bound for state certification as a function of ttt, which achieves a near-optimal rate at t=d2t = d^2t=d2. In the high-precision regime, i.e., for ε<1dε< \frac{1}{\sqrt{d}}ε<d​1​, this is a strict improvement over the entanglement used by the aforementioned optimal protocol. We also extend our techniques to develop new algorithms for the related tasks of mixedness testing and purity estimation, and show tradeoffs achieving the optimal rates for these problems at t=d2t = d^2t=d2 as well. Our algorithms are based on novel reductions from testing to learning and leverage recent advances in quantum state tomography in a non-black-box fashion. We complement our testing upper bounds with a (nearly) matching lower bound that holds in the high-precision regime, implying that one must take t≥Ω(d2)t \geq Ω(d^2)t≥Ω(d2) to achieve the optimal rate for certification.
We consider the task of quantum state certification: given a description of a hypothesis state σ and multiple copies of an unknown state ρ, a tester aims to determine whether the two states are equal or є-far in trace distance. It is known that Θ(d/є2) copies of ρ are necessary and sufficient for this task, assuming the tester can make entangled measurements over all copies. However, these bounds are for a worst-case σ, and it is not known what the optimal copy complexity is for this problem on an instance-by-instance basis. While such instance-optimal bounds have previously been shown for quantum state certification when the tester is limited to measurements unentangled across copies, they remained open when testers are unrestricted in the kind of measurements they can perform.
We consider a fundamental problem of \emph{mixedness testing}: Given nnn copies of an NNN-qubit state ρρρ, determine whether ρ=Id/dρ= \mathbb{I}_d/dρ=Id​/d or ∥ρ−Id/d∥1≥ε\|ρ-\mathbb{I}_d/d\|_1 \geq \varepsilon∥ρ−Id​/d∥1​≥ε with high probability, where d=2Nd = 2^Nd=2N. In particular, we focus on performing this task in the practical setting of single-qubit measurements, where measurements are prepared independently on each qubit. We provide a nearly complete picture of single-qubit mixedness tesing by showing n=Θ~(10N/ε2)n = \tildeΘ\left(\sqrt{10}^N/\varepsilon^2\right)n=Θ~(10​N/ε2). To establish our lower bound, we introduce a measurement-dependent lower bound framework for adaptive single-copy state certification. For the upper bound, we present a randomized Pauli basis measurement protocol, which relies on a new primitive for computationally efficient uniformity testing of correlation-concentrated distributions on the Boolean hypercube. In conjunction, we provide lower and upper bounds for mixedness testing with fixed Pauli measurement protocols.
We study the problems of quantum state certification, equivalence testing and independence testing. In certification, given samples of an unknown quantum state ρρρ and the description of a state σσσ, the goal is to test whether ρ=σρ=σρ=σ, or whether ρρρ and σσσ are far in a given distance measure. In equivalence testing, σσσ is also unknown and only accessible via samples. Independence testing decides whether ρAC=ρA⊗ρCρ_{AC}=ρ_A\otimesρ_CρAC​=ρA​⊗ρC​, or is far from being a product. The sample complexities of these problems are now well-understood for a decision gap ε\varepsilonε in trace distance: in the single-copy measurement setting with ddd-dimensional states, all three tasks can be solved using the same non-adaptive approach, which uses Θ(d3/2/ε2)Θ(d^{3/2}/\varepsilon^2)Θ(d3/2/ε2) samples and is optimal in general, even without adaptivity. In this work, we consider decision gaps expressed in fidelity and study possible separations between these problems and how adaptivity can help. We prove that certification with respect to fidelity for a state σσσ of rank rrr does not benefit from adaptivity and requires Θ~(r3/2/ε)\widetildeΘ(r^{3/2}/\varepsilon)Θ(r3/2/ε) samples. For equivalence testing and independence testing, we provide adaptive algorithms using O~(min⁡{d3/2/ε2,d9/4/ε})\widetilde{O}(\min\{d^{3/2}/\varepsilon^2,d^{9/4}/\varepsilon\})O(min{d3/2/ε2,d9/4/ε}) and O~(min⁡{(dAdC)3/2/ε2,dA9/4dC3/4/ε})\widetilde{O}(\min\{(d_Ad_C)^{3/2}/\varepsilon^2,d_A^{9/4}d_C^{3/4}/\varepsilon\})O(min{(dA​dC​)3/2/ε2,dA9/4​dC3/4​/ε}) samples, for dA≥dCd_A\geq d_CdA​≥dC​, respectively. Our main technique is a framework that uses partial learning and a reduction to testing in ℓ2\ell_2ℓ2​-distance, adapted from the distribution testing literature. We show that adaptivity matters for equivalence testing in fidelity by proving that Ω~(1/ε2)\widetildeΩ(1/\varepsilon^2)Ω(1/ε2) samples are necessary in the non-adaptive case even for qubits, showing a separation from certification.
We consider the problem of quantum state certification, where one is given n copies of an unknown d-dimensional quantum mixed state ρ, and one wants to test whether ρ is equal to some known mixed state σ or else is є-far from σ. The goal is to use notably fewer copies than the Ω(d2) needed for full tomography on ρ (i.e., density estimation). We give two robust state certification algorithms: one with respect to fidelity using n = O(d/є) copies, and one with respect to trace distance using n = O(d/є2) copies. The latter algorithm also applies when σ is unknown as well. These copy complexities are optimal up to constant factors.