Optimal verification of stabilizer states
arXiv:2007.09713 · doi:10.1103/PhysRevResearch.2.043323
Abstract
Statistical verification of a quantum state aims to certify whether a given unknown state is close to the target state with confidence. So far, sample-optimal verification protocols based on local measurements have been found only for disparate groups of states: bipartite pure states, GHZ states, and antisymmetric basis states. In this work, we investigate systematically optimal verification of entangled stabilizer states using Pauli measurements. First, we provide a lower bound on the sample complexity of any verification protocol based on separable measurements, which is independent of the number of qubits and the specific stabilizer state. Then we propose a simple algorithm for constructing optimal protocols based on Pauli measurements. Our calculations suggest that optimal protocols based on Pauli measurements can saturate the above bound for all entangled stabilizer states, and this claim is verified explicitly for states up to seven qubits. Similar results are derived when each party can choose only two measurement settings, say X and Z. Furthermore, by virtue of the chromatic number, we provide an upper bound for the minimum number of settings required to verify any graph state, which is expected to be tight. For experimentalists, optimal protocols and protocols with the minimum number of settings are explicitly provided for all equivalent classes of stabilizer states up to seven qubits. For theorists, general results on stabilizer states (including graph states in particular) and related structures derived here may be of independent interest beyond quantum state verification.
arXiv comment38 pages, 2 long tables. Code available at https://github.com/Ninnat/graph-state-verification
References in corpus (33)
- Measurement-based quantum computation with cluster states
- Improved Simulation of Stabilizer Circuits
- Multi-party entanglement in graph states
- Geometric measure of entanglement and applications to bipartite and multipartite quantum states
- On mutually unbiased bases
- Graph States for Quantum Secret Sharing
- Quantum error-correcting codes associated with graphs
- Quantum certification and benchmarking
- Graphical description of the action of local Clifford transformations on graph states
- Hudson's Theorem for finite-dimensional quantum systems
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Optimal verification of entangled states with local measurements
- Reliable quantum certification for photonic quantum technologies
- Efficient Verification of Pure Quantum States in the Adversarial Scenario
- A study of LOCC-detection of a maximally entangled state using hypothesis testing
- General framework for verifying pure quantum states in the adversarial scenario
- Efficient Verification of Hypergraph States
- Direct certification of a class of quantum simulations
- Entanglement and local information access for graph states
- Optimal verification and fidelity estimation of maximally entangled states
- Optimal Verification of Two-Qubit Pure States
- Resource-efficient verification of quantum computing using Serfling's bound
- Efficient verification of bipartite pure states
- Optimal verification of general bipartite pure states
- Efficient verification of Dicke states
- Fidelity witnesses for fermionic quantum simulations
- Optimal Verification of Greenberger-Horne-Zeilinger States
- Group theoretical study of LOCC-detection of maximally entangled state using hypothesis testing
- Efficient verification of quantum processes
- Efficient verification of quantum gates with local operations
- Quantum gate verification and its application in property testing
- Validating and Certifying Stabilizer States
- Efficient verification of bosonic quantum channels via benchmarking
Cited by in corpus (23)
- Nonstabilizerness determining the hardness of direct fidelity estimation
- Statistical Methods for Quantum State Verification and Fidelity Estimation
- Verification of phased Dicke states
- Robust and efficient verification of graph states in blind measurement-based quantum computation
- Dissipative Dynamics of Graph-State Stabilizers with Superconducting Qubits
- Universally Optimal Verification of Entangled States with Nondemolition Measurements
- Fidelity measurement of a multiqubit cluster state with minimal effort
- Verifiable measurement-based quantum random sampling with trapped ions
- Symmetric quantum states: a review of recent progress
- Efficient verification of arbitrary entangled states with homogeneous local measurements
- Proof-of-principle experimental demonstration of quantum gate verification
- Counting stabiliser codes for arbitrary dimension
- Fast algorithms for classical specifications of stabiliser states and Clifford gates
- Many-Body Entanglement in Solid-State Emitters
- Verification of entangled states under noisy measurements
- Experimental Verification of Entangled States in the Adversarial Scenario
- Quantum subspace verification for error correction codes
- Optimizing Measurements Sequences for Quantum State Verification
- Phase Transitions and Noise Robustness of Quantum Graph States
- Prescriptive preparation and verification of nonstabilizer states
- Beating the Optimal Verification of Entangled States via Collective Strategies
- Optimal Verification of the Bell State and Greenberger-Horne-Zeilinger States in Untrusted Quantum Networks
- Graph States and the Variety of Principal Minors