A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Distributed Algorithms
Quantum computation and quantum information
Quantum computation and quantum information
The computational power of the W And GHZ States
Quantum Information & Computation
Exact quantum algorithms for the leader election problem
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Proceedings of the 28th ACM symposium on Principles of distributed computing
What can be observed locally? round-based models for quantum distributed computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Scalable quantum consensus for crash failures
DISC'10 Proceedings of the 24th international conference on Distributed computing
| Hi-index | 0.00 |
Quantum computing and distributed systems may enter a mutually beneficial partnership in the future. On the one hand, it is much easier to build a number of small quantum computers rather than a single large one. On the other hand, the best results concerning some of the fundamental problems in distributed computing can potentially be dramatically improved upon by taking advantage of the superior resources and processing power that quantum mechanics offers. This survey has the purpose to highlight both of these benefits. We first review the current results regarding the implementation of arbitrary quantum algorithms on distributed hardware. We then discuss existing proposals for quantum solutions of leader election - a fundamental problem from distributed computing. Quantum mechanics allows leader election to be solved with no communication, provided that certain pre-shared entanglement is already in place. Further, an impossibility result from classical distributed computing is circumvented by the quantum solution of anonymous leader election - a unique leader is elected in finite time with certainty. Finally, we discuss the viability of these proposals from a practical perspective. Although, theoretically, distributed quantum computing looks promising, it is still unclear how to build quantum hardware and how to create and maintain robust large-scale entangled states. Moreover, it is not clear whether the costs of creating entangled states and working with them are smaller than the costs of existing classical solutions.