pith. sign in

arxiv: quant-ph/0005092 · v1 · submitted 2000-05-22 · 🪐 quant-ph

Quantum algorithm for distributed clock synchronization

classification 🪐 quant-ph
keywords clocksdeltaquantumalgorithmclockdeterminedigitsmessages
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.