Simple constant-time consensus protocols in realistic failure models
Journal of the ACM (JACM)
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
A tight lower bound for randomized synchronous consensus
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Classical versus quantum communication complexity
ACM SIGACT News
Quantum computation and quantum information
Quantum computation and quantum information
Quantum communication and complexity
Theoretical Computer Science - Natural computing
Quantum Entanglement and the Communication Complexity of the Inner Product Function
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Fast quantum byzantine agreement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Towards Secure and Scalable Computation in Peer-to-Peer Networks
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Distributive graph algorithms Global solutions from local data
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Can quantum mechanics help distributed computing?
ACM SIGACT News
Fast scalable deterministic consensus for crash failures
Proceedings of the 28th ACM symposium on Principles of distributed computing
Locally scalable randomized consensus for synchronous crash failures
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Fault-Tolerant Quantum Computation with Constant Error Rate
SIAM Journal on Computing
What can be observed locally? round-based models for quantum distributed computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
From almost everywhere to everywhere: byzantine agreement with Õ(n³/²) bits
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Distributed agreement with optimal communication complexity
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Time and communication efficient consensus for crash failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Communication complexity of consensus in anonymous message passing systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
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.