Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1010.1989 · Conference on Theory of Quantum Computation, Communication and Cryptography

Self-testing graph states

Matthew McKague

Published Oct 11, 2010• 38 citations
arXivHTMLPDF

Abstract

We give a construction for a self-test for any connected graph state. In other words, for each connected graph state we give a set of non-local correlations that can only be achieved (quantumly) by that particular graph state and certain local measurements. The number of correlations considered is small, being linear in the number of vertices in the graph. We also prove robustness for the test.

DOI
10.48550/arxiv.1010.1989

Related papers

Self-Testing Graph States Permitting Bounded Classical Communication

Uta Isabella Meyer, Ivan Šupić, Frédéric Grosshans +1 more

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.

arXiv:2404.03496•Quantum•Jan 8, 2026•4 citations

Graph-Theoretic Approach for Self-Testing in Bell Scenarios

Kishor Bharti, Maharshi Ray, Zhen‐Peng Xu +3 more

Self-testing is a technology to certify states and measurements using only the statistics of the experiment.Self-testing is possible if some extremal points in the set B Q of quantum correlations for a Bell experiment are achieved, up to isometries, with specific states and measurements.However, B Q is difficult to characterize, so it is also difficult to prove whether or not a given matrix of quantum correlations allows for self-testing.Here, we show how some tools from graph theory can help to address this problem.We observe that B Q is strictly contained in an easy-to-characterize set associated with a graph, (G).Therefore, whenever the optimum over B Q and the optimum over (G) coincide, self-testing can be demonstrated by simply proving self-testability with (G).Interestingly, these maxima coincide for the quantum correlations that maximally violate many families of Bell-like inequalities.Therefore, we can apply this approach to prove the self-testability of many quantum correlations, including some that are not previously known to allow for self-testing.In addition, this approach connects self-testing to some open problems in discrete mathematics.We use this connection to prove a conjecture [M.Araújo et al., Phys.Rev. A, 88, 022118 (2013)] about the closed-form expression of the Lovász theta number for a family of graphs called the Möbius ladders.Although there are a few remaining issues (e.g., in some cases, the proof requires the assumption that measurements are of rank 1), this approach provides an alternative method to self-testing and draws interesting connections between quantum mechanics and discrete mathematics.

arXiv:2104.13035•PRX Quantum•Sep 26, 2022•19 citations

A non-robust quantum correlation self-test

Ranyiliu Chen, Yuming Zhao

We show that exact self-testing of a quantum correlation does not imply robust self-testing. Mančinska and Schmidt previously established such a separation for non-local games, but their obstruction to robustness arises from two distinct optimal correlations, with the self-tested one remaining robust. We establish the separation for a single correlation. Our proof is operator-algebraic. The main technical contribution is a general construction that associates a synchronous binary correlation to any finitely presented C*-algebra with unitary generators and real-coefficient relations. The implementing states of the correlation correspond exactly to the tracial states on the algebra. We apply this construction to an algebra with a unique finite-dimensional tracial state and a distinct amenable tracial state. By a characterization established by Zhao and independently by Kar, the resulting correlation is a self-test but not a robust self-test.

quant-pharXiv:2609.25117•Sep 22, 2026•1 citation

Self-testing in parallel

Matthew McKague

Self-testing allows us to determine, through classical interaction only, whether some players in a non-local game share particular quantum states. Most work on self-testing has concentrated on developing tests for small states like one pair of maximally entangled qubits, or on tests where there is a separate player for each qubit, as in a graph state. Here we consider the case of testing many maximally entangled pairs of qubits shared between two players. Previously such a test was shown where testing is sequential, i.e., one pair is tested at a time. Here we consider the parallel case where all pairs are tested simultaneously, giving considerably more power to dishonest players. We derive sufficient conditions for a self-test for many maximally entangled pairs of qubits shared between two players and also two constructions for self-tests where all pairs are tested simultaneously.

arXiv:1511.04194•New Journal of Physics•Apr 15, 2016•46 citations

Scalable Bell Inequalities for Qubit Graph States and Robust Self-Testing

F. Baccari, Remigiusz Augusiak, Ivan Šupić +2 more

Bell inequalities constitute a key tool in quantum information theory: they not only allow one to reveal nonlocality in composite quantum systems, but, more importantly, they can be used to certify relevant properties thereof. We provide a general construction of Bell inequalities that are maximally violated by the multiqubit graph states and can be used for their robust self-testing. Apart from their theoretical relevance, our inequalities offer two main advantages from an experimental viewpoint: (i) they present a significant reduction of the experimental effort needed to violate them, as the number of correlations they contain scales only linearly with the number of observers; (ii) numerical results indicate that the self-testing statements for graph states derived from our inequalities tolerate noise levels that are met by present experimental data. We also discuss possible generalizations of our approach to entangled states whose stabilizers are not tensor products of Pauli matrices. Our work introduces a promising approach for the certification of complex many-body quantum states.

arXiv:1812.10428•Physical Review Letters•Jan 17, 2020•100 citations

Genuine multipartite nonlocality detection in graph states

Owidiusz Makuta, Flavio Baccari, Remigiusz Augusiak

