Symmetry breaking in distributed networks
Information and Computation
Introduction to distributed algorithms
Introduction to distributed algorithms
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Distributed Algorithms
Quantum computation and quantum information
Quantum computation and quantum information
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
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 twenty-seventh ACM symposium on Principles of distributed computing
Classical Knowledge for Quantum Cryptographic Reasoning
Electronic Notes in Theoretical Computer Science (ENTCS)
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
The compositional structure of multipartite quantum entanglement
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
The search for structure in quantum computation
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Quantum Information & Computation
Reasoning about quantum knowledge
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Exact Quantum Algorithms for the Leader Election Problem
ACM Transactions on Computation Theory (TOCT)
Disappearance of entanglement: a topological point of view
Quantum Information Processing
An optical gate for simultaneous fusion of four photonic W or Bell states
Quantum Information Processing
| Hi-index | 0.00 |
It is well understood that the use of quantum entanglement significantly enhances the computational power of systems. Much of the attention has focused on Bell states and their multipartite generalizations. However, in the multipartite case it is known that there are several inequivalent classes of states, such as those represented by the W-state and the GHZ-state. Our main contribution is a demonstration of the special computational power of these states in the context of paradigmatic problems from classical distributed computing. Concretely, we show that the W-state is the only pure state that can be used to exactly solve the problem of leader election in anonymous quantum networks. Similarly we show that the GHZ-state is the only one that can be used to solve the problem of distributed consensus when no classical post-processing is considered. These results generalize to a family of W- and GHZ-like states. At the heart of the proofs of these impossibility results lie symmetry arguments.