Universality of black hole quantum computing
From MaRDI portal
Publication:5361736
DOI10.1002/PROP.201600111zbMATH Open1371.83096arXiv1605.01407OpenAlexW3121677722WikidataQ62588495 ScholiaQ62588495MaRDI QIDQ5361736FDOQ5361736
Benedikt Richter, C. Gomez, Dieter Lüst, Gia Dvali, Yasser Omar
Publication date: 29 September 2017
Published in: Fortschritte der Physik (Search for Journal in Brave)
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 generates a universal set of quantum gates for the black hole type computer. We find that the gates work at maximal energy efficiency. Furthermore, we establish a fundamental bound on the complexity of quantum circuits encoded on these systems, and characterize the unitary operations that are implementable. It becomes apparent that the computational power is very limited due to the fact that the black hole life-time is of the same order of the gate operation time. As a consequence, it is impossible to retrieve its information, within the life-time of a black hole, by externally coupling to the black hole qubits. However, we show that, in principle, coupling to some of the internal degrees of freedom allows acquiring knowledge about the micro-state. Still, due to the trivial complexity of operations that can be performed, there is no time advantage over the collection of Hawking radiation and subsequent decoding.
Full work available at URL: https://arxiv.org/abs/1605.01407
Quantum computation (81P68) Physics (00A79) Quantum coherence, entanglement, quantum correlations (81P40) Unified quantum theories (81V22) Black holes (83C57)
Cited In (6)
- Infinite black hole entropies at infinite distances and tower of states
- Black hole qubit correspondence from quantum circuits
- Supertranslations and Holography near the Horizon of Schwarzschild Black Holes
- Testing the complexity conjecture in regular black holes geometry
- Tensor network models of unitary black hole evaporation
- On complexity of holographic flavors
This page was built for publication: Universality of black hole quantum computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361736)
