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.
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 function depends on the system's ability to synchronise time. Time synchronisation is critical in the current communication network 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 synchronising clocks across different nodes. These network protocols are not 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 the 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×1015 signals per second. Further, we used the Allan deviation to examine the stability of our system for various noise strengths.
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.
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.
Multipartite quantum key distribution (QKD) is a promising area of quantum networks that provides unconditional secret keys among multiple parties, enabling only legitimate users to decrypt the encrypted message. However, security proofs of existing multipartite QKD typically assume perfect state preparation devices of legitimate users and neglect the relative rotation of reference frames. These presumptions are, nevertheless, very difficult to meet in practice, and thus the security of current multipartite QKD implementations is not guaranteed. By combining the idea of a loss tolerant technique, introduced by Tamaki et al. (K. Tamaki et al., Phys. Rev. A, 90, 052314, 2014), and the concept of a reference frame-independent protocol, we propose a three-party QKD protocol that considers state preparation flaws and the slow drift of reference frames. Through a numerical simulation, the influence of misaliged reference frames on the protocol’s stability was examined by drifting reference frames through angles β=π/5, β=π/6 and β=π/7. In addition, the performance of the proposed protocol was examined for the encoding flaws set at δ=0.35, δ=0.20, and δ=0.10. The results show that the protocol is robust against state preparation flaws, and is insignificantly impacted by misalignment of the reference frames because the achieved transmission distances and secret key rates are comparable to the perfect scenarios. This work dramatically contributes toward the realization of practical and secure multipartite QKD. The proposed protocol has direct applications in quantum communication network environments that involve unknown and slowly varying reference frames, web conferences, and online communications.
Synchronizing clocks using quantum entanglement works on the principle that two clocks Alice and Bob share between them a singlet state which is a stationary state that is immune to evolution under bare atomic Hamiltonian. A major obstacle to its realization is the hidden assumption of a common phase reference between the clocks. Without hidden assumption, a clock state of Alice or Bob is not a uniquely defined quantum state because the phase of the state is arbitrary. This results in an unknown relative phase in a two-particle entangled state defined by the clocks. We show that using entanglement purification, an entanglement-based clock synchronization is achieved despite earlier results showing the contrary. 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.