Related papers: The non-existence of a [[13,5,4]] quantum stabiliz…
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…
In this work, we develop a space-time block code for noncoherent communication using techniques from the field of quantum error correction. We decompose the multiple-input multiple-output (MIMO) channel into operators from quantum…
Quantum entanglement plays an important role in quantum computation and communication. It is necessary for many protocols and computations, but causes unexpected disturbance of computational states. Hence, static analysis of quantum…
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…
We construct families of high performance quantum amplitude damping codes. All of our codes are nonadditive and most modestly outperform the best possible additive codes in terms of encoded dimension. One family is built from nonlinear…
In this paper we prove a conjecture that $D(4)$-quintuple does not exist using both classical and new methods. Also, we give a new version of the Rickert's theorem that can be applied on some $D(4)$-quadruples.
In practical communication and computation systems, errors occur predominantly in adjacent positions rather than in a random manner. In this paper, we develop a stabilizer formalism for quantum burst error correction codes (QBECC) to combat…
Instead of a quantum computer where the fundamental units are 2-dimensional qubits, we can consider a quantum computer made up of d-dimensional systems. There is a straightforward generalization of the class of stabilizer codes to…
The quantum error threshold is the highest (model-dependent) noise rate which we can tolerate and still quantum-compute to arbitrary accuracy. Although noise thresholds are frequently estimated for the Steane seven-qubit, distance-three…
The Measurement-based quantum computation provides an alternate model for quantum computation compared to the well-known gate-based model. It uses qubits prepared in a specific entangled state followed by single-qubit measurements. The…
These notes introduce quantum computation and quantum error correction, emphasising the importance of stabilisers and the mathematical foundations in basic Lie theory. We begin by using the double cover map $\mathrm{SU}_2 \rightarrow…
In classical coding, a single quantum state is encoded into classical information. Decoding this classical information in order to regain the original quantum state is known to be impossible. However, one can attempt to construct a state…
The problem of finding quantum error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are…
An m-uniform quantum state on n qubits is an entangled state in which every m-qubit subsystem is maximally mixed. Starting with an m-uniform state realized as the graph state associated with an m-regular graph, and a classical [n,k,d \ge…
In this work we prove that the 5-qubit quantum error correcting code does not fix qubit independent errors, even assuming that the correction circuit does not introduce new errors. We say that a quantum code does not fix a quantum computing…
Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. We introduce two new families of quantum convolutional codes. Our construction is based on an algebraic method which allows to…
We prove a general reduction theorem for stabilizer absolutely maximally entangled states in composite local dimension. If a stabilizer $\mathrm{AME}(n,D)$ state exists and $D=\prod_{i=1}^m q_i$ is the prime-power factorization of $D$, then…
We introduce quantum pin codes: a class of quantum CSS codes. Quantum pin codes are a generalization of quantum color codes and Reed-Muller codes and share a lot of their structure and properties. Pin codes have gauge operators, an…
A fundamental problem in quantum coding theory is to determine the maximum size of quantum codes of given block length and distance. A recent work introduced bounds based on semidefinite programming, strengthening the well-known quantum…
We prove direct quantum coding theorem for random quantum codes. The problem is separated into two parts: proof of distinguishability of codewords by receiver, and that of indistinguishability of codewords by environment (privacy). For a…