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

IEEE Globecom Workshops (GC Wkshps)

A Classical Network Protocol to Support Distributed Quantum State Tomography

Takafumi Oka, Takahiko Satoh, Rodney Van Meter

Published Dec 1, 2016• 9 citations
Publisher

Abstract

Quantum networking needs knowledge of the quality of a connection in order for quantum error correction to work. We are designing a classical network protocol to support quantum state analysis procedures such as tomography. This paper sketches the protocol as well as summarizes the fundamental scheme of two-node quantum communication using photons. Our protocol is a master-slave protocol. We show that we need around 2000-3000 (42000-60000) Bell pairs for tomography to achieve F > 0.99 (0.999). These stringent performance requirements result in long bootstrap times for individual network links, and suggest that tomography is inappropriate during the establishment of individual connections across a network.

DOI
10.1109/glocomw.2016.7848802

Related papers

Design and Evaluation of Communication Protocols for Quantum Repeater Networks

Luciano Aparicio

When built, quantum repeater networks will require classical network protocols to control the quantum operations. However, existing work on repeaters has focused on the quantum operations themselves, with less attention paid to the contents, semantics, ordering and reliability of the classical control messages. In this work we define and describe our implementation of the classical control protocols. The state machines and packet sequences for the three protocol layers are presented, and operation confirmed by running the protocols over simulations of the physical network. We also show that proper management of the resources in a bottleneck link allows the aggregate throughput of two end-to-end flows to substantially exceed that of a single flow. Our layered architectural framework will support independent evolution of the separate protocol layers. Networks of quantum repeaters utilize three concepts to execute a distributed algorithm that creates entangled quantum states between nodes that are far apart: a basic entanglement mechanism which depends on the physical implementation, error management (in this work, we study a method known as purification), and finally a quantum state propagation layer (here we implement entanglement swapping, which builds multi-hop connections from single-hop connections). Some researchers are investigating approaches that are substantially different from entanglement swapping [30, 24, 19]. Here we focus on swapping, but the layered architecture approach is broadly applicable, allowing other implementations to replace only a single layer in the protocol stack. Previous work primarily focused on the physical and mathematical tools for building repeaters. Classical information is also needed to enable teleportation and swapping, as many quantum operations are not deterministic, and results of quantum measurements need to be reported to distant partners before further operations can proceed. Also, operations in the middle of the network must be coordinated to route and swap properly. This requires classical messages to make operations robust, but message propagation times penalize performance. Even though this delay is usually included in repeater simulations, prior work has not defined the protocols in detail, especially with respect to how all of the nodes make consistent decisions in a timely fashion. In this work, we introduce a protocol stack for networks of quantum repeaters that considers all the necessary classical messages and which can be easily adapted for different approaches at all three protocol layers. We run simulations of competing flows on a dumbbell topology in order to increase our confidence in the behavior of our network protocols. By adjusting the fidelity thresholds required for entanglement swapping, we show that some configurations boost the aggregate throughput for multiple flows significantly above the maximum for a single flow, taking advantage of resources that would otherwise sit idle. The operation of such complex networks and such delicate tuning of the system without formal protocol definitions would not be possible. Previous work has also concentrated almost exclusively on the dedicated use of a single line or chain of repeaters, delivering Bell pairs only to the two nodes at the ends of the chain. Networks, however, typically have more than two end points, and allow any pair of these end nodes to communicate. More topologically complex networks, with numerous end nodes, are obviously much more scalable than connecting every possible pair of nodes using a dedicated line of repeaters. we investigate how classical multiplexing schemes translate to the domain of quantum repeaters, in order to manage shared resources and active communication flows of data from different stations. We simulate four sharing protocols in a complex network with competing traffic. Circuit switching gives any individual flow the best performance, but makes poor use of the overall network and is inflexible. We use circuit switching as our baseline case to compare time division multiplexing, buffer space multiplexing, and statistical multiplexing, and show that all multiplexing schemes are better than circuit switching. For the particular network simulated, we find that statistical multiplexing outperforms time division multiplexing by 28% and buffer space multiplexing by 13%. We find that all three multiplexing schemes are fair; each flow is penalized a similar percentage of its throughput as the the total number of users in the network increases. Finally, statistical multiplexing requires no network-wide coordination of the use of quantum memory or channels, and is easier to implement than a robust, scalable scheme for the other protocols. Our current results suggest that the best strategy for quantum repeater networks is statistical multiplexing. (This is in fact the quantum analogue of the basis on which the Internet works.) However, our current simulations are done with no degradation of memory over time, using the assumption of quantum error-corrected memory at each repeater; inclusion of decoherence and a finite qubit lifetime remains as future work.

