Quantum convolutional coding with shared entanglement: general structure

DOI10.1007/S11128-010-0179-9zbMATH Open1200.81041arXiv0807.3803OpenAlexW3100936557MaRDI QIDQ600891FDOQ600891

Authors: Mark M. Wilde, Todd A. Brun 

Publication date: 3 November 2010

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: We present a general theory of entanglement-assisted quantum convolutional coding. The codes have a convolutional or memory structure, they assume that the sender and receiver share noiseless entanglement prior to quantum communication, and they are not restricted to possess the Calderbank-Shor-Steane structure as in previous work. We provide two significant advances for quantum convolutional coding theory. We first show how to "expand" a given set of quantum convolutional generators. This expansion step acts as a preprocessor for a polynomial symplectic Gram-Schmidt orthogonalization procedure that simplifies the commutation relations of the expanded generators to be the same as those of entangled Bell states (ebits) and ancilla qubits. The above two steps produce a set of generators with equivalent error-correcting properties to those of the original generators. We then demonstrate how to perform online encoding and decoding for a stream of information qubits, halves of ebits, and ancilla qubits. The upshot of our theory is that the quantum code designer can engineer quantum convolutional codes with desirable error-correcting properties without having to worry about the commutation relations of these generators.

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

Recommendations

• Extra shared entanglement reduces memory demand in quantum convolutional coding
• scientific article; zbMATH DE number 5582982
• Correcting quantum errors with entanglement
• scientific article; zbMATH DE number 1406137
• Entanglement-Assisted Quantum Error-Correcting Codes

zbMATH Keywords

quantum convolutional codesquantum information theoryentanglement-assisted quantum codesentanglement-assisted quantum convolutional codes

Mathematics Subject Classification ID

Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70)

Cites Work

• Title not available (Why is that?)
• Correcting quantum errors with entanglement
• Convolutional and Tail-Biting Quantum Error-Correcting Codes
• On Quantum and Classical BCH Codes
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Quantum error correction via codes over GF(4)
• Additivity of the classical capacity of entanglement-breaking quantum channels
• A Decoupling Approach to the Quantum Capacity
• A Random Coding Based Proof for the Quantum Coding Theorem
• The Private Classical Capacity and Quantum Capacity of a Quantum Channel
• Catalytic Quantum Error Correction
• Quantum Serial Turbo Codes
• Extra shared entanglement reduces memory demand in quantum convolutional coding
• Quantum Coding Theorem from Privacy and Distinguishability
• Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation
• Quantum convolutional coding with shared entanglement: general structure

Cited In (7)

• Nonlocal quantum information in bipartite quantum error correction
• A construction of quantum turbo product codes based on CSS-type quantum convolutional codes
• Title not available (Why is that?)
• Quantum convolutional coding with shared entanglement: general structure
• On the construction of stabilizer codes with an arbitrary binary matrix
• Extra shared entanglement reduces memory demand in quantum convolutional coding
• Conversion of a general quantum stabilizer code to an entanglement distillation protocol

This page was built for publication: Quantum convolutional coding with shared entanglement: general structure

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