Quantum algorithm for distributed clock synchronization
arXiv:quant-ph/0005092 · doi:10.1103/PhysRevLett.85.2006
Abstract
The clock synchronization problem is to determine the time difference $Î$ 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 $Î$. On the other hand, as we show, there exists a quantum algorithm to obtain $n$ digits of $Î$ while communicating only O(n) quantum messages.
4 pages, one figure