•Sep 27, 2011•2 citations

Rigorous quantum state tomography for distributed quantum computing

Hans Mättig-Vásquez, Aldo Delgado, Luciano Pereira

Distributed quantum computing offers a promising approach to scaling quantum devices by networking multiple quantum processors. We present a quantum state tomography protocol tailored for distributed quantum computers that avoids assuming remote entanglement as a primitive resource. The protocol extends projected least-squares (PLS) tomography based on projective 2-designs to systems composed of multiple quantum processors, using only local operations within each processor and classical communication between nodes. Assuming entanglement within each individual quantum processor is trusted, the protocol can be executed using mutually unbiased bases. We derive rigorous, non-asymptotic trace-norm error bounds for the PLS estimator, with explicit exponential dependence on the number of nodes. In addition, we establish certified error bounds for estimating entanglement negativity from the PLS estimator. Numerical simulations for systems of up to seven qubits distributed across several devices validate the theoretical error bounds.

quant-pharXiv:2604.09775•Apr 14, 2026•0 citations

Entanglement assisted quantum communication protocols

Amélie Piveteau

Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.

•Jan 1, 2026•0 citations

Quantum Networking Protocol Based on Quantum Teleportation

Jincheng Zhang

This paper proposes a novel quantum networking protocol leveraging quantum teleportation for rapid quantum information transfer within a network. Traditional quantum network architectures suffer from limited transmission speeds due to the requirement of physically transporting qubits. This protocol overcomes this limitation by utilizing the quantum entanglement and Bell states to facilitate instantaneous information transfer, circumventing the need for direct qubit conveyance. The core of the protocol relies on establishing and maintaining entanglement between nodes, followed by a Bell state measurement and classical communication to reconstruct the quantum state at the destination. This design offers a significantly faster method for quantum information distribution compared to conventional approaches. The theoretical framework is presented with detailed mathematical formulations of the key steps, including the Bell state measurement, the process of quantum state transfer, and the necessary classical communication protocols. This work contributes to the advancement of quantum networking technology and provides a foundation for future high-speed quantum communication systems.

•Aug 28, 2026•0 citations

Reliable Quantum Links: Entanglement, Error Correction, and Classical Communication

Mahmoud Saad Abouamer, Jaemin Kim, Jaron Skovsted Gundersen +5 more

This paper is a tutorial-style introduction to methods and protocols for reliable transmission of quantum information over noisy quantum links. The exposition is based on a design philosophy that parallels classical link-layer mechanisms such as forward error correction and Automatic Repeat reQuest (ARQ). It starts by drawing analogies and highlights differences between classical and quantum links. Such analogies are used as guiding principles, with explicit attention to where the classical correspondence no longer applies and where non-classical constraints and resources govern the protocol design. The emphasis is on the fact that classical reliability is achieved through fungible and cloneable bits, whereas unknown quantum states cannot be copied or freely retransmitted. In addition, quantum information is subject to stringent physical constraints due to decoherence as well as the need for transduction between stationary and flying qubits. Quantum error correction is presented as the analogue of classical forward error correction, where logical qubits are protected by encoding them into larger entangled code spaces and using syndrome measurements to infer and correct errors without collapsing the encoded state. It then introduces teleportation-based link abstractions, in which transmission of an unknown qubit is realized by consuming shared Bell pairs together with classical messages. Entanglement purification protocols play a role similar to ARQ-style reliability enhancement by converting many noisy entangled pairs into fewer, higher-fidelity pairs at the cost of additional resources. The paper is written from the perspective of classical communication engineering and is intended as a guide for translating the relevant ideas toward reliable quantum links and networks.

