Related papers: On New Quantum Codes From Matrix Product Codes
The theory of entanglement-assisted quantum error-correcting codes (EAQECCs) is a generalization of the standard stabilizer quantum error-correcting codes, which can be possibly constructed from any classical codes by relaxing the duality…
Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming…
We establish a framework which allows one to construct novel schemes for measurement-based quantum computation. The technique further develops tools from many-body physics - based on finitely correlated or projected entangled pair states -…
This article examines group ring codes over finite fields and finite groups. We also present a section on two-dimensional cyclic codes in the quotient ring $\mathbb{F}_q[x, y] / \langle x^{l} - 1, y^{m} - 1 \rangle$. These two-dimensional…
A novel decoding algorithm is developed for general quantum convolutional codes. Exploiting useful ideas from classical coding theory, the new decoder introduces two innovations that drastically reduce the decoding complexity compared to…
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…
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…
This paper proposes a novel matrix rank-one decomposition for quaternion Hermitian matrices, which admits a stronger property than the previous results in (sturm2003cones,huang2007complex,ai2011new). The enhanced property can be used to…
We show that quantum Reed-Solomon codes constructed from classical Reed-Solomon codes can approach the capacity on the quantum erasure channel of $d$-level systems for large dimension $d$. We study the performance of one-way quantum…
It is shown that quantum mechanics on noncommutative spaces (NQM) can be obtained by the canonical quantization of some underlying second class constrained system formulated in extended configuration space. It leads, in particular, to an…
This report surveys quantum error-correcting codes. As Preskill claimed, 21st century would be the golden age of quantum error correction. Quantum channels behave differently from classical channels, so researchers face difficulties in…
As a result of their applications in network coding, space-time coding, and coding for criss-cross errors, matrix codes have garnered significant attention; in various contexts, these codes have also been termed rank-metric codes,…
Coding/decoding algorithms are of great importance to help in improving information security since information security is a more significiant problem in recent years. In this paper we introduce two new coding/decoding algorithms using…
We discuss various properties of the variational class of continuous matrix product states, a class of ansatz states for one-dimensional quantum fields that was recently introduced as the direct continuum limit of the highly successful…
Quantum algorithms for simulation of Hamiltonian evolution are often based on product formulae. The fractal methods give a systematic way to find arbitrarily high-order product formulae, but result in a large number of exponentials. On the…
Let $R$ be a commutative ring with identity. The paper studies the problem of self-orthogonality and self-duality matrix-product codes (MPCs) over $R$. Some methods as well as special matrices are introduced for the construction of such…
This article studies one-generator and two-generator quasi-cyclic codes over finite fields. We present two versions of necessary and sufficient conditions for the symplectic selforthogonality of one-generator quasi-cyclic codes, using both…
Algebraic Geometric codes associated to a recently discovered class of maximal curves are investigated. As a result, some linear codes with better parameters with respect to the previously known ones are discovered, and 70 improvements on…
MQuantum algorithms of matrix operations are of great significance in many fields in science and technology. In this paper, by leveraging multi-qubit Toffoli gates and basic single-qubit operations, the quantum algorithms of matrix…
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimal chordal distance. They stem from upper bounds for codes in products of unit spheres and projective spaces. The new bounds are asymptotically better…