相关论文: Uniqueness of Complementary Recovery in Holographi…
We derive necessary and sufficient conditions for the approximate correctability of a quantum code, generalizing the Knill-Laflamme conditions for exact error correction. Our measure of success of the recovery operation is the worst-case…
Topological quantum error-correcting codes are a promising candidate for building fault-tolerant quantum computers. Decoding topological codes optimally, however, is known to be a computationally hard problem. Various decoders have been…
Quantum error correcting codes with finite-dimensional Hilbert spaces have yielded new insights on bulk reconstruction in AdS/CFT. In this paper, we give an explicit construction of a quantum error correcting code where the code and…
We consider subset recovery in the many-access Gaussian multiple-access channel with a shared spherical codebook, where codewords are drawn independently and uniformly from the hypersphere of radius \( \sqrt{nP} \), the number of active…
Quantum error correction is one of the fundamental building blocks of digital quantum computation. The Quantum Lego formalism has introduced a systematic way of constructing new stabilizer codes out of basic lego-like building blocks, which…
A huge progress in studying holographic theories is that holography can be interpreted via the quantum error correction, which makes equal the entanglement wedge reconstruction, the Jafferis-Lewkowycz-Maldacena-Suh formula, the radial…
Solving Algebra Problems with Geometry Diagrams (APGDs) is still a challenging problem because diagram processing is not studied as intensively as language processing. To work against this challenge, this paper proposes a hologram reasoning…
We generalize the construction of locally recoverable codes on algebraic curves given by Barg, Tamo and Vl\u{a}du\c{t} to those with arbitrarily many recovery sets by exploiting the structure of fiber products of curves. Employing maximal…
Maximally recoverable codes are a class of codes which recover from all potentially recoverable erasure patterns given the locality constraints of the code. In earlier works, these codes have been studied in the context of codes with…
The holographic entropy cone characterizes the relations between entanglement entropies for a spatial partitioning of the boundary spacetime of a holographic CFT in any state describing a classical bulk geometry. We argue that the…
In holographic CFTs satisfying eigenstate thermalization, there is a regime where the operator product expansion can be approximated by a random tensor network. The geometry of the tensor network corresponds to a spatial slice in the…
Hyperdimensional Computing (HDC) is an emerging computational paradigm for representing compositional information as high-dimensional vectors, and has a promising potential in applications ranging from machine learning to neuromorphic…
This paper describes a dual certificate condition on a linear measurement operator $A$ (defined on a Hilbert space $\mathcal{H}$ and having finite-dimensional range) which guarantees that an atomic norm minimization, in a certain sense,…
We report the first nonadditive quantum error-correcting code, namely, a $((9,12,3))$ code which is a 12-dimensional subspace within a 9-qubit Hilbert space, that outperforms the optimal stabilizer code of the same length by encoding more…
Based on the group structure of a unitary Lie algebra, a scheme is provided to systematically and exhaustively generate quantum error correction codes, including the additive and nonadditive codes. The syndromes in the process of…
Distributed storage systems for large-scale applications typically use replication for reliability. Recently, erasure codes were used to reduce the large storage overhead, while increasing data reliability. A main limitation of…
In this paper, we present a construction of locally recoverable codes (LRCs) with multiple recovery sets using algebraic curves with many rational points. By leveraging separable morphisms between smooth projective curves and expanding the…
We devise and analyse a novel $\boldsymbol{H}(\textbf{curl})$-reconstruction operator for piecewise polynomial fields on shape-regular simplicial meshes. The (non-polynomial) reconstruction is devised over the mesh vertex patches using the…
Phase recovery from intensity-only measurements forms the heart of coherent imaging techniques and holography. Here we demonstrate that a neural network can learn to perform phase recovery and holographic image reconstruction after…
In this paper, we provide explicit constructions for a class of exact-repair regenerating codes that possess a layered structure. These regenerating codes correspond to interior points on the storage-repair-bandwidth tradeoff, and compare…