Year: 2015
Type: preprint
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 detectable Byzantine agreement (DBA), 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 that solves the DBA and achieves clock synchronization in the presence of arbitrary many faulty processes by using only a single quantum system.
Source: arXiv (Cornell University)
Institutions: Stockholm University, Universidad de Sevilla, University of Gdańsk
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G2126527336, G3224755499
OpenAlex ID: W2949377017
