Understanding holographic error correction via unique algebras and atomic examples

• URL: http://arxiv.org/abs/2110.14691v2
• Date: Tue, 14 Jun 2022 07:20:08 GMT
• Title: Understanding holographic error correction via unique algebras and atomic examples
• Authors: Jason Pollack, Patrick Rall, Andrea Rocchetto
• Abstract summary: We introduce a fully constructive characterisation of holographic quantum error-correcting codes. We employ quantum circuits to construct a number of examples of holographic codes.
• Score: 0.25782420501870296
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a fully constructive characterisation of holographic quantum error-correcting codes. That is, given a code and an erasure error we give a recipe to explicitly compute the terms in the RT formula. Using this formalism, we employ quantum circuits to construct a number of examples of holographic codes. Our codes have nontrivial holographic properties and are simpler than existing approaches built on tensor networks. Finally, leveraging a connection between correctable and private systems we prove the uniqueness of the algebra satisfying complementary recovery. The material is presented with the goal of accessibility to researchers in quantum information with no prior background in holography.

Related papers

• Single-shot and measurement-based quantum error correction via fault complexes [0.0]
  Photonics provides a viable path to a scalable fault-tolerant quantum computer. Foliation is the construction of fault-tolerant graph states. We introduce the fault complex, a representation of dynamic quantum error correction protocols.
  arXiv  Detail & Related papers  (2024-10-16T18:52:24Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Building holographic code from the boundary [4.443525249044746]
  Holographic quantum error-correcting code, the quantum-information structure hypothesized for the AdS/CFT correspondence, has been attracting increasing attention in new directions. We initiate a novel approach for building holographic code that can be applied in potentially broad and interdisciplinary contexts.
  arXiv  Detail & Related papers  (2024-07-14T16:51:17Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• Holographic Codes from Hyperinvariant Tensor Networks [70.31754291849292]
  We show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states.
  arXiv  Detail & Related papers  (2023-04-05T20:28:04Z)
• Lossy Quantum Source Coding with a Global Error Criterion based on a Posterior Reference Map [7.646713951724011]
  We consider the lossy quantum source coding problem where the task is to compress a given quantum source below its von Neumann entropy. Inspired by the duality connections between the rate-distortion and channel coding problems in the classical setting, we propose a new formulation for the problem.
  arXiv  Detail & Related papers  (2023-02-01T17:44:40Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Engineering holography with stabilizer graph codes [2.7309692684728617]
  Recent technological progress in artificial quantum systems renders the experimental realization of holographic codes within reach. We show how to obtain encoding and decoding circuits for the hyperbolic pentagon code, before focusing on a small instance of the holographic code on twelve qubits.
  arXiv  Detail & Related papers  (2022-09-19T12:16:23Z)
• From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
  We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
  arXiv  Detail & Related papers  (2022-02-19T02:56:47Z)
• Holographic tensor network models and quantum error correction: A topical review [78.28647825246472]
  Recent progress in studies of holographic dualities has led to a confluence with concepts and techniques from quantum information theory. A particularly successful approach has involved capturing holographic properties by means of tensor networks.
  arXiv  Detail & Related papers  (2021-02-04T14:09:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.