2001/03/28 by Chris Harrelson, Harrelson, Chris, Iordanis Kerenidis +1
Computer Science · Physics and Astronomy · #Computational Complexity (cs.CC) #F.2 #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #cs.CC #quant-ph
paper · pdf · doi:10.48550/arxiv.cs/0103021
LaTeX, 5 pages
openalex publication_date 2001/03/28 · arxiv created 2001/04/03 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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(2n) frequency range. We also prove a quantum lower bound of Ω(2n) for the product of the transmitted qubits and the range of frequencies, thus showing that our algorithm is optimal.