Quantum Clock Synchronization with one qubit
| dc.creator | Harrelson, Chris | |
| dc.creator | Kerenidis, Iordanis | |
| dc.date | 2001-03-28 | |
| dc.date | 2001-04-03 | |
| dc.date.accessioned | 2026-07-25T16:29:20Z | |
| dc.description | 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. | |
| dc.description | LaTeX, 5 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0103021 | |
| dc.identifier | http://arxiv.org/abs/cs/0103021 | |
| dc.identifier.uri | https://dspace.dare.co.zw/handle/123456789/41776 | |
| dc.subject | Computational Complexity | |
| dc.subject | Quantum Physics | |
| dc.subject | F.2 | |
| dc.title | Quantum Clock Synchronization with one qubit | |
| dc.type | text |