Self-testing identifies quantum states and correlations that exhibit non-locality, distinguishing them, up to local transformations, from other quantum states. Due to their strong non-locality, all graph states can be self-tested with strictly local measurement devices. Moreover, graph states display non-local 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 the framework of bounded classical communication, we show that certain graph states with appropriate symmetry can be robustly self-tested, by providing an explicit self-test for the circular graph state and the honeycomb cluster state. 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 non-local correlations in the communication scenario. Furthermore, in the standard setup without classical communication, we demonstrate that any graph state from an underlying connected graph with at least three vertices can be robustly self-tested using only Pauli measurements.

Publication

Self-Testing Graph States Permitting Bounded Classical Communication

Self-testing identifies quantum states and correlations that exhibit non-locality, distinguishing them, up to local transformations, from other quantum states. Due to their strong non-locality, all graph states can be self-tested with strictly local measurement devices. Moreover, graph states display non-local 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 the framework of bounded classical communication, we show that certain graph states with appropriate symmetry can be robustly self-tested, by providing an explicit self-test for the circular graph state and the honeycomb cluster state. 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 non-local correlations in the communication scenario. Furthermore, in the standard setup without classical communication, we demonstrate that any graph state from an underlying connected graph with at least three vertices can be robustly self-tested using only Pauli measurements.