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

Certification of a functionality in a quantum network stage

Victoria Lipińska, Lê Phuc Thinh, Jérémy Ribeiro, Stephanie Wehner

Published Jan 1, 2020• 1 citation
Publisher

Abstract

We consider testing the ability of quantum network nodes to execute multi-round quantum protocols. Specifically, we examine protocols in which the nodes are capable of performing quantum gates, storing qubits and exchanging said qubits over the network a certain number of times. We propose a simple ping-pong test, which provides a certificate for the capability of the nodes to run certain multi-round protocols. We first show that in the noise-free regime the only way the nodes can pass the test is if they do indeed possess the desired capabilities. We then proceed to consider the case where operations are noisy, and provide an initial analysis showing how our test can be used to estimate parameters that allow us to draw conclusions about the actual performance of such protocols on the tested nodes. Finally, we investigate the tightness of this analysis using example cases in a numerical simulation.

DOI
10.15488/16429

Related papers

Certification of a functionality in a quantum network stage

Victoria Lipińska, Lê Phuc Thinh, Jérémy Ribeiro +1 more

Abstract We consider testing the ability of quantum network nodes to execute multi-round quantum protocols. Specifically, we examine protocols in which the nodes are capable of performing quantum gates, storing qubits and exchanging said qubits over the network a certain number of times. We propose a simple ping-pong test, which provides a certificate for the capability of the nodes to run certain multi-round protocols. We first show that in the noise-free regime the only way the nodes can pass the test is if they do indeed possess the desired capabilities. We then proceed to consider the case where operations are noisy, and provide an initial analysis showing how our test can be used to estimate parameters that allow us to draw conclusions about the actual performance of such protocols on the tested nodes. Finally, we investigate the tightness of this analysis using example cases in a numerical simulation.

arXiv:1910.10004•Quantum Science and Technology•Apr 23, 2020•1 citation

Secure Quantum Handshakes: Quantum Network Verification Via Simon's Algorithm

Reece Robertson, Sejal Patil, Sebastian Deffner

Quantum networking represents the future of secure communication, enabling fundamentally new capabilities through quantum information exchange. However, these networks require secure, high-fidelity quantum communication channels, and they require every participating node to be a genuine quantum device. Currently, there is no reliable method to verify whether clients entering a quantum network truly possess quantum computational capability and are connecting over robust channels. In this work, we introduce a client-validation protocol that functions as a proof-of-quantum-capability handshake. Our protocol secures a quantum network against classical spoofers, noisy quantum computers, and genuine quantum devices connecting with the network over noisy or insecure channels. We validate the efficacy of this protocol through numerical simulations under erasure, dephasing, and depolarizing noise models.

quant-pharXiv:2610.12209•Oct 9, 2026•0 citations

Multiplexed entanglement generation over quantum networks using multi-qubit nodes

Suzanne B. van Dam, Peter C Humphreys, Filip Rozpędek +2 more

Abstract Quantum networks distributed over distances greater than a few kilometres will be limited by the time required for information to propagate between nodes. We analyse protocols that are able to circumvent this bottleneck by employing multi-qubit nodes and multiplexing. For each protocol, we investigate the key network parameters that determine its performance. We model achievable entangling rates based on the anticipated near-term performance of nitrogen-vacancy centres and other promising network platforms. This analysis allows us to compare the potential of the proposed multiplexed protocols in different regimes. Moreover, by identifying the gains that may be achieved by improving particular network parameters, our analysis suggests the most promising avenues for research and development of prototype quantum networks.

arXiv:1702.04885•Quantum Science and Technology•Jun 20, 2017•54 citations

Noise inference by recycling test rounds in verification protocols

Amit Saha, Harold Ollivier

Abstract Interactive verification protocols for quantum computations allow to build trust between a client and a service provider, ensuring the former that the instructed computation was carried out faithfully. They come in two variants, one without quantum communication that requires large overhead on the server side to coherently implement quantum-resistant cryptographic primitives and one with quantum communication but with repetition as the only overhead on the service provider’s side. Given the limited number of available qubits on current machines, only quantum communication-based protocols have yielded proof of concepts. In this work, we show that part of the operational cost associated with the repetition required by protocols with quantum communication can be reduced from the service provider’s point of view. The test-round data collected for security can be reused, without introducing a separate family of calibration circuits, to monitor effective noise parameters of the implemented process. This reuse does not eliminate statistical sampling costs; additional test rounds may be required when verification alone does not provide enough samples for the desired estimation accuracy. Under an identifiable noise model and appropriate assumptions on state-preparation and measurement effects, the effective quantities can further be interpreted as gate-level parameters. This exemplifies the versatility of these protocols, whose template can serve multiple purposes, and strengthens the case for considering their early integration into quantum-machine development roadmaps.

Quantum Science and Technology•Aug 5, 2026•0 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•24 citations

Realization of a multi-node quantum network of remote solid-state qubits

