Related papers: Optimal quantum subsystem codes in 2-dimensions
The theory of quantum algorithms promises unprecedented benefits of harnessing the laws of quantum mechanics for solving certain computational problems. A persistent obstacle to using such algorithms for solving a wide range of real-world…
We demonstrate that two-dimensional N=8 supersymmetric quantum mechanics which inherits the most interesting properties of $N=2, d=4$ SYM can be constructed if the reduction to one dimension is performed in terms of the basic object, i.e.…
Two known 2-dim SUSY quantum mechanical constructions - the direct generalization of SUSY with first-order supercharges and Higher order SUSY with second order supercharges - are combined for a class of 2-dim quantum models, which {\it are…
Quantum synchronizable error-correcting codes are special quantum error-correcting codes that are designed to correct both the effect of quantum noise on qubits and misalignment in block synchronization. It is known that in principle such a…
A geometrically local quantum code is an error correcting code situated within $\mathbb{R}^D$, where the checks only act on qubits within a fixed spatial distance. The main question is: What is the optimal dimension and distance for a…
Quantum error correction is necessary to perform large-scale quantum computations in the presence of noise and decoherence. As a result, several aspects of quantum error correction have already been explored. These have been primarily…
It is an important task to construct quantum maximum-distance-separable (MDS) codes with good parameters. In the present paper, we provide six new classes of q-ary quantum MDS codes by using generalized Reed-Solomon (GRS) codes and…
Geometrically local quantum codes, comprised of qubits and checks embedded in $\mathbb{R}^D$ with local check operators, have been a subject of significant interest. A key challenge is identifying the optimal code construction that…
A permutation-invariant quantum code on $N$ qudits is any subspace stabilized by the matrix representation of the symmetric group $S_N$ as permutation matrices that permute the underlying $N$ subsystems. When each subsystem is a complex…
We investigate the most general notion of a private quantum code, which involves the encoding of qubits into quantum subsystems and subspaces. We contribute to the structure theory for private quantum codes by deriving testable conditions…
Random access codes are a type of communication task that is widely used in quantum information science. The optimal average success probability that can be achieved through classical strategies is known for any random access code. However,…
A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend…
Sarvepalli and Klappenecker showed how classical one-point codes on the Hermitian curve can be used to construct quantum codes. Homma and Kim determined the parameters of a larger family of codes, the two-point codes. In quantum…
Construction of quantum codes and entanglement-assisted quantum codes with good parameters via classical codes is an important task for quantum computing and quantum information. In this paper, by a family of one-generator quasi-cyclic…
We construct explicitly two infinite families of genuine nonadditive 1-error correcting quantum codes and prove that their coding subspaces are 50% larger than those of the optimal stabilizer codes of the same parameters via the linear…
We investigate optimal encoding and retrieval of digital data, when the storage/communication medium is described by quantum mechanics. We assume an m-ary alphabet with arbitrary prior distribution, and an n-dimensional quantum system.…
In quantum coding theory, stabilizer codes are probably the most important class of quantum codes. They are regarded as the quantum analogue of the classical linear codes and the properties of stabilizer codes have been carefully studied in…
It is a major challenge to construct good quantum codes supporting fault-tolerant (e.g. transversal) non-Clifford gates with low-weight parity-check measurements. In this paper, we construct the first known quantum codes with linear…
We investigate quantum algorithms for classification, a fundamental problem in machine learning, with provable guarantees. Given $n$ $d$-dimensional data points, the state-of-the-art (and optimal) classical algorithm for training…
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…