Results 11 to 20 of about 8,540 (277)
On the distance of stabilizer quantum codes from J-affine variety codes [PDF]
Self-orthogonal $J$-affine variety codes have been successfully used to obtain quantum stabilizer codes with excellent parameters. In a previous paper we gave formulae for the dimension of this family of quantum codes, but no bound for the minimum distance was given.
Carlos Galindo +2 more
exaly +7 more sources
Quantum computers require memories that are capable of storing quantum information reliably for long periods of time. The surface code is a two-dimensional quantum memory with code parameters that scale optimally with the number of physical qubits, under
Dominic J. Williamson, Nouédyn Baspin
doaj +2 more sources
Quantum Lego and XP Stabilizer Codes [PDF]
We apply the recent graphical framework of "Quantum Lego" to XP stabilizer codes where the stabilizer group is generally non-Abelian. We show that the idea of operator matching continues to hold for such codes and is sufficient for generating all their ...
Ruohan Shen, Yixu Wang, ChunJun Cao
doaj +3 more sources
No Quantum Ramsey Theorem for Stabilizer Codes [PDF]
In this paper we study the quantum graphs of mixed-unitary channels generated by tensor products of Pauli operators, which we call Pauli channels. We show that most quantum graphs arising from Pauli channels have non-trivial quantum cliques or quantum anticliques which are stabilizer codes.
Yannis Bousba, Travis Russell
openaire +2 more sources
Counting stabiliser codes for arbitrary dimension [PDF]
In this work, we compute the number of $[[n,k]]_d$ stabilizer codes made up of $d$-dimensional qudits, for arbitrary positive integers $d$. In a seminal work by Gross \cite{Gross2006} the number of $[[n,k]]_d$ stabilizer codes was computed for the case ...
Tanmay Singal +5 more
doaj +1 more source
Codeword stabilized quantum codes [PDF]
5 pages, 1 eps figure, ((11,48,3)) code removed, encoding circuits added, typos corrected in codewords and ...
Andrew W. Cross +3 more
openaire +4 more sources
Narain CFTs from nonbinary stabilizer codes
We generalize the construction of Narain conformal field theories (CFTs) from qudit stabilizer codes to the construction from quantum stabilizer codes over the finite field of prime power order ( F p m $$ {\mathbbm{F}}_{p^m} $$ with p prime and m ≥ 1) or
Yasin Ferdous Alam +4 more
doaj +1 more source
Modifying Method of Constructing Quantum Codes From Highly Entangled States
There is a connection between classical codes, highly entangled pure states (called $k$ -uniform or absolutely maximally entangled (AME) states), and quantum error correcting codes (QECCs). This leads to a systematic method to construct stabilizer QECCs
Zahra Raissi
doaj +1 more source
Nonbinary codeword-stabilized quantum codes [PDF]
The codeword stabilized (CWS) quantum codes formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes (arXiv:0708.1021 [quant-ph]), but only for binary states. Here we generalize the CWS framework to the nonbinary case (of both prime and nonprime dimension) and map the search for nonbinary quantum codes to a
Chen, Xie, Zeng, Bei, Chuang, Isaac L.
openaire +3 more sources
Exploiting degeneracy in belief propagation decoding of quantum codes
Quantum information needs to be protected by quantum error-correcting codes due to imperfect physical devices and operations. One would like to have an efficient and high-performance decoding procedure for the class of quantum stabilizer codes.
Kao-Yueh Kuo, Ching-Yi Lai
doaj +1 more source

