English
Related papers

Related papers: A Class of Cyclic Quantum Codes

200 papers

The theory of stabilizer quantum error correction allows us to actively stabilize quantum states and simulate ideal quantum operations in a noisy environment. It is critical is to correctly diagnose noise from its syndrome and nullify it…

Quantum Physics · Physics 2014-12-03 Yuichiro Fujiwara

For a number of quantum channels of interest, phase-flip errors occur far more frequently than bit-flip errors. When transmitting across these asymmetric channels, the decoding error rate can be reduced by tailoring the code used to the…

Quantum Physics · Physics 2020-03-25 Alex Rigby , JC Olivier , Peter Jarvis

We introduce a class of 3D color codes, which we call stacked codes, together with a fault-tolerant transformation that will map logical qubits encoded in two-dimensional (2D) color codes into stacked codes and back. The stacked code allows…

Quantum Physics · Physics 2016-03-07 Tomas Jochym-O'Connor , Stephen D. Bartlett

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, a class of three-weight…

Information Theory · Computer Science 2013-02-05 Zhengchun Zhou , Cunsheng Ding

We introduce new yet easily accessible codes for elements of $GL_r(A)$ with $A$ the adelic ring of a (dimension one) function field over a finite field. They are linear codes, and coincide with classical algebraic geometry codes when $r=1$.…

Information Theory · Computer Science 2018-06-13 Lin Weng

Let $q$ be a prime power and let $\mathcal{R}=\mathbb{F}_{q}[u_1,u_2, \cdots, u_k]/\langle f_i(u_i),u_iu_j-u_ju_i\rangle$ be a finite non-chain ring, where $f_i(u_i), 1\leq i \leq k$ are polynomials, not all linear, which split into…

Information Theory · Computer Science 2022-12-07 Swati Bhardwaj , Mokshi Goyal , Madhu Raka

Using the Weyl commutation relations over a finite field we introduce a family of error-correcting quantum stabilizer codes based on a class of symmetric matrices over the finite field satisfying certain natural conditions. When the field…

Quantum Physics · Physics 2007-05-23 V. Arvind , K. R. Parthasarathy

Floquet codes are a recently discovered type of quantum error correction code. They can be thought of as generalising stabilizer codes and subsystem codes, by allowing the logical Pauli operators of the code to vary dynamically over time.…

Quantum Physics · Physics 2023-09-01 Alex Townsend-Teague , Julio Magdalena de la Fuente , Markus Kesselring

We develop the theory of entanglement-assisted quantum error correcting (EAQEC) codes, a generalization of the stabilizer formalism to the setting in which the sender and receiver have access to pre-shared entanglement. Conventional…

Quantum Physics · Physics 2022-02-04 Todd Brun , Igor Devetak , Min-Hsiu Hsieh

Bosonic rotation codes, introduced here, are a broad class of bosonic error-correcting codes based on phase-space rotation symmetry. We present a universal quantum computing scheme applicable to a subset of this class--number-phase…

Quantum Physics · Physics 2020-03-11 Arne L. Grimsmo , Joshua Combes , Ben Q. Baragiola

Fault-tolerant logical operations for qubits encoded by CSS codes are discussed, with emphasis on methods that apply to codes of high rate, encoding k qubits per block with k>1. It is shown that the logical qubits within a given block can…

Quantum Physics · Physics 2013-05-29 Andrew M. Steane , Ben Ibinson

The existence is proved of a class of open quantum systems that admits a linear subspace ${\cal C}$ of the space of states such that the restriction of the dynamical semigroup to the states built over $\cal C$ is unitary. Such subspace…

Quantum Physics · Physics 2015-06-26 P. Zanardi , M. Rasetti

Codeword stabilized (CWS) codes are a general class of quantum codes that includes stabilizer codes and many families of non-additive codes with good parameters. For such a non-additive code correcting all t-qubit errors, we propose an…

Quantum Physics · Physics 2013-05-29 Yunfan Li , Ilya Dumer , Leonid P. Pryadko

Active quantum error correction using qubit stabilizer codes has emerged as a promising, but experimentally challenging, engineering program for building a universal quantum computer. In this review we consider the formalism of qubit…

Quantum Physics · Physics 2015-04-13 Barbara M. Terhal

This paper is devoted to the study of the construction of new quantum MDS codes. Based on constacyclic codes over Fq2 , we derive four new families of quantum MDS codes, one of which is an explicit generalization of the construction given…

Information Theory · Computer Science 2017-05-08 Mustafa Sari , Emre Kolotoglu

The inevitable presence of decoherence effects in systems suitable for quantum computation necessitates effective error-correction schemes to protect information from noise. We compute the stability of the toric code to depolarization by…

We show how to explicitly construct an $O(nd)$ size and constant quantum depth circuit which encodes any given $n$-qubit stabilizer code with $d$ generators. Our construction is derived using the graphic description for stabilizer codes and…

Quantum Physics · Physics 2008-08-18 Wei Huang , Zhaohui Wei

One hurdle to performing reliable quantum computations is overcoming noise. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers.…

Quantum Physics · Physics 2022-04-27 Lane G. Gunderman

Subspace codes have important applications in random network coding. It is interesting to construct subspace codes with both sizes, and the minimum distances are as large as possible. In particular, cyclic constant dimension subspaces codes…

Information Theory · Computer Science 2023-05-24 Yun Li , Hongwei Liu , Sihem Mesnager

We consider two-dimensional $(\lambda_1, \lambda_2)$-constacyclic codes over $\mathbb{F}_{q}$ of area $M N$, where $q$ is some power of prime $p$ with $\gcd(M,p)=1$ and $\gcd(N,p)=1$. With the help of common zero (CZ) set, we characterize…

Information Theory · Computer Science 2025-12-24 Vidya Sagar , Shikha Patel , Ashutosh Singh , Shayan Srinivasa Garani