Two Results about Quantum Messages

DOI10.1007/978-3-662-44465-8_38zbMath1427.68087arXiv1402.4312OpenAlexW1868368153WikidataQ58040192 ScholiaQ58040192MaRDI QIDQ2922630

Hartmut Klauck, Supartha Podder

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (3)

Zero-information protocols and unambiguity in Arthur-Merlin communication ⋮ Equality, Revisited ⋮ The complexity of quantum disjointness

This page was built for publication: Two Results about Quantum Messages