Capacity approaching coding for low noise interactive quantum communication

DOI10.1145/3188745.3188908MaRDI QIDQ5230301zbMATH OpenOpenAlexWikidataFDO

Authors Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu, Debbie Leung

Publication date 22 August 2019

Published in Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

capacitycoding theoryinteractive codingquantum communication complexityquantum information theory

Mathematics Subject Classification ID

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

Recommendations

• Noisy interactive quantum communication
• Coding for interactive communication
• Interactive channel capacity
• Bridging the capacity gap between interactive and one-way communication
• Capacity of interactive communication over erasure channels and channels with feedback

Cited in

(4)

• Communicating Over Adversarial Quantum Channels Using Quantum List Codes
• Optimal super dense coding over noisy quantum channels
• Noisy interactive quantum communication
• Noisy (binary) searching: simple, fast and correct

This page was built for publication: Capacity approaching coding for low noise interactive quantum communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230301)