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

Chinese Physics B

Iterative quantum algorithm for distributed clock synchronization

Hong‐Fu Wang, Shou Zhang

Published Oct 1, 2012• 1 citation
Publisher

Abstract

Clock synchronization is a well-studied problem with many practical and scientific applications. We propose an arbitrary accuracy iterative quantum algorithm for distributed clock synchronization using only three qubits. The n bits of the time difference Δ between two spatially separated clocks can be deterministically extracted by communicating only O ( n ) messages and executing the quantum iteration process n times based on the classical feedback and measurement operations. Finally, we also give the algorithm using only two qubits and discuss the success probability of the algorithm.

DOI
10.1088/1674-1056/21/10/100309

Related papers

Iterative quantum algorithm for distributed clock synchronization

王洪福, 张寿

Clock synchronization is a well-studied problem with many practical and scientific applications.We propose an arbitrary accuracy iterative quantum algorithm for distributed clock synchronization using only three qubits.The n bits of the time difference between two spatially separated clocks can be deterministically extracted by communicating only O(n) messages and executing the quantum iteration process n times based on the classical feedback and measurement operations.Finally,we also give the algorithm using only two qubits and discuss the success probability of the algorithm.

中国物理B：英文版•Jan 1, 2012•0 citations

Quantum Algorithm for Distributed Clock Synchronization

Isaac L. Chuang

The clock synchronization problem is to determine the time difference Delta between two spatially separated clocks. When message delivery times between the two clocks are uncertain, O(2(2n)) classical messages must be exchanged between the clocks to determine n digits of Delta. On the other hand, as we show, there exists a quantum algorithm to obtain n digits of Delta while communicating only O(n) quantum messages.

arXiv:quant-ph/0005092•Physical Review Letters•Aug 28, 2000•140 citations

Quantum Clock Synchronization with one qubit

Chris Harrelson, Iordanis Kerenidis

The clock synchronization problem is to determine the time difference T between two spatially separated parties. We improve on I. Chuang's quantum clock synchronization algorithm and show that it is possible to obtain T to n bits of accuracy while communicating only one qubit in one direction and using an O(2^n) frequency range. We also prove a quantum lower bound of Ω(2^n) for the product of the transmitted qubits and the range of frequencies, thus showing that our algorithm is optimal.

arXiv:cs/0103021•Mar 28, 2001•2 citations

Qubit-Based Clock Synchronization for QKD Systems Using a Bayesian Approach

Roderick Cochran, Daniel J. Gauthier

Quantum key distribution (QKD) systems provide a method for two users to exchange a provably secure key. Synchronizing the users' clocks is an essential step before a secure key can be distilled. Qubit-based synchronization protocols directly use the transmitted quantum states to achieve synchronization and thus avoid the need for additional classical synchronization hardware. Previous qubit-based synchronization protocols sacrifice secure key either directly or indirectly, and all known qubit-based synchronization protocols do not efficiently use all publicly available information published by the users. Here, we introduce a Bayesian probabilistic algorithm that incorporates all published information to efficiently find the clock offset without sacrificing any secure key. Additionally, the output of the algorithm is a probability, which allows us to quantify our confidence in the synchronization. For demonstration purposes, we present a model system with accompanying simulations of an efficient three-state BB84 prepare-and-measure protocol with decoy states. We use our algorithm to exploit the correlations between Alice's published basis and mean photon number choices and Bob's measurement outcomes to probabilistically determine the most likely clock offset. We find that we can achieve a 95 percent synchronization confidence in only 4140 communication bin widths, meaning we can tolerate clock drift approaching 1 part in 4140 in this example when simulating this system with a dark count probability per communication bin width of 8×10-4 and a received mean photon number of 0.01.

arXiv:2107.01304•Entropy•Jul 30, 2021•27 citations

Implementation of Multiparty quantum clock synchronization

Xiangyu Kong, Xin, Tao, Shijie Wei +4 more

The quantum clock synchronization (QCS) is to measure the time difference among the spatially separated clocks with the principle of quantum mechanics. The first QCS algorithm proposed by Chuang and Jozsa is merely based on two parties, which is further extended and generalized to the multiparty situation by Krco and Paul. They present a multiparty QCS protocol based upon W states that utilizes shared prior entanglement and broadcast of classical information to synchronize spatially separated clocks. Shortly afterwards, Ben-Av and Exman came up with an optimized multiparty QCS using Z state. In this work, we firstly report an implementation of Krco and Ben-AV multiparty QCS algorithm using a four-qubit Nuclear Magnetic Resonance (NMR). The experimental results show a great agreement with the theory and also prove Ben-AV multiparty QCS algorithm more accurate than Krco.

arXiv:1708.06050•Aug 21, 2017•1 citation

