Computational self-testing for entangled magic states

Abstract

In the seminal paper [Metger and Vidick, Quantum '21], they proposed a computational self-testing protocol for Bell states in a single quantum device. Their protocol relies on the fact that the target states are stabilizer states, and hence it is highly non-trivial to reveal whether the other class of quantum states, non-stabilizer states, can be self-tested within their framework. Among non-stabilizer states, magic states are indispensable resources for universal quantum computation. In this letter, we show that a magic state for the CCZ gate can be self-tested while that for the T gate cannot. Our result is applicable to a proof of quantumness, where we can classically verify whether a quantum device generates a quantum state having non-zero magic.

arXiv comment31 pages, 1 figure, Supplementary material simplied but the results unchanged

References in corpus (18)

• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Fully device independent quantum key distribution
• Self-testing of quantum systems: a review
• Average-case complexity versus approximate simulation of commuting quantum computations
• Simulation of quantum circuits by low-rank stabilizer decompositions
• Robust Self Testing of the Singlet
• All Pure Bipartite Entangled States can be Self-Tested
• Quantum Hypergraph States
• Many-body quantum magic
• Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
• Hierarchy of universal entanglement in 2D measurement-based quantum computation
• Verification of Many-Qubit States
• Efficient Verification of Hypergraph States
• Device-Independent Quantum Key Distribution with Local Bell Test
• Verified measurement-based quantum computing with hypergraph states
• Extreme violation of local realism in quantum hypergraph states
• Self-testing of a single quantum device under computational assumptions
• Classical zero-knowledge arguments for quantum computations

Cited by in corpus (2)

• Lattice-Based Quantum Advantage from Rotated Measurements
• Uncertainty-disturbance relations and applications