Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0903.5256 · Physical Review A

Logical operators of quantum codes

Mark M. Wilde

Published Jun 24, 2009• 42 citations
arXivHTMLPDF

Abstract

I show how applying a symplectic Gram-Schmidt orthogonalization to the normalizer of a quantum code gives a different way of determining the code's logical operators. This approach may be more natural in the setting where we produce a quantum code from classical codes because the generator matrices of the classical codes form the normalizer of the resulting quantum code. This technique is particularly useful in determining the logical operators of an entanglement-assisted code produced from two classical binary codes or from one classical quaternary code. Finally, this approach gives additional formulas for computing the amount of entanglement that an entanglement-assisted code requires.

DOI
10.1103/physreva.79.062322

Related papers

Optimal entanglement formulas for entanglement-assisted quantum coding

Mark M. Wilde, Todd A. Brun

We provide several formulas that determine the optimal number of entangled bits (ebits) that a general entanglement-assisted quantum code requires. Our first theorem gives a formula that applies to an arbitrary entanglement-assisted block code. Corollaries of this theorem give formulas that apply to a code imported from two classical binary block codes, to a code imported from a classical quaternary block code, and to a continuous-variable entanglement-assisted quantum block code. Finally, we conjecture two formulas that apply to entanglement-assisted quantum convolutional codes.

arXiv:0804.1404•Physical Review A•Jun 19, 2008•192 citations

Entanglement assisted binary quantum tensor product codes

Priya J. Nadkarni, Shayan Srinivasa Garani

We propose the construction and error correction procedures of an entanglement assisted binary quantum tensor product code. We devise an efficient procedure to construct the code with complexity O(max{ρ21, ρ22}) compared to O(ρ21ρ22) using symplectic Gram-Schmidt orthogonalization, where ρ1and ρ2are the number of parity bits of the component codes. Our error correction procedures can correct quantum burst errors without destroying the quantum state.

IEEE Information Theory Workshop (ITW)•Nov 1, 2017•8 citations

UNITARY OPERATORS, ENTANGLEMENT, AND GRAM–SCHMIDT ORTHOGONALIZATION

Yorick Hardy, Willi-Hans Steeb

We consider finite-dimensional Hilbert spaces [Formula: see text] with [Formula: see text] with n ≥ 2 and unitary operators. In particular, we consider the case n = 2m, where m ≥ 2 in order to study entanglement of states in these Hilbert spaces. Two normalized states ψ and ϕ in these Hilbert spaces [Formula: see text] are connected by a unitary transformation (n×n unitary matrices), i.e. ψ = Uϕ, where U is a unitary operator UU* = I. Given the normalized states ψ and ϕ, we provide an algorithm to find this unitary operator U for finite-dimensional Hilbert spaces. The construction is based on a modified Gram–Schmidt orthonormalization technique. A number of applications important in quantum computing are given. Symbolic C++ is used to give a computer algebra implementation in C++.

International Journal of Modern Physics C•Jun 1, 2009•1 citation

Standard Forms of Stabilizer and Normalizer Matrices for Additive Quantum Codes

Ruihu Li, Zongben Xu, Xueliang Li

In this correspondence, we use a symplectic geometry over the binary field to discuss the equivalence of additive codes over the quaternary field and the equivalence of additive quantum codes. We establish the existence of a standard form of the stabilizer and the normalizer matrices for additive quantum codes. Thus, we present the quantum analogue of standard forms of generator and parity check matrices for systematic linear codes in classical coding theory for additive quantum codes.

IEEE Transactions on Information Theory•Jul 24, 2008•4 citations

Extended and Entanglement-assisted Quantum Quasi-twisted Codes

Akram Saleh, M. Reza Soleymani

Abstract The development of quantum codes and entanglement-assisted quantum codes with improved parameters through classical codes has been a critical area in both quantum communications and quantum information theory. In this paper, we introduce a novel approach using a family of one-generator quasi-twisted codes of index 3 and provide an extended version of them that maintain self-orthogonality, enabling the creation of stabilizer quantum codes. Computational findings include the construction of binary stabilizer codes with good parameters. Additionally, we propose techniques to design maximal-entanglement entanglement-assisted quantum codes based on this class of quasi-twisted codes. As a practical outcome, we find some optimal quantum codes and good maximal-entanglement entanglement-assisted quantum codes derived from these class of quasi-twisted codes and their extension.

•Jul 10, 2026•0 citations

New Non-Binary Stabilizer Quantum Codes Derived from Quasi-Negacyclic Codes

Jingjie Lv, Xi Zhang, Ruihu Li

Constructions of quantum error-correcting codes with good properties utilizing classical codes is an important task for quantum computing and quantum information. In this paper, we employ a class of one-generator quasi-negacyclic codes and provide a sufficient condition for symplectic self-orthogonality. As the computational results, some good non-binary stabilizer quantum codes are constructed and their parameters are determined.

International Congress on Image and Signal Processing (CISP)•Oct 1, 2019•2 citations
I show how applying a symplectic Gram-Schmidt orthogonalization to the normalizer of a quantum code gives a different way of determining the code's logical operators. This approach may be more natural in the setting where we produce a quantum code from classical codes because the generator matrices of the classical codes form the normalizer of the resulting quantum code. This technique is particularly useful in determining the logical operators of an entanglement-assisted code produced from two classical binary codes or from one classical quaternary code. Finally, this approach gives additional formulas for computing the amount of entanglement that an entanglement-assisted code requires.
We provide several formulas that determine the optimal number of entangled bits (ebits) that a general entanglement-assisted quantum code requires. Our first theorem gives a formula that applies to an arbitrary entanglement-assisted block code. Corollaries of this theorem give formulas that apply to a code imported from two classical binary block codes, to a code imported from a classical quaternary block code, and to a continuous-variable entanglement-assisted quantum block code. Finally, we conjecture two formulas that apply to entanglement-assisted quantum convolutional codes.
We consider finite-dimensional Hilbert spaces [Formula: see text] with [Formula: see text] with n ≥ 2 and unitary operators. In particular, we consider the case n = 2m, where m ≥ 2 in order to study entanglement of states in these Hilbert spaces. Two normalized states ψ and ϕ in these Hilbert spaces [Formula: see text] are connected by a unitary transformation (n×n unitary matrices), i.e. ψ = Uϕ, where U is a unitary operator UU* = I. Given the normalized states ψ and ϕ, we provide an algorithm to find this unitary operator U for finite-dimensional Hilbert spaces. The construction is based on a modified Gram–Schmidt orthonormalization technique. A number of applications important in quantum computing are given. Symbolic C++ is used to give a computer algebra implementation in C++.
Abstract The development of quantum codes and entanglement-assisted quantum codes with improved parameters through classical codes has been a critical area in both quantum communications and quantum information theory. In this paper, we introduce a novel approach using a family of one-generator quasi-twisted codes of index 3 and provide an extended version of them that maintain self-orthogonality, enabling the creation of stabilizer quantum codes. Computational findings include the construction of binary stabilizer codes with good parameters. Additionally, we propose techniques to design maximal-entanglement entanglement-assisted quantum codes based on this class of quasi-twisted codes. As a practical outcome, we find some optimal quantum codes and good maximal-entanglement entanglement-assisted quantum codes derived from these class of quasi-twisted codes and their extension.