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:1505.02565 · New Journal of Physics

Asynchronous reference frame agreement in a quantum network

Tanvirul Islam, Stephanie Wehner

Published Mar 10, 2016• 4 citations
arXivHTMLPDF

Abstract

An efficient implementation of many multiparty protocols for quantum networks requires that all the nodes in the network share a common reference frame. Establishing such a reference frame from scratch is especially challenging in an asynchronous network where network links might have arbitrary delays and the nodes do not share synchronised clocks. In this work, we study the problem of establishing a common reference frame in an asynchronous network of n nodes of which at most t are affected by arbitrary unknown error, and the identities of the faulty nodes are not known. We present a protocol that allows all the correctly functioning nodes to agree on a common reference frame as long as the network graph is complete and not more than nodes are faulty. As the protocol is asynchronous, it can be used with some assumptions to synchronise clocks over a network. Also, the protocol has the appealing property that it allows any existing two-node asynchronous protocol for reference frame agreement to be lifted to a robust protocol for an asynchronous quantum network.

DOI
10.1088/1367-2630/18/3/033018

Related papers

Spatial reference frame agreement in quantum networks

Tanvirul Islam, Loïck Magnin, Brandon Sorg +1 more

In order to communicate information in a quantum network effectively, all network nodes should share a common reference frame. Here, we propose to study how well m nodes in a quantum network can establish a common spatial reference frame from scratch, even though t of them may be arbitrarily faulty. We present a protocol that allows all correctly functioning nodes to agree on a common reference frame as long as they are fully connected and not more than nodes are faulty. Our protocol furthermore has the appealing property that it allows any existing two-node protocol for reference frame agreement to be lifted to a protocol for a quantum network.

arXiv:1306.5295•New Journal of Physics•Jun 17, 2014•8 citations

Quantum enhanced time synchronisation for communication network

Swaraj Shekhar Nande, Marius Paul, Stefan Senk +4 more

It is essential to establish precise times in future communication networks. Any real-time task’s ability to function depends on the system’s ability to synchronise time. In the current communication network, time synchronisation is critical and must be maintained to transmit data packets. The functionality of 6G, the Tactile Internet, Time-Sensitive Networking, and ultra-reliable low-latency communications is highly susceptible to time synchronisation . We investigated the idea of employing time synchronisation across different communication network nodes. The current state-of-the-art employs network protocols like Precision Time Protocol for clock synchronisation across different nodes. These network protocols are not very robust and can generate jitters in data transmission . In this paper, we suggested synchronising the time of the node clocks at three different places using quantum technology . Notably, the oscillation frequencies of each qubit (or oscillator) located at these nodes can be synchronised using quantum synchronisation technique. This set of three oscillators will work as a single clock and will be the master clock of the network. We propose distributing precise time and frequency standards using quantum synchronisation on node clocks. We can synchronise the three qubits (each placed at one node) to oscillate at an identical frequency by applying an external field of a wavelength of 813 . 32 nm . We analysed our model for different coupling constants and dissipation rates to provide an analysis of the behaviour of the amount of synchronisation in different experimental configurations. The optimal accuracy for our system is 1 . 6 × 1 0 15 signals per second. Further, we used the Allan deviation to examine the stability of our system for various noise strengths.

Computer Networks•Apr 23, 2023•30 citations

Wireless key establishment with asynchronous clocks

Kaihe Xu, Qian Wang, Kui Ren

Recently, there has been great research interest in utilizing the phase response of multipath fading channels as sources of common randomness to achieve information-theoretic key establishment. Previous work along this direction assume a common time reference is shared among the keying nodes such that each node can obtain absolute phase estimations. However, such assumption is impractical in some scenarios where common time reference is not available. Without the common time reference, each keying node in the system has to estimate the channel phase based on its own independent and imperfect local clock, resulting in a phase offset between its local estimates and the absolute estimates. In this paper, we study the effect of clock deviations among keying nodes and propose a novel key generation protocol with asynchronous clocks among the keying nodes. Our contributions include: 1) Mitigate the reliance on common time reference to get a desired key agreement probability; 2) Improve the key generation rate by utilizing additional randomness provided by the relay nodes. Numerical and simulation results show that a desired estimation accuracy and key generation rate could be achieved with the help of a rely node.