IEEE Open Journal of the Communications Society•Jan 1, 2026•0 citations

Trade-off between Fidelity and Latency for Entanglement Routing Design in Quantum Networks

Thu Trang NGUYEN

Quantum networks intersect a paradigmatic shift in communication technologies, offering unprecedented capabilities for secure communication and distributed computation through the exploitation of quantum mechanical phenomena.These networks facilitate revolutionary and unlimited of possibility applications such as quantum key distribution (QKD), distributed quantum computing (DQC), quantum teleportation (QT), quantum clock synchronization (QCS), etc. -all fundamentally predicated on quantum entanglement as their operational cornerstone.Moreover, on the contrary with classical computer communication protocol, quantum networks have the fundamental no-cloning theorem in the quantum mechanic prohibits conventional signal amplification techniques, necessitating the development of quantum-native routing strategies that operate within these unique constraints.However, the practical realization of quantum networks until now still faces a crucial challenge: The reliability and efficient distribution of highfidelity entangled quantum states across long distances.Due to this distribution, the process faces intrinsic limitations arising from quantum decoherence, photonic loss in transmission channels, and the inherently probabilistic nature of entanglement generation protocols.In quantum communication, fidelity serves as a fundamental metric, representing the degree of similarity or correlation between the actual distributed entangled state and an ideal maximally entangled Bell pair.Fidelity is a crucial measure of the quality of quantum states in a network since it directly affects the reliability and effectiveness of quantum communication protocols.High fidelity ensures that the transmitted entangled states maintain their quantum properties, closely resembling the ideal Bell pair, and are thus suitable for performing secure and efficient quantum operations.Latency, on the other hand, refers to the total time delay involved in the entire process of entanglement establishment, from the initial creation of the entangled pairs to the final verification and confirmation of the entanglement quality.This includes several distinct components: the physical propagation delay, which accounts for the time it takes for quantum information to travel through the communication channel (such as optical fibers); the entanglement generation time, which involves the probabilistic creation of entangled states between quantum nodes; and the quantum memory storage time, which reflects the duration for which quantum states I