Ronald Hanson

We report on the realization of a three-node entanglement-based quantum network. We combine remote quantum nodes based on diamond communication qubits into a scalable phase-stabilized architecture, supplemented with a robust memory qubit and local quantum logic. Also, we achieve real-time communication and feed-forward gate operations across the network. We demonstrate two key quantum network protocols without post-selection: the distribution of genuine multipartite entangled states across the three nodes and entanglement swapping through an intermediary node. Finally, we will discuss the most recent experiments using the network as a platform for exploring, testing, and developing multi-node quantum network protocols and a quantum network control stack.

Photonics for Quantum (PfQ)•Jul 12, 2021•0 citations
We consider testing the ability of quantum network nodes to execute multi-round quantum protocols. Specifically, we examine protocols in which the nodes are capable of performing quantum gates, storing qubits and exchanging said qubits over the network a certain number of times. We propose a simple ping-pong test, which provides a certificate for the capability of the nodes to run certain multi-round protocols. We first show that in the noise-free regime the only way the nodes can pass the test is if they do indeed possess the desired capabilities. We then proceed to consider the case where operations are noisy, and provide an initial analysis showing how our test can be used to estimate parameters that allow us to draw conclusions about the actual performance of such protocols on the tested nodes. Finally, we investigate the tightness of this analysis using example cases in a numerical simulation.
Abstract We consider testing the ability of quantum network nodes to execute multi-round quantum protocols. Specifically, we examine protocols in which the nodes are capable of performing quantum gates, storing qubits and exchanging said qubits over the network a certain number of times. We propose a simple ping-pong test, which provides a certificate for the capability of the nodes to run certain multi-round protocols. We first show that in the noise-free regime the only way the nodes can pass the test is if they do indeed possess the desired capabilities. We then proceed to consider the case where operations are noisy, and provide an initial analysis showing how our test can be used to estimate parameters that allow us to draw conclusions about the actual performance of such protocols on the tested nodes. Finally, we investigate the tightness of this analysis using example cases in a numerical simulation.
Quantum networking represents the future of secure communication, enabling fundamentally new capabilities through quantum information exchange. However, these networks require secure, high-fidelity quantum communication channels, and they require every participating node to be a genuine quantum device. Currently, there is no reliable method to verify whether clients entering a quantum network truly possess quantum computational capability and are connecting over robust channels. In this work, we introduce a client-validation protocol that functions as a proof-of-quantum-capability handshake. Our protocol secures a quantum network against classical spoofers, noisy quantum computers, and genuine quantum devices connecting with the network over noisy or insecure channels. We validate the efficacy of this protocol through numerical simulations under erasure, dephasing, and depolarizing noise models.
Abstract Quantum networks distributed over distances greater than a few kilometres will be limited by the time required for information to propagate between nodes. We analyse protocols that are able to circumvent this bottleneck by employing multi-qubit nodes and multiplexing. For each protocol, we investigate the key network parameters that determine its performance. We model achievable entangling rates based on the anticipated near-term performance of nitrogen-vacancy centres and other promising network platforms. This analysis allows us to compare the potential of the proposed multiplexed protocols in different regimes. Moreover, by identifying the gains that may be achieved by improving particular network parameters, our analysis suggests the most promising avenues for research and development of prototype quantum networks.
Abstract Interactive verification protocols for quantum computations allow to build trust between a client and a service provider, ensuring the former that the instructed computation was carried out faithfully. They come in two variants, one without quantum communication that requires large overhead on the server side to coherently implement quantum-resistant cryptographic primitives and one with quantum communication but with repetition as the only overhead on the service provider’s side. Given the limited number of available qubits on current machines, only quantum communication-based protocols have yielded proof of concepts. In this work, we show that part of the operational cost associated with the repetition required by protocols with quantum communication can be reduced from the service provider’s point of view. The test-round data collected for security can be reused, without introducing a separate family of calibration circuits, to monitor effective noise parameters of the implemented process. This reuse does not eliminate statistical sampling costs; additional test rounds may be required when verification alone does not provide enough samples for the desired estimation accuracy. Under an identifiable noise model and appropriate assumptions on state-preparation and measurement effects, the effective quantities can further be interpreted as gate-level parameters. This exemplifies the versatility of these protocols, whose template can serve multiple purposes, and strengthens the case for considering their early integration into quantum-machine development roadmaps.
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.
We report on the realization of a three-node entanglement-based quantum network. We combine remote quantum nodes based on diamond communication qubits into a scalable phase-stabilized architecture, supplemented with a robust memory qubit and local quantum logic. Also, we achieve real-time communication and feed-forward gate operations across the network. We demonstrate two key quantum network protocols without post-selection: the distribution of genuine multipartite entangled states across the three nodes and entanglement swapping through an intermediary node. Finally, we will discuss the most recent experiments using the network as a platform for exploring, testing, and developing multi-node quantum network protocols and a quantum network control stack.