IEEE Military Communications Conference (MILCOM)•Nov 1, 2011•1 citation

Efficient Quantum Network Synchronization via LOCC

Ufuk Keskin, Stefano Maranò, Andrea Conti +3 more

This paper investigates quantum network synchronization (QNS) procedures that enable all nodes of a network to synchronize to a common clock with full cooperation and local operations and classical communication (LOCC). The state-of-the-art procedure previously proposed in the literature, referred to as the standard QNS procedure, suffers from sign ambiguity in multi-parameter estimation and requires a number of qubits per node that grows exponentially with the network size. To overcome these limitations, a new procedure is proposed, referred to as the efficient QNS procedure that uses Hadamard matrices and requires a number of qubits per node that grows linearly with the network size. A tactical measurement-time delay is introduced to eliminate sign ambiguity. Results demonstrate that the efficient QNS procedure significantly improves synchronization accuracy over the standard QNS procedure.

International Conference on Communications•May 24, 2026•0 citations

A Compact Framework for Analyzing Asynchronous Entanglement Distribution in Quantum Networks

Hughes, Emma, William Munizzi, Prineha Narang

This work introduces a compact framework for analyzing asynchronous entanglement distribution protocols under realistic error models. We focus on two contemporary protocols: sequential, where entanglement is established one node at a time, and parallel, where all nodes attempt to generate entanglement simultaneously. We derive an analytical expression for the fidelity of distributed entangled states, showing that the fidelity depends only on the total time all qubits spend in memory, rather than the individual memory times for each qubit. This result distills the complex dynamics of entanglement distribution into a compact accessible form, providing an scalable tool for evaluating protocol efficiency. Using this lightweight framework, we analyze the performance of parallel and sequential protocols, demonstrating that parallel distribution consistently outperforms sequential and highlighting the potential of parallel protocols for practical quantum network implementations.

arXiv:2507.22992•Jul 30, 2025•3 citations

Remote quantum clock synchronization without synchronized clocks

Ebubechukwu O. Ilo-Okeke, Louis Tessler, Jonathan P. Dowling +1 more

Abstract A major outstanding problem for many quantum clock synchronization protocols is the hidden assumption of a common phase reference between the parties to be synchronized. In general, the definition of the quantum states between two parties do not have consistent phase definitions, which can lead to an unknown systematic error. We show that despite prior arguments to the contrary, it is possible to remove this unknown phase via entanglement purification. This closes the loophole for entanglement based quantum clock synchronization protocols, which is a non-local approach to synchronize two clocks independent of the properties of the intervening medium. Starting with noisy Bell pairs, we show that the scheme produces a singlet state for any combination of (i) differing basis conventions for Alice and Bob; (ii) an overall time offset in the execution of the purification algorithm; and (iii) the presence of a noisy channel. Error estimates reveal that better performance than existing classical Einstein synchronization protocols should be achievable using current technology.

