Convolutional and Tail-Biting Quantum Error-Correcting Codes
Reads0
Chats0
TLDR
Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to 10 are constructed as stabilizer codes from classical self-orthogonal rate-1/n F4-linear and binary linear convolutionAL codes, respectively.Abstract:
Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to 10 are constructed as stabilizer codes from classical self-orthogonal rate-1/n F4-linear and binary linear convolutional codes, respectively. These codes generally have higher rate and less decoding complexity than comparable quantum block codes or previous quantum convolutional codes. Rate-(n-2)/n block stabilizer codes with the same rate and error-correction capability and essentially the same decoding complexity are derived from these convolutional codes via tail-bitingread more
Citations
More filters
Journal ArticleDOI
On the iterative decoding of sparse quantum codes
David Poulin,Yeojin Chung +1 more
TL;DR: These results indicate that the main source of errors in the quantum coding scheme remains in the decoding, and propose heuristic methods to improve belief propagation decoding specifically targeted at these two problems.
Journal ArticleDOI
Quantum Serial Turbo Codes
TL;DR: A theory of quantum serial turbo codes, a quantum analogue of a state diagram that provides an efficient way to verify the properties of a quantum convolutional code, and in particular, its recursiveness and the presence of catastrophic error propagation is presented.
Posted Content
Catalytic quantum error correction
TL;DR: The theory of entanglement-assisted quantum error-correcting (EAQEC) codes is developed, a generalization of the stabilizer formalism to the setting in which the sender and receiver have access to presharedEntanglement, which greatly simplifies their construction.
Journal ArticleDOI
Entanglement-assisted quantum turbo codes
TL;DR: It is proved that entanglement is the resource that enables a convolutional encoder to be both non-catastrophic and recursive because an encoder acting on only information qu bits, classical bits, gauge qubits, and ancilla qubits cannot simultaneously satisfy them.
Posted Content
Quantum serial turbo-codes
TL;DR: A theory of quantum serial turbo codes, a quantum analogue of a state diagram that provides an efficient way to verify the properties of a quantum convolutional code, and in particular, its recursiveness and the presence of catastrophic error propagation is presented.
References
More filters
Book
Quantum Computation and Quantum Information
TL;DR: In this article, the quantum Fourier transform and its application in quantum information theory is discussed, and distance measures for quantum information are defined. And quantum error-correction and entropy and information are discussed.
Journal ArticleDOI
Quantum computation and quantum information
TL;DR: This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing, with a focus on entanglement.
Journal ArticleDOI
The MAGMA algebra system I: the user language
TL;DR: MAGMA as mentioned in this paper is a new system for computational algebra, and the MAGMA language can be used to construct constructors for structures, maps, and sets, as well as sets themselves.
Journal ArticleDOI
The viterbi algorithm
TL;DR: This paper gives a tutorial exposition of the Viterbi algorithm and of how it is implemented and analyzed, and increasing use of the algorithm in a widening variety of areas is foreseen.
Journal ArticleDOI
Mixed State Entanglement and Quantum Error Correction
Charles H. Bennett,Charles H. Bennett,Charles H. Bennett,David P. DiVincenzo,David P. DiVincenzo,David P. DiVincenzo,John A. Smolin,John A. Smolin,John A. Smolin,William K. Wootters,William K. Wootters,William K. Wootters +11 more
TL;DR: It is proved that an EPP involving one-way classical communication and acting on mixed state M (obtained by sharing halves of Einstein-Podolsky-Rosen pairs through a channel) yields a QECC on \ensuremath{\chi} with rate Q=D, and vice versa, and it is proved Q is not increased by adding one- way classical communication.