Quantum distributed consensus

Authors:
Louis K. Helm
Affiliations:
University of Texas at Austin, Austin, TX, USA
Venue:
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Year:
2008

Citing 6
Cited 1

Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Quantum computation and quantum information

Quantum computation and quantum information
Concurrent and Distributed Computing in Java

Concurrent and Distributed Computing in Java
Fast quantum byzantine agreement

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The computational power of the W And GHZ States

Quantum Information & Computation

What can be observed locally? round-based models for quantum distributed computing

DISC'09 Proceedings of the 23rd international conference on Distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed consensus can be achieved on asynchronous communication networks when assisted by quantum mechanics. This contradicts the FLP impossibility result by achieving consensus in the presence of faults.