相关论文: Uniqueness of Complementary Recovery in Holographi…

Error correction is an indispensable component when Physical Unclonable Functions (PUFs) are used in cryptographic applications. So far, there exist schemes that obtain helper data, which they need within the error correction process. We…

We initiate a study of local operator algebras at the boundary of infinite tensor networks, using the mathematical theory of inductive limits. In particular, we consider tensor networks in which each layer acts as a quantum code with…

While originally motivated by quantum computation, quantum error correction (QEC) is currently providing valuable insights into many-body quantum physics such as topological phases of matter. Furthermore, mounting evidence originating from…

We reformulate entanglement wedge reconstruction in the language of operator-algebra quantum error correction with infinite-dimensional physical and code Hilbert spaces. Von Neumann algebras are used to characterize observables in a…

The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A constructive proof for reconstructibility of an extended perfect…

A linear error correcting code is a subspace of a finite-dimensional space over a finite field with a fixed coordinate system. Such a code is said to be locally recoverable with locality $r$ if, for every coordinate, its value at a codeword…

Concurrent coding is an encoding scheme with "holographic" type properties that are shown here to be robust against a significant amount of noise and signal loss. This single encoding scheme is able to correct for random errors and burst…

We evaluate the usefulness of holographic stabilizer codes for practical purposes by studying their allowed sets of fault-tolerantly implementable gates. We treat them as subsystem codes and show that the set of transversally implementable…

Bilocal holography is a constructive approach to the higher spin theory holographically dual to $O(N)$ vector models. In contrast to other approaches to bulk reconstruction, bilocal holography does not take input from the dual gravitational…

Noise poses a challenge for any real-world implementation in quantum information science. The theory of quantum error correction deals with this problem via methods to encode and recover quantum information in a way that is resilient…

Linear erasure codes with local repairability are desirable for distributed data storage systems. An [n, k, d] code having all-symbol (r, \delta})-locality, denoted as (r, {\delta})a, is considered optimal if it also meets the minimum…

The matrix completion problem provides a unifying lens through which many fundamental problems in coding theory can be viewed. In this paper, we investigate Locally Recoverable Codes (LRCs) with Maximal Recoverability (MR) and Maximum…

We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming…

This paper examines linear binary codes capable of correcting one or more errors. For the single-error-correcting case, it is shown that the Hamming bound is achieved by a constructive method, and an exact expression for the minimal…

We introduce the concept of quantum locally recoverable codes (qLRCs) with intersecting recovery sets. We derive a singleton-like bound for these codes by leveraging the additional information provided by the intersecting recovery sets.…

It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding and encoded Hilbert spaces. However, this bound only applies…

We study the error threshold properties of holographic quantum error-correcting codes. We demonstrate that holographic CFTs admit an algebraic threshold, which is related to the confinement-deconfinement phase transition. We then apply…

Quantum error correction (QEC) is a crucial prerequisite for future large-scale quantum computation. Finding and analyzing new QEC codes, along with efficient decoding and fault-tolerance protocols, is central to this effort. Holographic…

A code over a finite alphabet is called locally recoverable (LRC code) if every symbol in the encoding is a function of a small number (at most $r$) other symbols of the codeword. In this paper we introduce a construction of LRC codes on…

For every p in (0,1/2), we give an explicit construction of binary codes of rate approaching "capacity" 1-H(p) that enable reliable communication in the presence of worst-case additive errors}, caused by a channel oblivious to the codeword…