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

• URL: http://arxiv.org/abs/2602.11616v1
• Date: Thu, 12 Feb 2026 06:08:04 GMT
• Title: The Power of Two Bases: Robust and copy-optimal certification of nearly all quantum states with few-qubit measurements
• Authors: Andrea Coladangelo, Jerry Li, Joseph Slote, Ellen Wu,
• Abstract summary: We present robust certification protocols based on few-qubit measurements.<n>Our tests are based on a new uncertainty principle for conditional fidelities.
• Score: 5.266360532660872
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Optimal Qubit Purification and Unitary Schur Sampling via Random SWAP Tests [6.25226846714401]
  We show that a simple protocol based solely on random SWAP tests achieves the same fidelity as the Schur transform, which is optimal.<n>This protocol is a powerful subroutine for tasks such as quantum state tomography and metrology.
  arXiv  Detail & Related papers  (2025-08-07T05:57:31Z)
• Instance-Optimal Quantum State Certification with Entangled Measurements [1.8416014644193066]
  We prove nearly instance-optimal bounds for quantum state certification when the tester can perform fully entangled measurements.<n>We prove our lower bounds using a novel quantum analogue of the Ingster-Suslina method, which is likely to be of independent interest.
  arXiv  Detail & Related papers  (2025-07-08T14:15:46Z)
• Few Single-Qubit Measurements Suffice to Certify Any Quantum State [1.740992908651449]
  We show that every pure hypothesis state can be certified using only $O(n2)$ single-qubit measurements applied to $O(n)$ copies of the lab state.<n>Our algorithm also showcases the power of adaptive measurements.
  arXiv  Detail & Related papers  (2025-06-12T23:08:09Z)
• In-situ mid-circuit qubit measurement and reset in a single-species trapped-ion quantum computing system [34.82692226532414]
  We implement in-situ mid-circuit measurement and reset (MCMR) operations on a trapped-ion quantum computing system.<n>We introduce and compare two methods for isolating data qubits from measured qubits.<n>We experimentally demonstrate both methods on a crystal of two $171textrmYb+$ ions.
  arXiv  Detail & Related papers  (2025-04-17T00:10:35Z)
• Robust Conformal Prediction with a Single Binary Certificate [58.450154976190795]
  Conformal prediction (CP) converts any model's output to prediction sets with a guarantee to cover the true label with (adjustable) high probability.<n>We propose a robust conformal prediction that produces smaller sets even with significantly lower MC samples.
  arXiv  Detail & Related papers  (2025-03-07T08:41:53Z)
• Coherence in Property Testing: Quantum-Classical Collapses and Separations [42.44394412033434]
  We show that no tester can distinguish subset states of size $2n/8$ from $2n/4$ with probability better than $2-Theta(n)$.<n>We also show connections to disentangler and quantum-to-quantum transformation lower bounds.
  arXiv  Detail & Related papers  (2024-11-06T19:52:15Z)
• Nearly tight bounds for testing tree tensor network states [0.0]
  Tree tensor network states (TTNS) generalize the notion of having low Schmidt-rank to multipartite quantum states. We study the task of testing whether an unknown pure state is a TTNS on $n$ qudits with bond dimension at most $r$. We also study the performance of tests using measurements performed on a small number of copies at a time.
  arXiv  Detail & Related papers  (2024-10-28T18:13:38Z)
• Certifying classes of $d$-outcome measurements with quantum steering [49.1574468325115]
  We provide a construction of a family of steering inequalities tailored to large classes of $d$-outcomes projective measurements. We prove that the maximal quantum violation of those inequalities can be used for certification of those measurements and the maximally entangled state of two qudits.
  arXiv  Detail & Related papers  (2024-10-27T15:32:53Z)
• The role of shared randomness in quantum state certification with unentangled measurements [36.19846254657676]
  We study quantum state certification using unentangled quantum measurements. $Theta(d2/varepsilon2)$ copies are necessary and sufficient for state certification. We develop a unified lower bound framework for both fixed and randomized measurements.
  arXiv  Detail & Related papers  (2024-01-17T23:44:52Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Compression for Qubit Clocks [55.38708484314286]
  We propose a compression protocol for $n$ identically prepared states of qubit clocks. The protocol faithfully encodes the states into $(1/2)log n$ qubits and $(1/2)log n$ classical bits.
  arXiv  Detail & Related papers  (2022-09-14T09:45:53Z)
• Parallel self-testing of EPR pairs under computational assumptions [12.847847919343646]
  We show that a single EPR pair of a single quantum device can be self-tested under computational assumptions. We show that our protocol can be passed with probability negligibly close to $1$ by an honest quantum device. A simplified version of our protocol is the first that can efficiently certify an arbitrary number of qubits of a single cloud quantum computer.
  arXiv  Detail & Related papers  (2022-01-31T18:42:45Z)
• On the optimal certification of von Neumann measurements [55.41644538483948]
  certification of quantum measurements can be viewed as the extension of quantum hypotheses testing. We show the connection between the certification of quantum channels or von Neumann measurements and the notion of $q$-numerical range.
  arXiv  Detail & Related papers  (2020-09-14T22:38:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.