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:2303.01293 · Lecture notes in computer science

Simple Tests of Quantumness Also Certify Qubits

Zvika Brakerski, Alexandru Gheorghiu, Gregory D. Kahanamoku–Meyer, Eitan Porat, Thomas Vidick

Published Jan 1, 2023• 13 citations
arXivHTMLPDF
DOI
10.1007/978-3-031-38554-4_6

Related papers

Certifying the Dimension of Classical and Quantum Systems in a Prepare-and-Measure Scenario with Independent Devices

Joseph Bowles, Marco Túlio Quintino, Nicolas Brunner

We consider the problem of testing the dimension of uncharacterized classical and quantum systems in a prepare-and-measure setup. Here we assume the preparation and measurement devices to be independent, thereby making the problem nonconvex. We present a simple method for generating nonlinear dimension witnesses for systems of arbitrary dimension. The simplest of our witnesses is highly robust to technical imperfections, and can certify the use of qubits in the presence of arbitrary noise and arbitrarily low detection efficiency. Finally, we show that this witness can be used to certify the presence of randomness, suggesting applications in quantum information processing.

arXiv:1311.1525•Physical Review Letters•Apr 11, 2014•130 citations

The Power of Two Bases: Robust and copy-optimal certification of nearly all quantum states with few-qubit measurements

Andrea Coladangelo, Jerry Li, Joseph Slote +1 more

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(\log n)$-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/\log n)$. Our tests are based on a new uncertainty principle for conditional fidelities, which may be of independent interest.

quant-pharXiv:2602.11616•ACM Symposium on Theory of Computing (STOC)•Feb 13, 2026•7 citations

Certifying almost all quantum states with few single-qubit measurements

Hsin-Yuan Huang, John P. Preskill, Mehdi Soleimanifar

arXiv:2404.07281•Nature Physics•Sep 8, 2025•46 citations

Qubits and Quantum States

Kolla Bhanu Prakash

Wiley eBooks•Aug 17, 2026•0 citations

A quantum linearity test for robustly verifying entanglement

Anand Natarajan, Thomas Vidick

We introduce a simple two-player test which certifies that the players apply tensor products of Pauli σX and σZ observables on the tensor product of n EPR pairs. The test has constant robustness: any strategy achieving success probability within an additive of the optimal must be poly(ε)-close, in the appropriate distance measure, to the honest n-qubit strategy. The test involves 2n-bit questions and 2-bit answers. The key technical ingredient is a quantum version of the classical linearity test of Blum, Luby, and Rubinfeld.

arXiv:1610.03574•ACM Symposium on Theory of Computing (STOC)•Jun 15, 2017•94 citations

Qubits and Quantum Computers

WORLD SCIENTIFIC eBooks•Jul 9, 2024•0 citations
We consider the problem of testing the dimension of uncharacterized classical and quantum systems in a prepare-and-measure setup. Here we assume the preparation and measurement devices to be independent, thereby making the problem nonconvex. We present a simple method for generating nonlinear dimension witnesses for systems of arbitrary dimension. The simplest of our witnesses is highly robust to technical imperfections, and can certify the use of qubits in the presence of arbitrary noise and arbitrarily low detection efficiency. Finally, we show that this witness can be used to certify the presence of randomness, suggesting applications in quantum information processing.
A central task in quantum information science is state certification: testing whether an unknown state is ε1ε_1ε1​-close to a fixed target state, or ε2ε_2ε2​-far. Recent work has shown that surprisingly simple measurement protocols--comprising only single-qubit measurements--suffice to certify arbitrary nnn-qubit states [Huang, Preskill, Soleimanifar '25; Gupta, He, O'Donnell '25]. However, these certification protocols are not robust: rather than allowing constant ε1ε_1ε1​, they can only positively certify states within ε1=O(1/n)ε_1=O(1/n)ε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)O(2^{-n})O(2−n)-fraction of pure target states. Our first protocol achieves constant robustness, i.e. ε1=Θ(1)ε_1=Θ(1)ε1​=Θ(1), using a single O(log⁡n)O(\log n)O(logn)-qubit measurement along with single-qubit measurements in the ZZZ or XXX basis on the other qubits. As a corollary of its robustness, this protocol also achieves constant (in nnn) copy complexity, which is optimal. Our second protocol uses exclusively single-qubit measurements and is nearly robust: ε1=Ω(1/log⁡n)ε_1=Ω(1/\log n)ε1​=Ω(1/logn). Our tests are based on a new uncertainty principle for conditional fidelities, which may be of independent interest.
We introduce a simple two-player test which certifies that the players apply tensor products of Pauli σX and σZ observables on the tensor product of n EPR pairs. The test has constant robustness: any strategy achieving success probability within an additive of the optimal must be poly(ε)-close, in the appropriate distance measure, to the honest n-qubit strategy. The test involves 2n-bit questions and 2-bit answers. The key technical ingredient is a quantum version of the classical linearity test of Blum, Luby, and Rubinfeld.