Analytical Model of Clock Drift in Quantum Key Distribution and a Simple Synchronization Algorithm

Loïc Millet, Boris Korzh, Rob Thew +1 more

Clock synchronization is critical for maintaining low error rates in quantum key distribution. Here, we describe how a frequency mismatch between the transmitter and receiver clocks affects the quantum bit error rate in quantum key distribution, and derive from this model a simple synchronization algorithm together with clock stability requirements for practical operation. Our algorithm continuously compensates for both frequency mismatch and time-offset fluctuations directly from detection timestamps. It does not require a dedicated synchronization channel or auxiliary qubit sequence, converges from a large frequency mismatch within approximately one second of photon acquisition, and remains effective in low-photon-count regimes (more than 30 dB of channel loss) using standard hardware. We validate our approach by demonstrating successful key exchange over 100 km of fiber and continuous operation over 24 hours in a 16 km metropolitan network using commercial systems, with performance equivalent to using a service channel for clock synchronization.

quant-pharXiv:2605.26705•May 27, 2026•0 citations
Clock synchronization is a well-studied problem with many practical and scientific applications. We propose an arbitrary accuracy iterative quantum algorithm for distributed clock synchronization using only three qubits. The n bits of the time difference Δ between two spatially separated clocks can be deterministically extracted by communicating only O ( n ) messages and executing the quantum iteration process n times based on the classical feedback and measurement operations. Finally, we also give the algorithm using only two qubits and discuss the success probability of the algorithm.
Clock synchronization is a well-studied problem with many practical and scientific applications.We propose an arbitrary accuracy iterative quantum algorithm for distributed clock synchronization using only three qubits.The n bits of the time difference between two spatially separated clocks can be deterministically extracted by communicating only O(n) messages and executing the quantum iteration process n times based on the classical feedback and measurement operations.Finally,we also give the algorithm using only two qubits and discuss the success probability of the algorithm.
Quantum key distribution (QKD) systems provide a method for two users to exchange a provably secure key. Synchronizing the users' clocks is an essential step before a secure key can be distilled. Qubit-based synchronization protocols directly use the transmitted quantum states to achieve synchronization and thus avoid the need for additional classical synchronization hardware. Previous qubit-based synchronization protocols sacrifice secure key either directly or indirectly, and all known qubit-based synchronization protocols do not efficiently use all publicly available information published by the users. Here, we introduce a Bayesian probabilistic algorithm that incorporates all published information to efficiently find the clock offset without sacrificing any secure key. Additionally, the output of the algorithm is a probability, which allows us to quantify our confidence in the synchronization. For demonstration purposes, we present a model system with accompanying simulations of an efficient three-state BB84 prepare-and-measure protocol with decoy states. We use our algorithm to exploit the correlations between Alice's published basis and mean photon number choices and Bob's measurement outcomes to probabilistically determine the most likely clock offset. We find that we can achieve a 95 percent synchronization confidence in only 4140 communication bin widths, meaning we can tolerate clock drift approaching 1 part in 4140 in this example when simulating this system with a dark count probability per communication bin width of 8×10-4 and a received mean photon number of 0.01.
The quantum clock synchronization (QCS) is to measure the time difference among the spatially separated clocks with the principle of quantum mechanics. The first QCS algorithm proposed by Chuang and Jozsa is merely based on two parties, which is further extended and generalized to the multiparty situation by Krco and Paul. They present a multiparty QCS protocol based upon W states that utilizes shared prior entanglement and broadcast of classical information to synchronize spatially separated clocks. Shortly afterwards, Ben-Av and Exman came up with an optimized multiparty QCS using Z state. In this work, we firstly report an implementation of Krco and Ben-AV multiparty QCS algorithm using a four-qubit Nuclear Magnetic Resonance (NMR). The experimental results show a great agreement with the theory and also prove Ben-AV multiparty QCS algorithm more accurate than Krco.
Clock synchronization is critical for maintaining low error rates in quantum key distribution. Here, we describe how a frequency mismatch between the transmitter and receiver clocks affects the quantum bit error rate in quantum key distribution, and derive from this model a simple synchronization algorithm together with clock stability requirements for practical operation. Our algorithm continuously compensates for both frequency mismatch and time-offset fluctuations directly from detection timestamps. It does not require a dedicated synchronization channel or auxiliary qubit sequence, converges from a large frequency mismatch within approximately one second of photon acquisition, and remains effective in low-photon-count regimes (more than 30 dB of channel loss) using standard hardware. We validate our approach by demonstrating successful key exchange over 100 km of fiber and continuous operation over 24 hours in a 16 km metropolitan network using commercial systems, with performance equivalent to using a service channel for clock synchronization.