Results 1 to 10 of about 8,441 (178)
On the Exploration of Quantum Polar Stabilizer Codes and Quantum Stabilizer Codes with High Coding Rate [PDF]
Inspired by classical polar codes, whose coding rate can asymptotically achieve the Shannon capacity, researchers are trying to find their analogs in the quantum information field, which are called quantum polar codes.
Zhengzhong Yi +3 more
doaj +6 more sources
Stabilizer codes for open quantum systems [PDF]
The Lindblad master equation describes the evolution of a large variety of open quantum systems. An important property of some open quantum systems is the existence of decoherence-free subspaces.
Francisco Revson F. Pereira +2 more
doaj +8 more sources
Quantum Stabilizer Codes and Classical Linear Codes [PDF]
We show that within any quantum stabilizer code there lurks a classical binary linear code with similar error-correcting capabilities, thereby demonstrating new connections between quantum codes and classical codes.
A. Ekert +13 more
core +4 more sources
Quantum stabilizer codes, lattices, and CFTs [PDF]
There is a rich connection between classical error-correcting codes, Euclidean lattices, and chiral conformal field theories. Here we show that quantum error-correcting codes, those of the stabilizer type, are related to Lorentzian lattices and non ...
Anatoly Dymarsky, Alfred Shapere
doaj +4 more sources
Nonbinary quantum stabilizer codes [PDF]
6 ...
A Ashikhmin, E Knill
exaly +3 more sources
Quantum LDPC Codes Based on Cocyclic Block Matrices [PDF]
Motivated by a family of binary cocyclic block matrices over GF(2), we proposed a construction method to gain the stabilizer of long-length quantum error-correction codes (QECCs).
Yuan Li, Ying Guo
doaj +2 more sources
Quantum Stabilizer Codes from Maximal Curves [PDF]
A curve attaining the Hasse-Weil bound is called a maximal curve. Usually classical error-correcting codes obtained from a maximal curve have good parameters.
Jin, Lingfei
core +2 more sources
Hardness of Decoding Quantum Stabilizer Codes [PDF]
In this article we address the computational hardness of optimally decoding a quantum stabilizer code. Much like classical linear codes, errors are detected by measuring certain check operators which yield an error syndrome, and the decoding problem consists of determining the most likely recovery given the syndrome. The corresponding classical problem
Pavithran Iyer, David Poulin
exaly +3 more sources
Universal Decoding of Quantum Stabilizer Codes via Classical Guesswork
A universal decoding scheme is conceived for quantum stabilizer codes (QSCs) by appropriately adapting the ‘guessing random additive noise decoding’ (GRAND) philosophy of classical domain codes.
Daryus Chandra +5 more
doaj +3 more sources
Stabilizer formalism for generalized concatenated quantum codes [PDF]
The concept of generalized concatenated quantum codes (GCQC) provides a systematic way for constructing good quantum codes from short component codes. We introduce a stabilizer formalism for GCQCs, which is achieved by defining quantum coset codes.
Grassl, Markus +3 more
core +2 more sources

