Building holographic code from the boundary

• URL: http://arxiv.org/abs/2407.10271v1
• Date: Sun, 14 Jul 2024 16:51:17 GMT
• Title: Building holographic code from the boundary
• Authors: Wei Wang,
• Abstract summary: 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.
• Score: 4.443525249044746
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Holographic quantum error-correcting code, the quantum-information structure hypothesized for the AdS/CFT correspondence, has being attracting increasing attention in new directions interrelating the studies of quantum gravity and quantum simulation. In this work, we initiate a novel approach for building holographic code that can be generally applied in potentially broad and interdisciplinary contexts. Our approach takes an "opposite" route to the conventional paradigm that is based on bulk tensor-networks. As illustrated in an exact model, we start from scalable descriptions of boundary qudits which can guide succinct quantum-circuit simulations, and rigorously show how the bulk qudits and the encoding structure emerge from boundary entanglement patterns. By investigating the entanglement patterns, we systematically unfold the hypothetical structure for bulk reconstruction and the details of the Ryu-Takayanagi formula in the formalism of operator-algebra quantum error correction, demonstrating desired properties that are not yet proved in the established models. Our work might offer a fresh perspective for the study of holographic code.

Related papers

• 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)
• Entanglement structure in quantum many-body systems, field theories, and holography [0.0]
  The aim of this dissertation is to clarify the structure of entanglement, a type of quantum correlations, in various quantum systems. Previous examinations of entanglement and holography have focused on specific classes of quantum systems.
  arXiv  Detail & Related papers  (2023-08-18T18:04:44Z)
• 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)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• Holographic entanglement in spin network states: a focused review [0.38073142980732994]
  We focus on spin network states dual to finite regions of space, represented as entanglement graphs in the group field theory approach to quantum gravity. In particular, spin network states can be interpreted as maps from bulk to boundary, whose holographic behaviour increases with the inhomogeneity of their geometric data. We review how exceeding a certain threshold of bulk entanglement leads to the emergence of a black hole-like region, revealing intriguing perspectives for quantum cosmology.
  arXiv  Detail & Related papers  (2022-02-10T16:06:45Z)
• Understanding holographic error correction via unique algebras and atomic examples [0.25782420501870296]
  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.
  arXiv  Detail & Related papers  (2021-10-27T18:17:37Z)
• The Hintons in your Neural Network: a Quantum Field Theory View of Deep Learning [84.33745072274942]
  We show how to represent linear and non-linear layers as unitary quantum gates, and interpret the fundamental excitations of the quantum model as particles. On top of opening a new perspective and techniques for studying neural networks, the quantum formulation is well suited for optical quantum computing.
  arXiv  Detail & Related papers  (2021-03-08T17:24:29Z)
• 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)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)

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.