Computing on Anonymous Quantum Network

DOI10.4086/cjtcs.2014.010zbMath1320.68083OpenAlexW1526005568MaRDI QIDQ5173200

Keiji Matsumoto, Seiichiro Tani, Hirotada Kobayashi

Publication date: 9 February 2015

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/cjtcs.2014.010

zbMATH Keywords

quantum algorithmdistributed computingleader election

Mathematics Subject Classification ID

Distributed systems (68M14) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
• Quantum dice rolling: a multi-outcome generalization of quantum coin flipping
• Tight lower bounds for probabilistic solitude verification on anonymous rings

This page was built for publication: Computing on Anonymous Quantum Network