Scalable quantum consensus for crash failures

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations


We present a scalable quantum algorithm to solve binary consensus in a system of n crash-prone quantum processes. The algorithm works in O(polylog n) time sending O(n polylog n) qubits against the adaptive adversary. The time performance of this algorithm is asymptotically better than a lower bound Ω(√n/log n) on time of classical randomized algorithms against adaptive adversaries. Known classical randomized algorithms having each process send O(polylog n) messages work only for oblivious adversaries. Our quantum algorithm has a better time performance than deterministic solutions, which have to work in Ω(t) time for t < n failures.

Original languageEnglish (US)
Title of host publicationDistributed Computing - 24th International Symposium, DISC 2010, Proceedings
Number of pages15
StatePublished - Dec 13 2010
Externally publishedYes
Event24th International Symposium on Distributed Computing, DISC 2010 - Cambridge, MA, United States
Duration: Sep 13 2010Sep 15 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6343 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference24th International Symposium on Distributed Computing, DISC 2010
Country/TerritoryUnited States
CityCambridge, MA

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Scalable quantum consensus for crash failures'. Together they form a unique fingerprint.

Cite this