A fundamental task in quantum information science is state certification: testing whether a lab-prepared n-qubit state is close to a given hypothesis state. In this work, we show that every pure hypothesis state can be certified using only O(n^2) single-qubit measurements applied to O(n) copies of the lab state. Prior to our work, it was not known whether even subexponentially many single-qubit measurements could suffice to certify arbitrary states. This resolves the main open question of Huang, Preskill, and Soleimanifar (FOCS 2024, QIP 2024).
A fundamental task in quantum information science is state certification: testing whether a lab-prepared n-qubit state is close to a given hypothesis state. In this work, we show that every pure hypothesis state can be certified using only O(n^2) single-qubit measurements applied to O(n) copies of the lab state. Prior to our work, it was not known whether even subexponentially many single-qubit measurements could suffice to certify arbitrary states. This resolves the main open question of Huang, Preskill, and Soleimanifar (FOCS 2024, QIP 2024).
A central task in quantum information science is state certification: testing whether an unknown state is ε1-close to a fixed target state, or ε2-far. Recent work has shown that surprisingly simple measurement protocols--comprising only single-qubit measurements--suffice to certify arbitrary n-qubit states [Huang, Preskill, Soleimanifar '25; Gupta, He, O'Donnell '25]. However, these certification protocols are not robust: rather than allowing constant ε1, they can only positively certify states within ε1=O(1/n) trace distance of the target. In many experimental settings, the appropriate error tolerance is constant as the system size grows, so this lack of robustness renders existing tests inapplicable at scale, no matter how many times the test is repeated.
Here we present robust certification protocols based on few-qubit measurements that apply to all but a O(2−n)-fraction of pure target states. Our first protocol achieves constant robustness, i.e. ε1=Θ(1), using a single O(logn)-qubit measurement along with single-qubit measurements in the Z or X basis on the other qubits. As a corollary of its robustness, this protocol also achieves constant (in n) copy complexity, which is optimal. Our second protocol uses exclusively single-qubit measurements and is nearly robust: ε1=Ω(1/logn). Our tests are based on a new uncertainty principle for conditional fidelities, which 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 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≪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=d2. In the high-precision regime, i.e., for ε<d1, 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=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) to achieve the optimal rate for certification.
A fundamental challenge in quantum information science is certifying that an n-qubit stateρprepared in the lab closely matches a target state∣ψ⟩. Previous approaches to this problem often require deep quantum circuits, exponentially many single-qubit measurements, or are limited to specific state families. In this work, we introduce a new method that leverages a connection between state certification and the mixing time of a random walk, allowing almost all n-qubit target states, including those with exponential circuit complexity, to be certified with onlyO(n2)single-qubit measurements. Our protocol is broadly compatible with various experimental platforms and has applications in benchmarking quantum systems, optimizing quantum circuits, and efficiently learning and verifying representations of quantum states—such as neural networks and tensor networks—using only single-qubit measurements. Moreover, these verified representations enable the efficient prediction of highly non-local properties ofρthat would otherwise require an exponential number of measurements.
We show that nonadaptive single-qubit Pauli measurements suffice to test whether an unknown n-qubit state ρ is ε-close to or O(ε)-far from an ideal target state ∣ψ⟩, for all but a 2−Ω(n) fraction of target states. The test uses O(ε−2log(1/δ)) copies of ρ to achieve confidence 1−δ, which is information-theoretically optimal even among protocols with arbitrary joint measurements.
The main technical innovation is an uncertainty principle for weighted generalizations of the total influence of Boolean functions. As a simple example, the unweighted variant states that Inf[f]+Inf[f]=Ω(n), which is a natural hypercube analogue of the Heisenberg uncertainty principle (here ⋅ denotes the 2−n/2-normalized Fourier transform). The weighted case generalizes Inf[⋅] and Inf[⋅] to Dirichlet energies associated with Glauber dynamics for certain dual measures on the cube.
We introduce a basis-independent algorithm that only uses single-copy measurements to certify the Schmidt number
of 2n-qubit bipartite pure states. Assuming the local system dimension is d=2n, the Schmidt number χ is O(1), and the non-zero Schmidt coefficients are bounded below by Ω(1), our protocol achieves a total sample complexity of O(d2χ2)
with only O(χ4) measurement settings. This work establishes a measurement-setting-efficient approach to high-dimensional entanglement
certification.
Abstract One of the main challenges of quantum information is the reliable verification of quantum entanglement. The conventional detection schemes require repeated measurement on a large number of identically prepared systems. This is hard to achieve in practice when dealing with large-scale entangled quantum systems. In this letter we formulate verification as a decision procedure, i.e., entanglement is seen as the ability of quantum system to answer certain “yes-no questions”. We show that for a variety of large quantum states even a single copy suffices to detect entanglement with a high probability by using local measurements. For example, a single copy of a 16-qubit k-producible state or one copy of 24-qubit linear cluster state suffices to verify entanglement with more than 95% confidence. Our method is applicable to many important classes of states, such as cluster states or ground states of local Hamiltonians in general.