Related papers: A Symplectic Proof of the Quantum Singleton Bound
Quasi-twisted codes are used here as the classical ingredients in the so-called Construction X for quantum error-control codes. The construction utilizes nearly self-orthogonal codes to design quantum stabilizer codes. We expand the choices…
First, a canonical form for stabilizer parity check matrices of arbitrary size and rank is derived. Next, it is shown that the closely related canonical form of the Clifford group can be computed in time $O(n^3)$ for $n$ qubits, which…
We propose a single auxiliary-assisted purification-based framework for quantum error correction, capable of correcting errors that drive a system from its ground-state subspace into excited-state sectors. The protocol consists of a joint…
We introduce a unified geometric framework for domains satisfying a geometric normal property (C-GNP) relative to a strictly convex set \(C\). Under the fundamental assumption that the source \(f\) is supported within the core \(C\), we…
In this work, we explore the implications of applying the formalism of symplectic geometry to quantum mechanics, particularly focusing on many-particle systems. We extend the concept of a symplectic indicator of entanglement, originally…
Given that approximate quantum error-correcting (AQEC) codes have a potentially better performance than perfect quantum error correction codes, it is pertinent to quantify their performance. While quantum weight enumerators establish some…
Recently, operator quantum error-correcting codes have been proposed to unify and generalize decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. This note introduces a natural construction of such codes in…
We establish a bulk--boundary correspondence for translation-invariant stabilizer states in arbitrary spatial dimension, formulated in the framework of modules over Laurent polynomial rings. To each stabilizer state restricted to half-space…
Given a $2k$-dimensional symplectic space $(Z,F)$ in $N$ variables, $1 < 2k \leq N$, over a global field $K$, we prove the existence of a symplectic basis for $(Z,F)$ of bounded height. This can be viewed as a version of Siegel's lemma for…
Symplectic quantization is a functional approach to quantum field theory that allows sampling of quantum fluctuations directly in Minkowski space-time by means of a generalized microcanonical ensemble similar to the one of the standard…
We present relaxed criteria for quantum error correction which are useful when the specific dominant noise process is known. These criteria have no classical analogue. As an example, we provide a four-bit code which corrects for a single…
The notion of symmetry is shown to be at the heart of all error correction/avoidance strategies for preserving quantum coherence of an open quantum system S e.g., a quantum computer. The existence of a non-trivial group of symmetries of the…
We propose and prove an existential theorem for entanglement-assisted asymmetric quantum error correction. Then we demonstrate its superiority over the conventional one.
In this paper, two classes of twisted generalized Reed-Solomon (TGRS) codes with multi-twists are studied. Firstly, some sufficient and necessary conditions for these codes to be self-orthogonal and self-dual are established. Then several…
The concept of generalized concatenated quantum codes (GCQC) provides a systematic way for constructing good quantum codes from short component codes. We introduce a stabilizer formalism for GCQCs, which is achieved by defining quantum…
Quantum Tanner codes constitute a family of quantum low-density parity-check (LDPC) codes with good parameters, i.e., constant encoding rate and relative distance. In this article, we prove that quantum Tanner codes also facilitate…
We show that continuous bounded group cohomology stabilizes along the sequences of real or complex symplectic Lie groups, and deduce that bounded group cohomology stabilizes along sequences of lattices in them, such as…
We present a method of concatenated quantum error correction in which improved classical processing is used with existing quantum codes and fault-tolerant circuits to more reliably correct errors. Rather than correcting each level of a…
Low check weight is practically crucial code property for fault-tolerant quantum computing, which underlies the strong interest in quantum low-density parity-check (qLDPC) codes. Here, we explore the theory of weight-constrained stabilizer…
A classical coding across a block of logical qubits is presented. We characterize subgroups of the product stabilizer group on a block of logical qubits corresponding to dual codes of classical error correcting codes. We prove conditions on…