Efficient Verification of Pure Quantum States in the Adversarial Scenario
arXiv:1909.01900 · doi:10.1103/PhysRevLett.123.260504
Abstract
Efficient verification of pure quantum states in the adversarial scenario is crucial to many applications in quantum information processing, such as blind measurement-based quantum computation and quantum networks. However, little is known about this topic so far. Here we establish a general framework for verifying pure quantum states in the adversarial scenario and clarify the resource cost. Moreover, we propose a simple and general recipe to constructing efficient verification protocols for the adversarial scenario from protocols for the nonadversarial scenario. With this recipe, arbitrary pure states can be verified in the adversarial scenario with almost the same efficiency as in the nonadversarial scenario. Many important quantum states can be verified in the adversarial scenario using local projective measurements with unprecedented high efficiencies.
arXiv comment5 pages and 2 figures; published in PRL
References in corpus (25)
- Quantum entanglement
- Entanglement detection
- Quantum state tomography via compressed sensing
- Direct Fidelity Estimation from Few Pauli Measurements
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Blind quantum computation protocol in which Alice only makes measurements
- Experimental Verification of Multipartite Entanglement in Quantum Networks
- Optimal verification of entangled states with local measurements
- Distribution of entanglement in large-scale quantum networks
- Verification of Many-Qubit States
- 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
- Verified measurement-based quantum computing with hypergraph states
- Optimal Verification of Two-Qubit Pure States
- Optimal verification and fidelity estimation of maximally entangled states
- Self-guaranteed measurement-based quantum computation
- 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
- Verifiable fault-tolerance in measurement-based quantum computation
- Group theoretical study of LOCC-detection of maximally entangled state using hypothesis testing
- Verifying commuting quantum computations via fidelity estimation of weighted graph states
- A simple protocol for certifying graph states and applications in quantum networks
Cited by in corpus (58)
- Theory of quantum system certification: a tutorial
- General framework for verifying pure quantum states in the adversarial scenario
- Nonstabilizerness determining the hardness of direct fidelity estimation
- Statistical Methods for Quantum State Verification and Fidelity Estimation
- Optimal verification and fidelity estimation of maximally entangled states
- Efficient verification of bipartite pure states
- Direct Fidelity Estimation of Quantum States using Machine Learning
- Optimal Verification of Greenberger-Horne-Zeilinger States
- Optimal verification of stabilizer states
- Towards the standardization of quantum state verification using optimal strategies
- Verification of phased Dicke states
- Efficient verification of quantum processes
- Sample-efficient device-independent quantum state verification and certification
- Efficient verification of quantum gates with local operations
- Robust and efficient verification of graph states in blind measurement-based quantum computation
- Quantum verification and estimation with few copies
- Information processing at the speed of light
- Quantum gate verification and its application in property testing
- Universally Optimal Verification of Entangled States with Nondemolition Measurements
- Efficient verification of continuous-variable quantum states and devices without assuming identical and independent operations
- Complexity of quantum state verification in the quantum linear systems problem
- Verification of graph states in an untrusted network
- Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders
- Efficient verification of Affleck-Kennedy-Lieb-Tasaki states
- Efficient Verification of Ground States of Frustration-Free Hamiltonians
- Quantum Metrology with Delegated Tasks
- Efficient verification of entangled continuous-variable quantum states with local measurements
- Authenticated teleportation and verification in a noisy network
- Zero Uncertainty States in the Presence of Quantum Memory
- Efficient Experimental Verification of Quantum Gates with Local Operations
- Robust quantum metrology with explicit symmetric states
- Valid and efficient entanglement verification with finite copies of a quantum state
- Experimental optimal verification of three-dimensional entanglement on a silicon chip
- Efficient verification of arbitrary entangled states with homogeneous local measurements
- Proof-of-principle experimental demonstration of quantum gate verification
- Learning Properties of Quantum States Without the I.I.D. Assumption
- Adaptive State Fidelity Estimation for Higher Dimensional Bipartite Entanglement
- Cross-Platform Comparison of Arbitrary Quantum Processes
- Nondestructive Verification of Entangled States via Fidelity Witnessing
- Passive verification protocol for thermal graph states
- Robust one-sided self-testing of two-qubit states via quantum steering
- Adversarial quantum channel discrimination
- Measuring quantum relative entropy with finite-size effect
- Entanglement Meter: Estimation of entanglement with single copy in Interferometer
- Quantum subspace verification for error correction codes
- Composable framework for device-independent state certification
- Experimental Verification of Entangled States in the Adversarial Scenario
- Relative-belief inference in quantum information theory
- Verification of entangled states under noisy measurements
- Experimental Masking of Real Quantum States
- Optimal Verification of the Bell State and Greenberger-Horne-Zeilinger States in Untrusted Quantum Networks
- Universal and Efficient Quantum State Verification via Schmidt Decomposition and Mutually Unbiased Bases
- Quantum Merlin-Arthur proof systems for synthesizing quantum states
- Beating the Optimal Verification of Entangled States via Collective Strategies
- Classical Communication Enhanced Quantum State Verification
- Prescriptive preparation and verification of nonstabilizer states
- Phase Transitions and Noise Robustness of Quantum Graph States
- Why cut-and-choose quantum state verification cannot be both efficient and secure