Experimental detection of multipartite Bell nonlocality faces many challenges. The increase in the size of the system demands a higher fidelity of state preparation, a higher detection efficiency, and a larger number of correlators that need to be estimated. These issues are even more pronounced if one wishes to detect a more restrictive variant of Bell nonlocality called genuine multipartite nonlocality (GMNL). In this work, we introduce two classes of multipartite Bell inequalities that are capable of detecting GMNL correlations and address different experimental hurdles in GMNL detection. The first class consists of the number of correlators that scales linearly with the number of parties. The second class increases the number of correlators and, in return, provides higher noise robustness of GMNL detection. Both classes of inequalities are constructed to detect GMNL in graph states, and in fact both can be used for self-testing of graph states and the performed measurements.

quant-pharXiv:2610.13609•Oct 12, 2026•0 citations
We give a construction for a self-test for any connected graph state. In other words, for each connected graph state we give a set of non-local correlations that can only be achieved (quantumly) by that particular graph state and certain local measurements. The number of correlations considered is small, being linear in the number of vertices in the graph. We also prove robustness for the test.
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.
Self-testing is a technology to certify states and measurements using only the statistics of the experiment.Self-testing is possible if some extremal points in the set B Q of quantum correlations for a Bell experiment are achieved, up to isometries, with specific states and measurements.However, B Q is difficult to characterize, so it is also difficult to prove whether or not a given matrix of quantum correlations allows for self-testing.Here, we show how some tools from graph theory can help to address this problem.We observe that B Q is strictly contained in an easy-to-characterize set associated with a graph, (G).Therefore, whenever the optimum over B Q and the optimum over (G) coincide, self-testing can be demonstrated by simply proving self-testability with (G).Interestingly, these maxima coincide for the quantum correlations that maximally violate many families of Bell-like inequalities.Therefore, we can apply this approach to prove the self-testability of many quantum correlations, including some that are not previously known to allow for self-testing.In addition, this approach connects self-testing to some open problems in discrete mathematics.We use this connection to prove a conjecture [M.Araújo et al., Phys.Rev. A, 88, 022118 (2013)] about the closed-form expression of the Lovász theta number for a family of graphs called the Möbius ladders.Although there are a few remaining issues (e.g., in some cases, the proof requires the assumption that measurements are of rank 1), this approach provides an alternative method to self-testing and draws interesting connections between quantum mechanics and discrete mathematics.
We show that exact self-testing of a quantum correlation does not imply robust self-testing. Mančinska and Schmidt previously established such a separation for non-local games, but their obstruction to robustness arises from two distinct optimal correlations, with the self-tested one remaining robust. We establish the separation for a single correlation. Our proof is operator-algebraic. The main technical contribution is a general construction that associates a synchronous binary correlation to any finitely presented C*-algebra with unitary generators and real-coefficient relations. The implementing states of the correlation correspond exactly to the tracial states on the algebra. We apply this construction to an algebra with a unique finite-dimensional tracial state and a distinct amenable tracial state. By a characterization established by Zhao and independently by Kar, the resulting correlation is a self-test but not a robust self-test.
Self-testing allows us to determine, through classical interaction only, whether some players in a non-local game share particular quantum states. Most work on self-testing has concentrated on developing tests for small states like one pair of maximally entangled qubits, or on tests where there is a separate player for each qubit, as in a graph state. Here we consider the case of testing many maximally entangled pairs of qubits shared between two players. Previously such a test was shown where testing is sequential, i.e., one pair is tested at a time. Here we consider the parallel case where all pairs are tested simultaneously, giving considerably more power to dishonest players. We derive sufficient conditions for a self-test for many maximally entangled pairs of qubits shared between two players and also two constructions for self-tests where all pairs are tested simultaneously.
Bell inequalities constitute a key tool in quantum information theory: they not only allow one to reveal nonlocality in composite quantum systems, but, more importantly, they can be used to certify relevant properties thereof. We provide a general construction of Bell inequalities that are maximally violated by the multiqubit graph states and can be used for their robust self-testing. Apart from their theoretical relevance, our inequalities offer two main advantages from an experimental viewpoint: (i) they present a significant reduction of the experimental effort needed to violate them, as the number of correlations they contain scales only linearly with the number of observers; (ii) numerical results indicate that the self-testing statements for graph states derived from our inequalities tolerate noise levels that are met by present experimental data. We also discuss possible generalizations of our approach to entangled states whose stabilizers are not tensor products of Pauli matrices. Our work introduces a promising approach for the certification of complex many-body quantum states.
Experimental detection of multipartite Bell nonlocality faces many challenges. The increase in the size of the system demands a higher fidelity of state preparation, a higher detection efficiency, and a larger number of correlators that need to be estimated. These issues are even more pronounced if one wishes to detect a more restrictive variant of Bell nonlocality called genuine multipartite nonlocality (GMNL). In this work, we introduce two classes of multipartite Bell inequalities that are capable of detecting GMNL correlations and address different experimental hurdles in GMNL detection. The first class consists of the number of correlators that scales linearly with the number of parties. The second class increases the number of correlators and, in return, provides higher noise robustness of GMNL detection. Both classes of inequalities are constructed to detect GMNL in graph states, and in fact both can be used for self-testing of graph states and the performed measurements.