Dense quantum coding and a lower bound for 1-way quantum automata

DOI10.1145/301250.301347zbMath1345.68195OpenAlexW2052866997MaRDI QIDQ2819570

Umesh V. Vazirani, Ashwin Nayak, Ammon Ta-Shma, Andris Ambainis

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301347

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum coding (general) (81P70)

Related Items (17)

Oblivious transfer and quantum channels as communication resources ⋮ Characterizations of quantum automata ⋮ A general bound for the dimension of quantum behaviours in the prepare-and-measure scenario ⋮ A broader view on the limitations of information processing and communication by nature ⋮ Source-device-independent randomness expansion using quantum random access codes ⋮ Expanding the sharpness parameter area based on sequential \(3 \rightarrow 1\) parity-oblivious quantum random access code ⋮ Semi-device-independent randomness expansion using \(n\rightarrow1\) sequential quantum random access codes ⋮ Entropy accumulation ⋮ Shadow Tomography of Quantum States ⋮ Automata theory based on quantum logic: reversibilities and pushdown automata ⋮ Parity oblivious \(d\)-level random access codes and class of noncontextuality inequalities ⋮ Separable states improve protocols with finite randomness ⋮ Optimal bounds for parity-oblivious random access codes ⋮ Two-way finite automata with quantum and classical states. ⋮ Quantum communication and complexity. ⋮ \(n\rightarrow 1\) quantum random access codes using single 3-level systems ⋮ The geometry of Bloch space in the context of quantum random access codes

This page was built for publication: Dense quantum coding and a lower bound for 1-way quantum automata