Phase assumption-free multiparty quantum clock synchronization
Hatim A. Oujaa, Qiao Liu, Ebubechukwu O. Ilo-Okeke, Valentin Ivannikov, Jonathan P. Dowling, Tim Byrnes
TL;DR
This work tackles the challenge of establishing a universal clock across many parties without a shared phase reference, by developing a phase-assumption-free multiparty quantum clock synchronization protocol based on supersinglet states purified via LOCC. The central idea is to distribute a central time signal using a supersinglet that remains invariant under SU(2) and to remove phase offsets through entanglement purification, enabling deterministic timing information across all nodes with a signal that scales favorably with the number of parties. The authors derive explicit amplitudes for each party, demonstrate the optimality of the supersinglet over other spin-zero states, and quantify the timing error as a function of fidelity and shot noise, including realistic dephasing and potential residual phase effects. The proposed approach promises practical advantages over classical synchronization (e.g., TWSTFT) and is well-suited for long-distance operation and integration into a future quantum internet, provided reliable long-distance entanglement distribution and offline entanglement purification can be achieved. $\delta t \approx \frac{1}{\omega} \sqrt{ \frac{1}{2M} + 4(1 - F_{\text{super}}) }$ captures the core error scaling, with additional systematic and SQL contributions discussed.
Abstract
We investigate methods to broadcast timing information from a central clock to all other clocks by the use of multipartite entanglement. This task is a necessary step in establishing a coordinated universal time, currently performed using classical synchronization methods. Using an entanglement-based method has the advantage that the timing results are independent of the intervening medium. We generalize existing bipartite quantum clock synchronization methods and take special care to address issues of different phase conventions being adopted at each node (the ``Preskill phase problem''). Using supersinglet purification, we show that this allows for a scalable method with a time signal that is a constant with respect to the number of nodes.
