### Abstract

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 language | English (US) |
---|---|

Title of host publication | Distributed Computing - 24th International Symposium, DISC 2010, Proceedings |

Pages | 236-250 |

Number of pages | 15 |

DOIs | |

State | Published - Dec 13 2010 |

Externally published | Yes |

Event | 24th International Symposium on Distributed Computing, DISC 2010 - Cambridge, MA, United States Duration: Sep 13 2010 → Sep 15 2010 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 6343 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 24th International Symposium on Distributed Computing, DISC 2010 |
---|---|

Country | United States |

City | Cambridge, MA |

Period | 9/13/10 → 9/15/10 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Distributed Computing - 24th International Symposium, DISC 2010, Proceedings*(pp. 236-250). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6343 LNCS). https://doi.org/10.1007/978-3-642-15763-9_24

**Scalable quantum consensus for crash failures.** / Chlebus, Bogdan S.; Kowalski, Dariusz R.; Strojnowski, Michał.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Distributed Computing - 24th International Symposium, DISC 2010, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6343 LNCS, pp. 236-250, 24th International Symposium on Distributed Computing, DISC 2010, Cambridge, MA, United States, 9/13/10. https://doi.org/10.1007/978-3-642-15763-9_24

}

TY - GEN

T1 - Scalable quantum consensus for crash failures

AU - Chlebus, Bogdan S.

AU - Kowalski, Dariusz R.

AU - Strojnowski, Michał

PY - 2010/12/13

Y1 - 2010/12/13

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=78649814410&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78649814410&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-15763-9_24

DO - 10.1007/978-3-642-15763-9_24

M3 - Conference contribution

AN - SCOPUS:78649814410

SN - 3642157629

SN - 9783642157622

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 236

EP - 250

BT - Distributed Computing - 24th International Symposium, DISC 2010, Proceedings

ER -