Self-Testing Graph States Permitting Bounded Classical Communication

Abstract

Self-testing identifies quantum states and correlations that exhibit nonlocality, distinguishing them, up to local transformations, from other quantum states. Due to their strong nonlocality, it is known that all graph states can be self-tested in the standard setting - where parties are not allowed to communicate. Recently it has been shown that graph states display nonlocal correlations even when bounded classical communication on the underlying graph is permitted, a feature that has found applications in proving a circuit-depth separation between classical and quantum computing. In this work, we develop self testing in the framework of bounded classical communication, and we show that certain graph states can be robustly self-tested even allowing for communication. In particular, we provide an explicit self-test for the circular graph state and the honeycomb cluster state - the latter known to be a universal resource for measurement based quantum computation. Since communication generally obstructs self-testing of graph states, we further provide a procedure to robustly self-test any graph state from larger ones that exhibit nonlocal correlations in the communication scenario.

References in corpus (33)

• Bell nonlocality
• Measurement-device-independent quantum key distribution
• Device-independent security of quantum cryptography against collective attacks
• Random Numbers Certified by Bell's Theorem
• Multi-party entanglement in graph states
• Secure quantum key distribution over 421 km of optical fiber
• From Bell's Theorem to Secure Quantum Key Distribution
• Experimental entanglement of six photons in graph states
• Graph States for Quantum Secret Sharing
• Quantum advantage with shallow circuits
• Deterministic Generation of a Cluster State of Entangled Photons
• A fault-tolerant one-way quantum computer
• Self-testing of quantum systems: a review
• Private Randomness Expansion With Untrusted Devices
• Certified randomness in quantum physics
• Device-independent tests of classical and quantum dimensions
• Universal resources for measurement-based quantum computation
• Bell Inequalities for Graph States
• Sum-of-squares decompositions for a family of CHSH-like inequalities and their application to self-testing
• Nonlocality of cluster states of qubits
• Experimental demonstration of graph-state quantum secret sharing
• Quantum advantage with noisy shallow circuits in 3D
• Sequential generation of linear cluster states from a single photon emitter
• Experimental demonstration of a graph state quantum error-correction code
• Fully device independent Conference Key Agreement
• Self-testing multipartite entangled states through projections onto two systems
• Graph States as a Resource for Quantum Metrology
• Quantum Anonymous Transmissions
• Interactive proofs for BQP via self-tested graph states
• Two-setting Bell Inequalities for Graph States
• Modeling Pauli measurements on graph states with nearest-neighbor classical communication
• Certified randomness in tight space
• Corrected Bell and Noncontextuality Inequalities for Realistic Experiments