Constraints on physical computers in holographic spacetimes
- URL: http://arxiv.org/abs/2304.09900v2
- Date: Wed, 6 Dec 2023 18:46:51 GMT
- Title: Constraints on physical computers in holographic spacetimes
- Authors: Aleksander M. Kubicki, Alex May and David P\'erez-Garcia
- Abstract summary: 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.
- Score: 49.1574468325115
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Within the setting of the AdS/CFT correspondence, we ask about the power of
computers in the presence of gravity. We show that there are computations on
$n$ qubits which cannot be implemented inside of black holes with entropy less
than $O(2^n)$. To establish our claim, we argue computations happening inside
the black hole must be implementable in a programmable quantum processor, so
long as the inputs and description of the unitary to be run are not too large.
We then prove a bound on quantum processors which shows many unitaries cannot
be implemented inside the black hole, and further show some of these have short
descriptions and act on small systems. These unitaries with short descriptions
must be computationally forbidden from happening inside the black hole.
Related papers
- Realization of Constant-Depth Fan-Out with Real-Time Feedforward on a Superconducting Quantum Processor [33.096693427147535]
We demonstrate a quantum fan-out gate with real-time feedforward on up to four output qubits using a superconducting quantum processor.
Our work highlights the potential of mid-circuit measurements combined with real-time conditional operations to improve the efficiency of complex quantum algorithms.
arXiv Detail & Related papers (2024-09-11T03:40:24Z) - Calculating the many-body density of states on a digital quantum
computer [58.720142291102135]
We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer.
We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
arXiv Detail & Related papers (2023-03-23T17:46:28Z) - A simple quantum system that describes a black hole [0.0]
We conjectured to describe a black hole in an emergent universe governed by Einstein equations.
Based on previous numerical computations, we make an estimate of the necessary number of qubits necessary to see some black hole features.
arXiv Detail & Related papers (2023-03-21T01:42:23Z) - 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) - Quantum Depth in the Random Oracle Model [57.663890114335736]
We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation.
For some problems, the ability to perform adaptive measurements in a single shallow quantum circuit is more useful than the ability to perform many shallow quantum circuits without adaptive measurements.
arXiv Detail & Related papers (2022-10-12T17:54:02Z) - Quantum Computing for Rotating, Charged and String Theory Black Holes [0.0]
We study four types of black holes using quantum computing, which include the 3D Rotating Banados-Teitelboim-Zanelli (BTZ) black hole.
In addition to the Hamiltonian there is a Mass operator which plays an important role in describing the quantum states of the black hole.
We compute the spectrum of these operators using classical and quantum computing.
arXiv Detail & Related papers (2022-07-07T04:48:15Z) - Long-Time Error-Mitigating Simulation of Open Quantum Systems on Near Term Quantum Computers [38.860468003121404]
We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates.
We simulate two systems of electrons coupled to an infinite thermal bath: 1) a system of dissipative free electrons in a driving electric field; and 2) the thermalization of two interacting electrons in a single orbital in a magnetic field -- the Hubbard atom.
Our results demonstrate that algorithms for simulating open quantum systems are able to far outperform similarly complex non-dissipative algorithms on noisy hardware.
arXiv Detail & Related papers (2021-08-02T21:36:37Z) - Quantum Computing for Inflationary, Dark Energy and Dark Matter
Cosmology [1.1706540832106251]
Quantum computing is an emerging new method of computing which excels in simulating quantum systems.
We show how to apply the Variational Quantum Eigensolver (VQE) and Evolution of Hamiltonian (EOH) algorithms to solve the Wheeler-DeWitt equation.
We find excellent agreement with classical computing results and describe the accuracy of the different quantum algorithms.
arXiv Detail & Related papers (2021-05-28T14:04:11Z) - Observation of thermalization and information scrambling in a
superconducting quantum processor [24.685988382662803]
We show that the $XX$ chain, as free fermions on a 1D lattice, fails to thermalize, and local information does not scramble in the integrable channel.
Our experiments reveal ergodicity and scrambling in the controllable qubit ladder, and opens the door to further investigations on the thermodynamics and chaos in quantum many-body systems.
arXiv Detail & Related papers (2021-01-20T09:00:09Z) - Universality, intertwiners and black hole information [0.0]
The central question in this article is how information does leak out from black holes.
We propose the existence of certain operators whose correlations extend across the black hole atmosphere and range into the interior.
We derive the Page curve and argue that information is transferred to the radiation via black hole intertwiners.
arXiv Detail & Related papers (2020-10-23T17:51:04Z)
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.