Universality of Black Hole Quantum Computing
Gia Dvali, Cesar Gomez, Dieter Lust, Yasser Omar, Benedikt Richter

TL;DR
This paper models black holes as quantum computers, deriving bounds on their operational time-scales, constructing universal gates, and analyzing their limited computational power and information retrieval capabilities.
Contribution
It introduces a model-independent framework for black hole quantum computing, establishing bounds on time-scales, universal gates, and complexity, and comparing black hole computing to quantum critical systems.
Findings
Black hole quantum computers have operation times of the order of their half-life.
Universal quantum gates can be explicitly constructed for black hole systems.
Black hole computational power is limited, preventing information retrieval within their lifetime.
Abstract
By analyzing the key properties of black holes from the point of view of quantum information, we derive a model-independent picture of black hole quantum computing. It has been noticed that this picture exhibits striking similarities with quantum critical condensates, allowing the use of a common language to describe quantum computing in both systems. We analyze such quantum computing by allowing coupling to external modes, under the condition that the external influence must be soft-enough in order not to offset the basic properties of the system. We derive model-independent bounds on some crucial time-scales, such as the times of gate operation, decoherence, maximal entanglement and total scrambling. We show that for black hole type quantum computers all these time-scales are of the order of the black hole half-life time. Furthermore, we construct explicitly a set of Hamiltonians that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
