Abstract
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.
Highlights
Clock synchronization for nonfaulty processes in multiprocess networks is indispensable for a variety of technologies
We introduce a quantum algorithm that solves the detectable Byzantine agreement (DBA) and achieves clock synchronization in the presence of an arbitrary number of faulty processes, with only one single round of message passing per process independently of the number of faulty processes, utilizing only a single quantum system
We have presented a single-qudit protocol which provides an efficient solution to an important multiparty communication problem: It solves DBA and achieves clock synchronization in the presence of arbitrary many faulty clocks
Summary
Clock synchronization for nonfaulty processes in multiprocess networks is indispensable for a variety of technologies. 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. Unless the synchronization algorithm is very fast, this will cause problems This motivates our last assumption: A3) A nonfaulty process can read the time difference between the clock of another process and its own. We introduce a quantum algorithm that solves the DBA and achieves clock synchronization in the presence of an arbitrary number of faulty processes, with only one single round of message passing per process independently of the number of faulty processes, utilizing only a single quantum system. We achieve clock synchronization by running the algorithm OM(1) m times, sending clock differences instead of the binary values, and analogously for OM(n)[4]. Since QB(n, m) is ran m times, Pz will obtain Dyz from Py and Pz knows that Py is claiming that the time difference between Px and Pz is Dxy 1 Dyz, which can be compared to Dxz obtained directly from Px
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
