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:2609.40259

Self-testing the toric code against classical communication

Gustavo Fróes, Amanda Wei, Carlos de Gois, Denis Rochette, Marc-Olivier Renou

quant-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations
arXivHTMLPDF

Abstract

Device-independent self-testing certifies a multipartite quantum state from the correlations it produces alone, without assumptions on the inner workings of the devices. Most existing self-tests, however, break down as soon as the parties can exchange messages. We consider a relaxed setting in a quantum network, where in the honest version of the protocol, the parties never communicate, yet certification remains sound even in an untrusted case where the untrusted devices secretly exchange classical messages within a bounded distance in the network. We show that the code space of the toric code, distributed over a network with the geometry of a torus, can be self-tested in this setting in a noise-robust way, against communication up to distances proportional to the network diameter. We also develop an algorithmic method for constructing such protocols and extend our results to the surface code and cluster states, robust to one round of nearest-neighbor classical communication

AI Summary

Can a quantum error-correcting code subspace be self-tested when devices exchange bounded-range classical information? This paper constructs protocols for the toric-code subspace that retain a separate extraction isometry at every party despite such communication. The communication model allows devices to learn all measurement inputs within graph distance $r$, but excludes messages depending on quantum-measurement outcomes; it therefore does not cover arbitrary LOCC. For an $L\times L$ toric-code lattice, an analytical protocol using single-qubit Pauli measurements tolerates $r$ communication rounds whenever $L\geq 6r+3$. The required lattice size scales optimally as $\Theta(r)$, although the constant is not established as optimal. If every tested correlator differs from its ideal value by at most $\epsilon$, the extracted state's norm distance from the code subspace is bounded by $(\sqrt{2}+8)L^2\sqrt{\epsilon}$. The construction combines four stabilizer-derived submeasurements to certify local $X$–$Z$ anticommutation, then separately certifies the code stabilizers. Enlarged primal and dual loops, together with inputs assigned to parties whose outputs are discarded, match the local contexts needed for operator cancellations despite communication. An integer-linear-programming formulation automates searches for these certificates. Restricted searches find toric-code constructions with $L=2r+2$ for all tested distances, conjectured minimal, and one-round-robust certificates for a $4\times4$ surface code and a $6\times6$ cluster state without auxiliary parties. The robustness bound deteriorates with system size. The numerical searches restrict contexts and certificate lengths, and no general direct construction for arbitrary graph states or protection against quantum communication is established.

Little sign of AI-generated textStrong assumptions

Central claim may not hold: The abstract's communication-robust self-testing claim is established only when messages cannot depend on quantum-measurement outcomes, a substantive restriction absent from the abstract.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Self-Testing of a Single Quantum Device Under Computational Assumptions

Tony Metger, Thomas Vidick

Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system’s state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device’s state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.

•Jan 1, 2021•5 citations

Self-testing of a single quantum device under computational assumptions

Tony Metger, Thomas Vidick

Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system’s state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device’s state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.

•Jan 1, 2021•11 citations

Self-testing of a single quantum device under computational assumptions

Tony Metger, Thomas Vidick

Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system's state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device's state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.

arXiv:2001.09161•Quantum•Sep 16, 2021•38 citations

Tailoring Bell inequalities to the qudit toric code and self testing

Eloïc Vallée, Owidiusz Makuta, Patrick Emonts +2 more

Bell nonlocality provides a robust scalable route to the efficient certification of quantum states. Here, we introduce a general framework for constructing Bell inequalities tailored to the $\mathbb{Z}_d$ toric code for odd prime local dimensions. Selecting a suitable subset of stabilizer operators and mapping them to generalized measurement observables, we compute multipartite Bell expressions whose quantum maxima admit a sum-of-squares decomposition. We show that these inequalities are maximally violated by all states in the ground-state manifold of the $\mathbb{Z}_d$ toric code, and determine their classical (local) bounds through a combination of combinatorial tiling arguments and explicit optimization. As a concrete application, we analyze the case of $d=3$ and demonstrate that the maximal violation self-tests the full qutrit toric-code subspace, up to local isometries and complex conjugation. This constitutes, to our knowledge, the first-ever example of self-testing a qutrit subspace. Extending these constructions, we further present schemes to enhance the ratio of classical--quantum bounds and thus improve robustness to experimental imperfections. Our results establish a pathway toward device-independent certification of highly entangled topological quantum matter and provide new tools for validating qudit states in error-correcting codes and quantum simulation platforms.

quant-pharXiv:2512.00146•Dec 2, 2025•3 citations

Self-Testing with Dishonest Parties and Device-Independent Entanglement Certification in Quantum Communication Networks

Gláucia Murta, Flavio Baccari

We consider the task of device-independent quantum state certification in a network where some of the nodes may collude and act dishonestly. We introduce the paradigm of self-testing with dishonest parties and provide a certification protocol for the Greenberger-Horne-Zeilinger state in this framework, together with robust statements about the fidelity of the shared state. We extend our results to the cluster scenario, where many subgroups of parties may collude. Our findings provide a new operational motivation for the strong definition of genuine multipartite nonlocality originally introduced by Svetlichny.

arXiv:2305.10587•Physical Review Letters•Oct 3, 2023•14 citations

Self-testing with finite statistics enabling the certification of a quantum network link

Jean-Daniel Bancal, Kai Redeker, Pavel Sekatski +2 more

