Few Single-Qubit Measurements Suffice to Certify Any Quantum State

2025-06-12

AI Summary

This work addresses the efficient certification of pure quantum states: given an $n$-qubit target state, how to verify with minimal resources whether a prepared state is close to it in trace distance. We propose the first universal certification scheme requiring only $O(n)$ copies and $O(n^2)$ single-qubit measurements—achieving the first polynomial-time, single-qubit-measurement protocol for arbitrary pure states, thereby resolving an open problem posed by Huang et al. Methodologically, our approach integrates linear confusion analysis, projection operator decomposition, and randomized single-qubit measurement design, supported by matrix concentration inequalities and rigorous trace-distance bounds to ensure statistical reliability. The achieved sample and measurement complexities are provably tight—matching fundamental lower bounds—and represent an exponential improvement over all prior universal schemes (the best previous required exponentially many measurements). This result establishes a foundational theoretical framework and a practical pathway for scalable quantum state verification.

Technology Category

• Machine Learning: Quantum Machine Learning
• Intelligent Robots: State Estimation
• Constraint Satisfaction and Optimization: Satisfiability

Application Category

• Security and Privacy: Large-scale security measurements
• Web Mining and Content Analysis: Web data provenance, reliability, and authenticity
• Responsible Web: Measurement, analysis, and circumvention of Web censorship

Abstract

A fundamental task in quantum information science is emph{state certification}: testing whether a lab-prepared $n$-qubit state is close to a given hypothesis state. In this work, we show that emph{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 sub-exponentially 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).

Problem

• Certifying quantum states with minimal measurements
• Reducing single-qubit measurements for state verification
• Efficient certification of pure n-qubit states

Innovation

• Uses O(n^2) single-qubit measurements
• Certifies pure states efficiently
• Reduces measurements to polynomial scale