Exact Quantum Algorithms for the Leader Election Problem

DOI10.1145/2141938.2141939zbMath1322.68077arXiv0712.4213OpenAlexW1487051037MaRDI QIDQ2947561

Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto

Publication date: 24 September 2015

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0712.4213

zbMATH Keywords

quantum algorithmsdistributed computingquantum communication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (9)

Model checking quantum Markov chains ⋮ An exact quantum algorithm for a restricted subtraction game ⋮ Brief Announcement: Improved Consensus in Quantum Networks ⋮ Deriving the correctness of quantum protocols in the probabilistic logic for quantum programs ⋮ Toward automatic verification of quantum programs ⋮ Unnamed Item ⋮ A proof system for disjoint parallel quantum programs ⋮ Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? ⋮ Distinguishing views in symmetric networks: a tight lower bound

This page was built for publication: Exact Quantum Algorithms for the Leader Election Problem