Quantum Clock Synchronization with a Single Qudit

Clock synchronization for nonfaulty processes in multiprocess networks is indispensable for a variety of technologies. A reliable system must be able to resynchronize the nonfaulty processes upon some components failing causing the distribution of incorrect or conflicting information in the network. The task of synchronizing such networks is related to Byzantine agreement (BA), which can classically be solved using recursive algorithms if and only if less than one-third of the processes are faulty. Here we introduce a nonrecursive quantum algorithm, based on a quantum solution of the detectable BA, which achieves clock synchronization in the presence of arbitrary many faulty processes by using only a single quantum system.

[1]  Nancy A. Lynch,et al.  An Overview of Clock Synchronization , 1986, Fault-Tolerant Distributed Computing.

[2]  Matthias Fitzi,et al.  Detectable byzantine agreement secure against faulty majorities , 2002, PODC '02.

[3]  Karl Svozil,et al.  Three criteria for quantum random-number generators based on beam splitters , 2009, 0903.2744.

[4]  Xiang Zhang,et al.  Experimental Certification of Random Numbers via Quantum Contextuality , 2013, Scientific Reports.

[5]  Wolfgang Tittel,et al.  Time-bin entangled qubits for quantum communication created by femtosecond pulses , 2002 .

[6]  W. J. Klepczynski,et al.  GPS: primary tool for time transfer , 1999, Proc. IEEE.

[7]  Christian Kurtsiefer,et al.  Experimental single qubit quantum secret sharing. , 2005, Physical review letters.

[8]  Qi Wang,et al.  Properties, and Applications , 2005 .

[9]  P. M. Melliar-Smith,et al.  Synchronizing clocks in the presence of faults , 1985, JACM.

[10]  M Fitzi,et al.  Quantum solution to the Byzantine agreement problem. , 2001, Physical review letters.

[11]  A. Cabello.  Solving the liar detection problem using the four-qubit singlet state , 2002, quant-ph/0210079.

[12]  Anders Karlsson,et al.  Security of quantum key distribution using d-level systems. , 2001, Physical review letters.

[13]  Christian Kurtsiefer,et al.  Experimental demonstration of a quantum protocol for byzantine agreement and liar detection. , 2007, Physical review letters.

[14]  Rafail Ostrovsky,et al.  Minimal Complete Primitives for Secure Multi-party Computation , 2001, CRYPTO.

[15]  S. Iblisdir,et al.  Byzantine Agreement with Two Quantum Key Distribution Setups , 2004, quant-ph/0405167.

[16]  Fabio Sciarrino,et al.  Hybrid ququart-encoded quantum cryptography protected by Kochen-Specker contextuality , 2011, 1109.2508.

[17]  Marek Zukowski,et al.  Experimental quantum communication complexity , 2005, quant-ph/0502066.

[18]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[19]  Marek Żukowski,et al.  Realizable higher-dimensional two-particle entanglements via multiport beam splitters , 1997 .

[20]  A. Cabello.  N-particle N-level singlet States: some properties and applications. , 2002, Physical review letters.