Self-testing is a method to certify devices from the result of a Bell test. Although examples of noise tolerant self-testing are known, it is not clear how to deal efficiently with a finite number of experimental trials to certify the average quality of a device without assuming that it behaves identically at each run. As a result, existing self-testing results with finite statistics have been limited to guarantee the proper working of a device in just one of all experimental trials, thereby limiting their practical applicability. We here derive a method to certify through self-testing that a device produces states on average close to a Bell state without assumption on the actual state at each run. Thus the method is free of the I.I.D. (independent and identically distributed) assumption. Applying this new analysis on the data from a recent loophole-free Bell experiment, we demonstrate the successful distribution of Bell states over 398 meters with an average fidelity of ≥ 55.50% at a confidence level of 99%. Being based on a Bell test free of detection and locality loopholes, our certification is evidently device-independent, that is, it does not rely on trust in the devices or knowledge of how the devices work. This guarantees that our link can be integrated in a quantum network for performing long-distance quantum communications with security guarantees that are independent of the details of the actual implementation.

arXiv:1812.09117•Quantum•Mar 2, 2021•33 citations
Device-independent self-testing certifies a multipartite quantum state from the correlations it produces alone, without assumptions on the inner workings of the devices. Most existing self-tests, however, break down as soon as the parties can exchange messages. We consider a relaxed setting in a quantum network, where in the honest version of the protocol, the parties never communicate, yet certification remains sound even in an untrusted case where the untrusted devices secretly exchange classical messages within a bounded distance in the network. We show that the code space of the toric code, distributed over a network with the geometry of a torus, can be self-tested in this setting in a noise-robust way, against communication up to distances proportional to the network diameter. We also develop an algorithmic method for constructing such protocols and extend our results to the surface code and cluster states, robust to one round of nearest-neighbor classical communication
Can a quantum error-correcting code subspace be self-tested when devices exchange bounded-range classical information? This paper constructs protocols for the toric-code subspace that retain a separate extraction isometry at every party despite such communication. The communication model allows devices to learn all measurement inputs within graph distance rrr, but excludes messages depending on quantum-measurement outcomes; it therefore does not cover arbitrary LOCC.
For an L×LL\times LL×L toric-code lattice, an analytical protocol using single-qubit Pauli measurements tolerates rrr communication rounds whenever L≥6r+3L\geq 6r+3L≥6r+3. The required lattice size scales optimally as Θ(r)\Theta(r)Θ(r), although the constant is not established as optimal. If every tested correlator differs from its ideal value by at most ϵ\epsilonϵ, the extracted state's norm distance from the code subspace is bounded by (2+8)L2ϵ(\sqrt{2}+8)L^2\sqrt{\epsilon}(2​+8)L2ϵ​.
The construction combines four stabilizer-derived submeasurements to certify local XXX–ZZZ anticommutation, then separately certifies the code stabilizers. Enlarged primal and dual loops, together with inputs assigned to parties whose outputs are discarded, match the local contexts needed for operator cancellations despite communication. An integer-linear-programming formulation automates searches for these certificates. Restricted searches find toric-code constructions with L=2r+2L=2r+2L=2r+2 for all tested distances, conjectured minimal, and one-round-robust certificates for a 4×44\times44×4 surface code and a 6×66\times66×6 cluster state without auxiliary parties.
The robustness bound deteriorates with system size. The numerical searches restrict contexts and certificate lengths, and no general direct construction for arbitrary graph states or protection against quantum communication is established.
Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system’s state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device’s state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.
Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system’s state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device’s state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.
Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system's state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device's state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.
Bell nonlocality provides a robust scalable route to the efficient certification of quantum states. Here, we introduce a general framework for constructing Bell inequalities tailored to the Zd\mathbb{Z}_dZd​ toric code for odd prime local dimensions. Selecting a suitable subset of stabilizer operators and mapping them to generalized measurement observables, we compute multipartite Bell expressions whose quantum maxima admit a sum-of-squares decomposition. We show that these inequalities are maximally violated by all states in the ground-state manifold of the Zd\mathbb{Z}_dZd​ toric code, and determine their classical (local) bounds through a combination of combinatorial tiling arguments and explicit optimization. As a concrete application, we analyze the case of d=3d=3d=3 and demonstrate that the maximal violation self-tests the full qutrit toric-code subspace, up to local isometries and complex conjugation. This constitutes, to our knowledge, the first-ever example of self-testing a qutrit subspace. Extending these constructions, we further present schemes to enhance the ratio of classical--quantum bounds and thus improve robustness to experimental imperfections. Our results establish a pathway toward device-independent certification of highly entangled topological quantum matter and provide new tools for validating qudit states in error-correcting codes and quantum simulation platforms.
We consider the task of device-independent quantum state certification in a network where some of the nodes may collude and act dishonestly. We introduce the paradigm of self-testing with dishonest parties and provide a certification protocol for the Greenberger-Horne-Zeilinger state in this framework, together with robust statements about the fidelity of the shared state. We extend our results to the cluster scenario, where many subgroups of parties may collude. Our findings provide a new operational motivation for the strong definition of genuine multipartite nonlocality originally introduced by Svetlichny.
Self-testing is a method to certify devices from the result of a Bell test. Although examples of noise tolerant self-testing are known, it is not clear how to deal efficiently with a finite number of experimental trials to certify the average quality of a device without assuming that it behaves identically at each run. As a result, existing self-testing results with finite statistics have been limited to guarantee the proper working of a device in just one of all experimental trials, thereby limiting their practical applicability. We here derive a method to certify through self-testing that a device produces states on average close to a Bell state without assumption on the actual state at each run. Thus the method is free of the I.I.D. (independent and identically distributed) assumption. Applying this new analysis on the data from a recent loophole-free Bell experiment, we demonstrate the successful distribution of Bell states over 398 meters with an average fidelity of ≥ 55.50% at a confidence level of 99%. Being based on a Bell test free of detection and locality loopholes, our certification is evidently device-independent, that is, it does not rely on trust in the devices or knowledge of how the devices work. This guarantees that our link can be integrated in a quantum network for performing long-distance quantum communications with security guarantees that are independent of the details of the actual implementation.