Related papers: A Symplectic Proof of the Quantum Singleton Bound
We give an introduction to the theory of quantum error correction using stabilizer codes that is geared towards the working computer scientists and mathematicians with an interest in exploring this area. To this end, we begin with an…
Absolutely maximally entangled (AME) states are pure multi-partite generalizations of the bipartite maximally entangled states with the property that all reduced states of at most half the system size are in the maximally mixed state. AME…
Quantum error-correction codes (QECCs) are a vital ingredient of quantum computation and communication systems. In that context it is highly desirable to design QECCs that can be represented by graphical models which possess a structure…
We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem…
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…
Quantum error correction requires the use of error syndromes derived from measurements that may be unreliable. Recently, quantum data-syndrome (QDS) codes have been proposed as a possible approach to protect against both data and syndrome…
In 1994, the second author and W. van der Kallen showed that the injective stabilization bound for K_1 of general linear group is d+1 over a regular affine algebra over a perfect C_1-field, where d is the krull dimension of the base ring…
This paper establishes a novel upper bound-termed the arithmetic Singleton bound-on the Hamming distance of any simple-root constacyclic code over a finite field. The key technical ingredient is the notion of multiple equal-difference (MED)…
We illustrate how computer-aided methods can be used to investigate the fundamental limits of the caching systems, which are significantly different from the conventional analytical approach usually seen in the information theory…
We study the standard quadratic optimization problem over the simplex when the objective matrix is drawn from the Gaussian Orthogonal Ensemble (GOE). Let \(\kappa_n\) denote the support size of the almost surely unique global optimizer. We…
We prove that symplectic ball packing stability holds for every compact, connected symplectic $4$-manifold with smooth boundary. This follows from a stronger result: the full volume of any such manifold can be filled by a single symplectic…
Quantum error correction and the use of quantum error correction codes is likely to be essential for the realisation of practical quantum computing. Because the error models of quantum devices vary widely, quantum codes which are tailored…
This paper studies the construction for quantum codes with parameters $((n,K,d))_{p}$ by use of an \textit{n}-variable logic function with APC distance $d'\ge 2$ over ${\rm {\mathbb F}}_{p} $, where $d$ is related to $d'$. We obtain $d\le…
We study the performance of quantum error correction codes (QECCs) under the detection-induced coherent error due to the imperfectness of practical implementations of stabilizer measurements, after running a quantum circuit. Considering the…
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel to its quantum counterpart. The key observation that we make is that the problem of bounding below the error exponent…
Concatenating quantum error correction codes scales error correction capability by driving logical error rates down double-exponentially across levels. However, the noise structure shifts under concatenation, making it hard to choose an…
The stabilization of a quantum computer by repeated error correction can be reduced almost entirely to repeated preparation of blocks of qubits in quantum codeword states. These are multi-particle entangled states with a high degree of…
In a model of fault-tolerant quantum computation with quick and noiseless polyloglog-time auxiliary classical computation, we construct a fault tolerance protocol with constant-space and $\widetilde{O}(\log N)$-time overhead, where…
Benchmarking the performance of quantum error correction codes in physical systems is crucial for achieving fault-tolerant quantum computing. Current methodologies, such as (shadow) tomography or direct fidelity estimation, fall short in…
We study pure $D$ dimensional Einstein gravity in spacetimes with a generic null boundary. We focus on the symplectic form of the solution phase space which comprises a $2D$ dimensional boundary part and a $2(D(D-3)/2+1)$ dimensional bulk…