Verification of graph states in an untrusted network

Abstract

Graph states are a large class of multipartite entangled quantum states that form the basis of schemes for quantum computation, communication, error correction, metrology, and more. In this work, we consider verification of graph states generated by an untrusted source and shared between a network of possibly dishonest parties. This has implications in certifying the application of graph states for various distributed tasks. We present a protocol which is globally efficient for a large family of useful graph states, including cluster states, GHZ states, cycle graph states and more. For general graph states, efficiency with respect to the security parameter is maintained, though there is a cost increase with the size of the graph state. The protocols are practical, requiring only multiple copies of the graph state, local measurements and classical communication.

arXiv commentpublished version

References in corpus (32)

• Quantum secret sharing
• Measurement-based quantum computation with cluster states
• Multi-party entanglement in graph states
• Quantum metrology from a quantum information science perspective
• A quantum network of clocks
• Graph States for Quantum Secret Sharing
• Quantum certification and benchmarking
• Unconditionally verifiable blind computation
• Quantum Tomography
• Verifiable measurement-only blind quantum computing with stabilizer testing
• Experimental demonstration of graph-state quantum secret sharing
• Experimental Verification of Multipartite Entanglement in Quantum Networks
• Optimal verification of entangled states with local measurements
• Experimental demonstration of a graph state quantum error-correction code
• Architectures for quantum simulation showing a quantum speedup
• Efficient Verification of Pure Quantum States in the Adversarial Scenario
• Flexible resources for quantum metrology
• Graph States as a Resource for Quantum Metrology
• Multipartite entanglement verification resistant against dishonest parties
• Verification of Many-Qubit States
• Entanglement Witnesses for Graph States: General Theory and Examples
• Anonymity for practical quantum networks
• Multiparty Delegated Quantum Computing
• Efficient Verification of Hypergraph States
• Self-guaranteed measurement-based quantum computation
• Resource-efficient verification of quantum computing using Serfling's bound
• Experimental demonstration of secure quantum remote sensing
• Cryptographic quantum metrology
• On the equivalence between sharing quantum and classical secrets, and error correction
• Cryptographic approach to Quantum Metrology
• Authenticated teleportation and verification in a noisy network
• Composable Security for Multipartite Entanglement Verification

Cited by in corpus (9)

• Private and Robust States for Distributed Quantum Sensing
• Authenticated teleportation and verification in a noisy network
• Generation of complete graph states in a spin-$1/2$ Heisenberg chain with a globally optimized magnetic field
• Learning Properties of Quantum States Without the I.I.D. Assumption
• Many-body quantum resources of graph states
• Quantum-private distributed sensing
• Anonymous and private parameter estimation in networks of quantum sensors
• Heralded photonic graph states with inefficient quantum emitters
• Why cut-and-choose quantum state verification cannot be both efficient and secure