•Sep 1, 2025•0 citations
Quantum networking needs knowledge of the quality of a connection in order for quantum error correction to work. We are designing a classical network protocol to support quantum state analysis procedures such as tomography. This paper sketches the protocol as well as summarizes the fundamental scheme of two-node quantum communication using photons. Our protocol is a master-slave protocol. We show that we need around 2000-3000 (42000-60000) Bell pairs for tomography to achieve F > 0.99 (0.999). These stringent performance requirements result in long bootstrap times for individual network links, and suggest that tomography is inappropriate during the establishment of individual connections across a network.
When built, quantum repeater networks will require classical network protocols to control the quantum operations. However, existing work on repeaters has focused on the quantum operations themselves, with less attention paid to the contents, semantics, ordering and reliability of the classical control messages. In this work we define and describe our implementation of the classical control protocols. The state machines and packet sequences for the three protocol layers are presented, and operation confirmed by running the protocols over simulations of the physical network. We also show that proper management of the resources in a bottleneck link allows the aggregate throughput of two end-to-end flows to substantially exceed that of a single flow. Our layered architectural framework will support independent evolution of the separate protocol layers. Networks of quantum repeaters utilize three concepts to execute a distributed algorithm that creates entangled quantum states between nodes that are far apart: a basic entanglement mechanism which depends on the physical implementation, error management (in this work, we study a method known as purification), and finally a quantum state propagation layer (here we implement entanglement swapping, which builds multi-hop connections from single-hop connections). Some researchers are investigating approaches that are substantially different from entanglement swapping [30, 24, 19]. Here we focus on swapping, but the layered architecture approach is broadly applicable, allowing other implementations to replace only a single layer in the protocol stack. Previous work primarily focused on the physical and mathematical tools for building repeaters. Classical information is also needed to enable teleportation and swapping, as many quantum operations are not deterministic, and results of quantum measurements need to be reported to distant partners before further operations can proceed. Also, operations in the middle of the network must be coordinated to route and swap properly. This requires classical messages to make operations robust, but message propagation times penalize performance. Even though this delay is usually included in repeater simulations, prior work has not defined the protocols in detail, especially with respect to how all of the nodes make consistent decisions in a timely fashion. In this work, we introduce a protocol stack for networks of quantum repeaters that considers all the necessary classical messages and which can be easily adapted for different approaches at all three protocol layers. We run simulations of competing flows on a dumbbell topology in order to increase our confidence in the behavior of our network protocols. By adjusting the fidelity thresholds required for entanglement swapping, we show that some configurations boost the aggregate throughput for multiple flows significantly above the maximum for a single flow, taking advantage of resources that would otherwise sit idle. The operation of such complex networks and such delicate tuning of the system without formal protocol definitions would not be possible. Previous work has also concentrated almost exclusively on the dedicated use of a single line or chain of repeaters, delivering Bell pairs only to the two nodes at the ends of the chain. Networks, however, typically have more than two end points, and allow any pair of these end nodes to communicate. More topologically complex networks, with numerous end nodes, are obviously much more scalable than connecting every possible pair of nodes using a dedicated line of repeaters. we investigate how classical multiplexing schemes translate to the domain of quantum repeaters, in order to manage shared resources and active communication flows of data from different stations. We simulate four sharing protocols in a complex network with competing traffic. Circuit switching gives any individual flow the best performance, but makes poor use of the overall network and is inflexible. We use circuit switching as our baseline case to compare time division multiplexing, buffer space multiplexing, and statistical multiplexing, and show that all multiplexing schemes are better than circuit switching. For the particular network simulated, we find that statistical multiplexing outperforms time division multiplexing by 28% and buffer space multiplexing by 13%. We find that all three multiplexing schemes are fair; each flow is penalized a similar percentage of its throughput as the the total number of users in the network increases. Finally, statistical multiplexing requires no network-wide coordination of the use of quantum memory or channels, and is easier to implement than a robust, scalable scheme for the other protocols. Our current results suggest that the best strategy for quantum repeater networks is statistical multiplexing. (This is in fact the quantum analogue of the basis on which the Internet works.) However, our current simulations are done with no degradation of memory over time, using the assumption of quantum error-corrected memory at each repeater; inclusion of decoherence and a finite qubit lifetime remains as future work.
Distributed quantum computing offers a promising approach to scaling quantum devices by networking multiple quantum processors. We present a quantum state tomography protocol tailored for distributed quantum computers that avoids assuming remote entanglement as a primitive resource. The protocol extends projected least-squares (PLS) tomography based on projective 2-designs to systems composed of multiple quantum processors, using only local operations within each processor and classical communication between nodes. Assuming entanglement within each individual quantum processor is trusted, the protocol can be executed using mutually unbiased bases. We derive rigorous, non-asymptotic trace-norm error bounds for the PLS estimator, with explicit exponential dependence on the number of nodes. In addition, we establish certified error bounds for estimating entanglement negativity from the PLS estimator. Numerical simulations for systems of up to seven qubits distributed across several devices validate the theoretical error bounds.
Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.
This paper proposes a novel quantum networking protocol leveraging quantum teleportation for rapid quantum information transfer within a network. Traditional quantum network architectures suffer from limited transmission speeds due to the requirement of physically transporting qubits. This protocol overcomes this limitation by utilizing the quantum entanglement and Bell states to facilitate instantaneous information transfer, circumventing the need for direct qubit conveyance. The core of the protocol relies on establishing and maintaining entanglement between nodes, followed by a Bell state measurement and classical communication to reconstruct the quantum state at the destination. This design offers a significantly faster method for quantum information distribution compared to conventional approaches. The theoretical framework is presented with detailed mathematical formulations of the key steps, including the Bell state measurement, the process of quantum state transfer, and the necessary classical communication protocols. This work contributes to the advancement of quantum networking technology and provides a foundation for future high-speed quantum communication systems.
This paper is a tutorial-style introduction to methods and protocols for reliable transmission of quantum information over noisy quantum links. The exposition is based on a design philosophy that parallels classical link-layer mechanisms such as forward error correction and Automatic Repeat reQuest (ARQ). It starts by drawing analogies and highlights differences between classical and quantum links. Such analogies are used as guiding principles, with explicit attention to where the classical correspondence no longer applies and where non-classical constraints and resources govern the protocol design. The emphasis is on the fact that classical reliability is achieved through fungible and cloneable bits, whereas unknown quantum states cannot be copied or freely retransmitted. In addition, quantum information is subject to stringent physical constraints due to decoherence as well as the need for transduction between stationary and flying qubits. Quantum error correction is presented as the analogue of classical forward error correction, where logical qubits are protected by encoding them into larger entangled code spaces and using syndrome measurements to infer and correct errors without collapsing the encoded state. It then introduces teleportation-based link abstractions, in which transmission of an unknown qubit is realized by consuming shared Bell pairs together with classical messages. Entanglement purification protocols play a role similar to ARQ-style reliability enhancement by converting many noisy entangled pairs into fewer, higher-fidelity pairs at the cost of additional resources. The paper is written from the perspective of classical communication engineering and is intended as a guide for translating the relevant ideas toward reliable quantum links and networks.
Quantum networks intersect a paradigmatic shift in communication technologies, offering unprecedented capabilities for secure communication and distributed computation through the exploitation of quantum mechanical phenomena.These networks facilitate revolutionary and unlimited of possibility applications such as quantum key distribution (QKD), distributed quantum computing (DQC), quantum teleportation (QT), quantum clock synchronization (QCS), etc. -all fundamentally predicated on quantum entanglement as their operational cornerstone.Moreover, on the contrary with classical computer communication protocol, quantum networks have the fundamental no-cloning theorem in the quantum mechanic prohibits conventional signal amplification techniques, necessitating the development of quantum-native routing strategies that operate within these unique constraints.However, the practical realization of quantum networks until now still faces a crucial challenge: The reliability and efficient distribution of highfidelity entangled quantum states across long distances.Due to this distribution, the process faces intrinsic limitations arising from quantum decoherence, photonic loss in transmission channels, and the inherently probabilistic nature of entanglement generation protocols.In quantum communication, fidelity serves as a fundamental metric, representing the degree of similarity or correlation between the actual distributed entangled state and an ideal maximally entangled Bell pair.Fidelity is a crucial measure of the quality of quantum states in a network since it directly affects the reliability and effectiveness of quantum communication protocols.High fidelity ensures that the transmitted entangled states maintain their quantum properties, closely resembling the ideal Bell pair, and are thus suitable for performing secure and efficient quantum operations.Latency, on the other hand, refers to the total time delay involved in the entire process of entanglement establishment, from the initial creation of the entangled pairs to the final verification and confirmation of the entanglement quality.This includes several distinct components: the physical propagation delay, which accounts for the time it takes for quantum information to travel through the communication channel (such as optical fibers); the entanglement generation time, which involves the probabilistic creation of entangled states between quantum nodes; and the quantum memory storage time, which reflects the duration for which quantum states I