English
Related papers

Related papers: Concatenated quantum codes can attain the quantum …

200 papers

It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…

Quantum Physics · Physics 2007-05-23 Eric M. Rains

We study the maximum length of $q$-ary codes as a function of alphabet size, code size, and Singleton defect. For an $(n, M, d)_q$ code with dimension $\kappa = \log_q M \ge 2$ and Singleton defect $s = n - \lceil\kappa\rceil + 1 - d$, we…

Combinatorics · Mathematics 2026-04-07 Tim Alderson

Analytic combinatorics in several variables refers to a suite of tools that provide sharp asymptotic estimates for certain combinatorial quantities. In this paper, we apply these tools to determine the Gilbert-Varshamov (GV) bound for the…

Combinatorics · Mathematics 2024-09-04 Goyal Keshav , Duc Tu Dao , Han Mao Kiah , Mladen Kovacevic

Classical turbo codes efficiently approach the Shannon limit, and so bringing these over to the quantum scenario would allow for rapid transmission of quantum information. Early on in the work of defining the quantum analogue, it was shown…

Quantum Physics · Physics 2019-10-21 Lane G. Gunderman

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…

Quantum Physics · Physics 2007-07-13 Salah A. Aly , Andreas Klappenecker , Pradeep Kiran Sarvepalli

Executing a logical quantum circuit fault-tolerantly incurs a large spacetime overhead. Recent work has proposed and investigated phantom codes, defined by the property that every in-block logical $\mathrm{CNOT}$ circuit can be implemented…

Quantum Physics · Physics 2026-04-17 Arthur S. Morris , Daniel Malz

In this paper, we study properties of rank metric codes in general and maximum rank distance (MRD) codes in particular. For codes with the rank metric, we first establish Gilbert and sphere-packing bounds, and then obtain the asymptotic…

Information Theory · Computer Science 2007-07-13 Maximilien Gadouleau , Zhiyuan Yan

The continuous-variable (CV) Gaussian no-go theorem fundamentally limits the suppression of Gaussian displacement errors using only Gaussian gates and states. Prior studies have employed Gottesman-Kitaev-Preskill (GKP) states as ancillary…

Quantum Physics · Physics 2026-04-21 Fucheng Guo , Frank Mueller , Yuan Liu

We report two analytical bounds for quantum error-correcting codes that do not have preexisting classical counterparts. Firstly the quantum Hamming and Singleton bounds are combined into a single tighter bound, and then the combined bound…

Quantum Physics · Physics 2010-05-27 Sixia Yu , C. H. Lai , C. H. Oh

In the asymptotic safety programme for quantum gravity, it is important to go beyond polynomial truncations. Three such approximations have been derived where the restriction is only to a general function f(R) of the curvature R>0. We…

High Energy Physics - Theory · Physics 2013-01-29 Juergen A. Dietz , Tim R. Morris

Explicit non-asymptotic upper bounds on the sizes of multiple-deletion correcting codes are presented. In particular, the largest single-deletion correcting code for $q$-ary alphabet and string length $n$ is shown to be of size at most…

Information Theory · Computer Science 2012-11-15 Ankur A. Kulkarni , Negar Kiyavash

Quantum error correction codes in continuous variables (also called CV codes, or single-mode bosonic codes) have recently been identified to be a technologically viable option for building fault-tolerant quantum computers. The best-known…

Quantum Physics · Physics 2022-06-07 Allan D. C. Tosta , Thiago O. Maciel , Leandro Aolita

Gaussian distribution of a quantum state with continuous spectrum is known to maximize the Shannon entropy at a fixed variance. Applying it to a pair of canonically conjugate quantum observables $\hat x$ and $\hat p$, quantum entropic…

Quantum Physics · Physics 2015-07-21 Wonmin Son

This paper provides an extensive study of the behavior of the best achievable rate (and other related fundamental limits) in variable-length lossless compression. In the non-asymptotic regime, the fundamental limits of fixed-to-variable…

Information Theory · Computer Science 2012-12-13 Ioannis Kontoyiannis , Sergio Verdu

We give sufficient conditions for self-orthogonality with respect to symplectic, Euclidean and Hermitian inner products of a wide family of quasi-cyclic codes of index two. We provide lower bounds for the symplectic weight and the minimum…

Information Theory · Computer Science 2019-02-15 Carlos Galindo , Fernando Hernando , Ryutaroh Matsumoto

Consider a sequence of finite regular graphs (GN) converging, in the sense of Benjamini-Schramm, to the infinite regular tree. We study the induced quantum graphs with equilateral edge lengths, Kirchhoff conditions (possibly with a non-zero…

Spectral Theory · Mathematics 2019-06-18 Maxime Ingremeau , Mostafa Sabri , Brian Winn

Using the Weyl commutation relations over a finite field we introduce a family of error-correcting quantum stabilizer codes based on a class of symmetric matrices over the finite field satisfying certain natural conditions. When the field…

Quantum Physics · Physics 2007-05-23 V. Arvind , K. R. Parthasarathy

Nonassociative modifications of general relativity, GR, defined by star products with R-flux deformations in string gravity consist of an important subclass of modified gravity theories, MGTs. A longstanding criticism for elaborating…

High Energy Physics - Theory · Physics 2024-10-10 S. Vacaru

We study the spectrum of a quantum star graph with a non-selfadjoint Robin condition at the central vertex. We first prove that, in the high frequency limit, the spectrum of the Robin Laplacian is close to the usual spectrum corresponding…

Mathematical Physics · Physics 2020-12-30 Gabriel Riviere , Julien Royer

Families of "asymptotically regular" LDPC block code ensembles can be formed by terminating (J,K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles…

Information Theory · Computer Science 2016-11-15 David G. M. Mitchell , Roxana Smarandache , Michael Lentmaier , Daniel J. Costello