Extra shared entanglement reduces memory demand in quantum convolutional coding

DOI10.1103/PHYSREVA.79.032313zbMATH Open1243.81063arXiv0812.4449WikidataQ59832747 ScholiaQ59832747MaRDI QIDQ2901569FDOQ2901569

Authors: Mark M. Wilde, Todd A. Brun 

Publication date: 31 July 2012

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

Abstract: We show how extra entanglement shared between sender and receiver reduces the memory requirements for a general entanglement-assisted quantum convolutional code. We construct quantum convolutional codes with good error-correcting properties by exploiting the error-correcting properties of an arbitrary basic set of Pauli generators. The main benefit of this particular construction is that there is no need to increase the frame size of the code when extra shared entanglement is available. Then there is no need to increase the memory requirements or circuit complexity of the code because the frame size of the code is directly related to these two code properties. Another benefit, similar to results of previous work in entanglement-assisted convolutional coding, is that we can import an arbitrary classical quaternary code for use as an entanglement-assisted quantum convolutional code. The rate and error-correcting properties of the imported classical code translate to the quantum code. We provide an example that illustrates how to import a classical quaternary code for use as an entanglement-assisted quantum convolutional code. We finally show how to "piggyback" classical information to make use of the extra shared entanglement in the code.

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

Recommendations

• Quantum convolutional coding with shared entanglement: general structure
• Correcting quantum errors with entanglement
• Entanglement-Assisted Quantum Error-Correcting Codes
• scientific article; zbMATH DE number 1406137
• Convolutional and Tail-Biting Quantum Error-Correcting Codes

Mathematics Subject Classification ID

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

Cites Work

• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• 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)

Cited In (1)

• Quantum convolutional coding with shared entanglement: general structure

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

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