Retrieving information from a black hole using quantum machine learning

• URL: http://arxiv.org/abs/2206.06385v3
• Date: Thu, 29 Dec 2022 15:10:18 GMT
• Title: Retrieving information from a black hole using quantum machine learning
• Authors: Lorenzo Leone, Salvatore F.E. Oliviero, Stefano Piemontese, Sarah True and Alioscia Hamma
• Abstract summary: We show that an information retrieval decoder can be learned with fidelity scaling as $exp(-alpha t)$ using quantum machine learning. We show that the crossover between learnability and non-learnability is driven by the amount of non-stabilizerness present in the black hole.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In a seminal paper[JHEP09(2007)120], Hayden and Preskill showed that information can be retrieved from a black hole that is sufficiently scrambling, assuming that the retriever has perfect control of the emitted Hawking radiation and perfect knowledge of the internal dynamics of the black hole. In this paper, we show that for $t-$doped Clifford black holes - that is, black holes modeled by random Clifford circuits doped with an amount $t$ of non-Clifford resources - an information retrieval decoder can be learned with fidelity scaling as $\exp(-\alpha t)$ using quantum machine learning while having access only to out-of-time-order correlation functions. We show that the crossover between learnability and non-learnability is driven by the amount of non-stabilizerness present in the black hole and sketch a different approach to quantum complexity.

Related papers

• Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
  We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
  arXiv  Detail & Related papers  (2024-05-31T16:43:20Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• Information retrieval from Hawking radiation in the non-isometric model of black hole interior: theory and quantum simulations [11.13371546439765]
  The non-isometric holographic model of the black hole interior stands out as a potential resolution of the long-standing black hole information puzzle. We show how Yoshida-Kitaev decoding strategy can be employed in the modified Hayden-Preskill protocol. This study would stimulate more interests to explore black hole information problem on the quantum processors.
  arXiv  Detail & Related papers  (2023-07-04T03:16:36Z)
• Stimulated Emission of Radiation and the Black Hole Information Problem [0.0]
  Black holes not only emit radiation spontaneously, but also respond to infalling matter and radiation by emitting approximate clones of those fields in a stimulated manner. I show how stimulated emission turns the black hole into an almost optimal quantum cloning machine. I speculate about possible observable consequences of stimulated emission of radiation in black holes.
  arXiv  Detail & Related papers  (2023-06-24T03:05:48Z)
• Constraints on physical computers in holographic spacetimes [49.1574468325115]
  We show that there are computations on $n$ qubits which cannot be implemented inside of black holes with entropy less than $O(2n)$. We argue computations happening inside the black hole must be implementable in a programmable quantum processor.
  arXiv  Detail & Related papers  (2023-04-19T18:00:50Z)
• Learning efficient decoders for quasi-chaotic quantum scramblers [3.823356975862005]
  We show that one can retrieve the scrambled information even without any previous knowledge of the scrambler. A classical decoder can retrieve with fidelity one all the information scrambled by a random unitary. Results show that one can learn the salient properties of quantum unitaries in a classical form.
  arXiv  Detail & Related papers  (2022-12-21T20:19:53Z)
• Complementarity and the unitarity of the black hole $S$-matrix [0.0]
  We study properties of the black hole $S$-matrix. We investigate a scenario in which an infalling agent interacts with radiation both outside and inside the black hole.
  arXiv  Detail & Related papers  (2022-12-01T00:40:53Z)
• A Quantum Repeater Platform based on Single SiV$^-$ Centers in Diamond with Cavity-Assisted, All-Optical Spin Access and Fast Coherent Driving [45.82374977939355]
  Quantum key distribution enables secure communication based on the principles of quantum mechanics. Quantum repeaters are required to establish large-scale quantum networks. We present an efficient spin-photon interface for quantum repeaters.
  arXiv  Detail & Related papers  (2022-10-28T14:33:24Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Repeated Extraction of Scrambled Quantum Data: Sustainability of the Hayden-Preskill Type Protocols [0.0]
  Scrambler hacking is the procedure of quantum information extraction from and installation on a quantum scrambler given only partial access. We supply analytical formulas for the optimal hacking fidelity, a measure of the effectiveness of scrambler hacking with limited access. We show that the limited hacking fidelity implies the reflectivity decay of a black hole as an information mirror.
  arXiv  Detail & Related papers  (2022-04-01T11:48:03Z)
• Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
  We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise. Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
  arXiv  Detail & Related papers  (2021-03-31T02:41:36Z)

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.