arXiv:1709.08423•npj Quantum Information•Aug 9, 2018•88 citations
An efficient implementation of many multiparty protocols for quantum networks requires that all the nodes in the network share a common reference frame. Establishing such a reference frame from scratch is especially challenging in an asynchronous network where network links might have arbitrary delays and the nodes do not share synchronised clocks. In this work, we study the problem of establishing a common reference frame in an asynchronous network of n nodes of which at most t are affected by arbitrary unknown error, and the identities of the faulty nodes are not known. We present a protocol that allows all the correctly functioning nodes to agree on a common reference frame as long as the network graph is complete and not more than nodes are faulty. As the protocol is asynchronous, it can be used with some assumptions to synchronise clocks over a network. Also, the protocol has the appealing property that it allows any existing two-node asynchronous protocol for reference frame agreement to be lifted to a robust protocol for an asynchronous quantum network.
In order to communicate information in a quantum network effectively, all network nodes should share a common reference frame. Here, we propose to study how well m nodes in a quantum network can establish a common spatial reference frame from scratch, even though t of them may be arbitrarily faulty. We present a protocol that allows all correctly functioning nodes to agree on a common reference frame as long as they are fully connected and not more than nodes are faulty. Our protocol furthermore has the appealing property that it allows any existing two-node protocol for reference frame agreement to be lifted to a protocol for a quantum network.
It is essential to establish precise times in future communication networks. Any real-time task’s ability to function depends on the system’s ability to synchronise time. In the current communication network, time synchronisation is critical and must be maintained to transmit data packets. The functionality of 6G, the Tactile Internet, Time-Sensitive Networking, and ultra-reliable low-latency communications is highly susceptible to time synchronisation . We investigated the idea of employing time synchronisation across different communication network nodes. The current state-of-the-art employs network protocols like Precision Time Protocol for clock synchronisation across different nodes. These network protocols are not very robust and can generate jitters in data transmission . In this paper, we suggested synchronising the time of the node clocks at three different places using quantum technology . Notably, the oscillation frequencies of each qubit (or oscillator) located at these nodes can be synchronised using quantum synchronisation technique. This set of three oscillators will work as a single clock and will be the master clock of the network. We propose distributing precise time and frequency standards using quantum synchronisation on node clocks. We can synchronise the three qubits (each placed at one node) to oscillate at an identical frequency by applying an external field of a wavelength of 813 . 32 nm . We analysed our model for different coupling constants and dissipation rates to provide an analysis of the behaviour of the amount of synchronisation in different experimental configurations. The optimal accuracy for our system is 1 . 6 × 1 0 15 signals per second. Further, we used the Allan deviation to examine the stability of our system for various noise strengths.
Recently, there has been great research interest in utilizing the phase response of multipath fading channels as sources of common randomness to achieve information-theoretic key establishment. Previous work along this direction assume a common time reference is shared among the keying nodes such that each node can obtain absolute phase estimations. However, such assumption is impractical in some scenarios where common time reference is not available. Without the common time reference, each keying node in the system has to estimate the channel phase based on its own independent and imperfect local clock, resulting in a phase offset between its local estimates and the absolute estimates. In this paper, we study the effect of clock deviations among keying nodes and propose a novel key generation protocol with asynchronous clocks among the keying nodes. Our contributions include: 1) Mitigate the reliance on common time reference to get a desired key agreement probability; 2) Improve the key generation rate by utilizing additional randomness provided by the relay nodes. Numerical and simulation results show that a desired estimation accuracy and key generation rate could be achieved with the help of a rely node.
This paper investigates quantum network synchronization (QNS) procedures that enable all nodes of a network to synchronize to a common clock with full cooperation and local operations and classical communication (LOCC). The state-of-the-art procedure previously proposed in the literature, referred to as the standard QNS procedure, suffers from sign ambiguity in multi-parameter estimation and requires a number of qubits per node that grows exponentially with the network size. To overcome these limitations, a new procedure is proposed, referred to as the efficient QNS procedure that uses Hadamard matrices and requires a number of qubits per node that grows linearly with the network size. A tactical measurement-time delay is introduced to eliminate sign ambiguity. Results demonstrate that the efficient QNS procedure significantly improves synchronization accuracy over the standard QNS procedure.
This work introduces a compact framework for analyzing asynchronous entanglement distribution protocols under realistic error models. We focus on two contemporary protocols: sequential, where entanglement is established one node at a time, and parallel, where all nodes attempt to generate entanglement simultaneously. We derive an analytical expression for the fidelity of distributed entangled states, showing that the fidelity depends only on the total time all qubits spend in memory, rather than the individual memory times for each qubit. This result distills the complex dynamics of entanglement distribution into a compact accessible form, providing an scalable tool for evaluating protocol efficiency. Using this lightweight framework, we analyze the performance of parallel and sequential protocols, demonstrating that parallel distribution consistently outperforms sequential and highlighting the potential of parallel protocols for practical quantum network implementations.
Abstract A major outstanding problem for many quantum clock synchronization protocols is the hidden assumption of a common phase reference between the parties to be synchronized. In general, the definition of the quantum states between two parties do not have consistent phase definitions, which can lead to an unknown systematic error. We show that despite prior arguments to the contrary, it is possible to remove this unknown phase via entanglement purification. This closes the loophole for entanglement based quantum clock synchronization protocols, which is a non-local approach to synchronize two clocks independent of the properties of the intervening medium. Starting with noisy Bell pairs, we show that the scheme produces a singlet state for any combination of (i) differing basis conventions for Alice and Bob; (ii) an overall time offset in the execution of the purification algorithm; and (iii) the presence of a noisy channel. Error estimates reveal that better performance than existing classical Einstein synchronization protocols should be achievable using current technology.