Extra shared entanglement reduces memory demand in quantum convolutional coding

DOI10.1103/PhysRevA.79.032313zbMath1243.81063arXiv0812.4449WikidataQ59832747 ScholiaQ59832747MaRDI QIDQ2901569

Mark M. Wilde, Todd A. Brun

Publication date: 31 July 2012

Published in: Physical Review A (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum computation (81P68) Convolutional codes (94B10) Quantum coding (general) (81P70)

Related Items (1)

Quantum convolutional coding with shared entanglement: general structure

Cites Work

• Correcting Quantum Errors with Entanglement
• Convolutional and Tail-Biting Quantum Error-Correcting Codes
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Quantum error correction via codes over GF(4)
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm

This page was built for publication: Extra shared entanglement reduces memory demand in quantum convolutional coding