Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1605.01407 · Fortschritte der Physik

Universality of black hole quantum computing

Gia Dvali, Cesar Gomez, Dieter Lüst, Yasser Omar, Benedikt Richter

Published Dec 21, 2016• 19 citations
arXivHTMLPDF

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.

DOI
10.1002/prop.201600111

Related papers

Black Hole Type Quantum Computing in Critical Bose-Einstein Systems

Gia Dvali, Mischa Panchenko

Recent ideas about understanding physics of black hole information-processing in terms of quantum criticality allow us to implement black hole mechanisms of quantum computing within critical Bose-Einstein systems. The generic feature, uncovered both by analytic and numeric studies, is the emergence at the critical point of gapless weakly-interacting modes, which act as qubits for information-storage at a very low energy cost. These modes can be effectively described in terms of either Bogoliubov or Goldstone degrees of freedom. The ground-state at the critical point is maximally entangled and far from being classical. We confirm this near-critical behavior by a new analytic method. We compute growth of entanglement and show its consistency with black hole type behavior. On the other hand, in the over-critical regime the system develops a Lyapunov exponent and scrambles quantum information very fast. By, manipulating the system parameters externally, we can put it in and out of various regimes and in this way control the sequence of information storage and processing. By using gapless Bogoliubov modes as control qubits we design some simple logic gates.

arXiv:1507.08952•Jul 31, 2015•15 citations

Scrambling in the black hole portrait

Gia Dvali, Daniel Flassig, César Gómez +2 more

Recently a quantum portrait of black holes was suggested according to which a macroscopic black hole is a Bose--Einstein condensate of soft gravitons stuck at the critical point of a quantum phase transition. We explain why quantum criticality and instability are the key for an efficient generation of entanglement and consequently of the scrambling of information. By studying a simple Bose--Einstein prototype, we show that the scrambling time, which is set by the quantum break time of the system, goes as $\mathrm{log}\text{ }N$ for $N$ the number of quantum constituents or equivalently the black hole entropy.

arXiv:1307.3458•Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields•Dec 26, 2013•98 citations

Black hole based quantum computing in labs and in the sky

Gia Dvali, Mischa Panchenko

Analyzing some well established facts, we give a model‐independent parameterization of black hole quantum computing in terms of a set of macro and micro quantities and their relations. These include the relations between the extraordinarily‐small energy gap of black hole qubits and important time‐scales of information‐processing, such as, scrambling time and Page's time. We then show, confirming and extending previous results, that other systems of nature with identical quantum informatics features are attractive Bose‐Einstein systems at the critical point of quantum phase transition. Here we establish a complete isomorphy between the quantum computational properties of these two systems. In particular, we show that the quantum hair of a critical condensate is strikingly similar to the quantum hair of a black hole. Irrespectively whether one takes the similarity between the two systems as a remarkable coincidence or as a sign of a deeper underlying connection, the following is evident. Black holes are not unique in their way of quantum information processing and we can manufacture black hole based quantum computers in labs by taking advantage of quantum criticality.

arXiv:1601.01329•Fortschritte der Physik•Jul 25, 2016•12 citations

Universality in Quantum Computation

David Deutsch, Adriano Barenco, Artur Ekert

We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates. Introduction It has been known for several years that the theory of quantum computers --- i.e. machines that rely on characteristically quantum phenomena to perform computations [1] --- is substantially different from the classical theory of computation, which is essentially the theory of the universal Turing machine. We may identify three important differences. Firstly, the properties of quantum computers are not postulated in abstracto but are deduced entirely from the laws of physics. Logically, this was already true of the classical theory, as Landauer [2] has pointed out, but the intuitive nature of the classically-available computational operations, and the millennia-long history of their study, allowed pioneers such as Turing, Chu...

•Jan 1, 1995•309 citations

Page Time as a Transition of Information Channels: High-fidelity Information Retrieval for Radiating Black Holes

Ran Li, Xuanhua Wang, Kun Zhang +1 more

The effective field theory description of a radiating black hole introduces redundant degrees of freedom that necessitate annihilation of those modes at late stages to conserve entropy. The prevailing view is that such effective process can result in information loss unless the redundant states are annihilated in maximally entangled pairs, resembling quantum teleportation. In this Letter, we demonstrate that this view can be relaxed in a new postselection model. We investigate information recoverability in a radiating black hole through the non-unitary dynamics that projects the randomly-selected modes from a scrambling unitary. We show that the model has the merit of producing the von Neumann entropy of black holes consistent with the island formula calculation and that information in the black hole interior can be decoded from the Hawking radiation without loss after the Page time. Moreover, in this model the Page time gains a new interpretation as the transition point between two channels of information transmission when sufficient amounts of effective modes are annihilated inside the horizon. We present two decoding strategies along with their quantum circuit realizations. The experimental verification of the strategies employs 7-qubit IBM quantum processors, demonstrating the viability of these strategies and the potential for quantum processors to probe the black hole interior.

arXiv:2309.01917•Sep 5, 2023•0 citations

Universality in quantum computation

Jennifer L. Dodd

A quantum computer is similar to an ordinary computer, except that instead of bits it uses two-level quantum systems (qubits), and the usual logical operations on bits are replaced with noiseless quantum dynamics in the form of unitary gates or Hamiltonian interactions. Many sets of resources that are universal for quantum computation (that is, capable of implementing any quantum computation) have been found, but general conditions for universality are still only partially understood. Improving our understanding of these conditions contributes to two broad goals. On the one hand, understanding what class of physical systems is suitable for quantum computation allows us choose the systems that are most easily controlled or built in the laboratory. On the other hand, identifying the unifying characteristics of such a class provides insight into the fundamental physics responsible for the much greater computational power of quantum computers.        The original results presented in this thesis are a contribution to our understanding of the physical requirements for universal quantum computation. These results lead to the identification of a new, large class of universal dynamics. More specifically, the main problem that is addressed is the following: consider a physical system that is made up of a finite number of qubits that are subject to a natural, fixed interaction described by a two-body Hamiltonian. Suppose we have the ability to control the system only by applying fast one-qubit operations. Under what conditions is this system capable of universal quantum computation? The first original result of the thesis is to prove that universal quantum computation is possible under these conditions given the single extra constraint that the Hamiltonian must entangle, or connect, all of the qubits. In other words, since a two-body Hamiltonian is expressible as a sum of coupling terms each of which acts nontrivially on a pair of qubits, consider the graph whose vertices correspond to qubits and whose edges connect qubits that are coupled by a term in the Hamiltonian. Then this Hamiltonian, together with fast one-qubit unitaries, is universal for quantum computation precisely when the corresponding graph is connected.       This result suggests many potential generalizations, three of which are explored in this thesis. The first generalization is to show that the same result holds for a two-body Hamiltonian that acts on D-dimensional quantum systems (qudits), given fast one-qudit unitaries. A second extension is to the case of a many-body Hamiltonian, that is, a Hamiltonian that has coupling terms that act on more than two qubits. Again, we find that under mild restrictions, such Hamiltonians are universal provided they are connected and that arbitrary one-qubit unitaries are available. We also discover and explore some surprising structure in many-body Hamiltonians that is associated with the parity of the couplings. A third related problem that is addressed is the question of what two-qubit unitaries are universal for quantum computation. This problem was originally solved by J.-L. and R. Brylinski [BB02], who gave a technical proof of the universality of any two-qudit gate that is not the swap gate or a product of one-qudit unitaries, given one-qudit unitaries as a free resource. We develop an elementary and constructive proof for the case of qubits, and prove that our construction is very close to optimal in the number of uses of the two-qubit gate.       Given a qualitative understanding of what dynamical resources are universal for quantum computation, it is natural to consider developing a quantitative measure of the usefulness of quantum dynamics for quantum information processing. This is done in the final chapter of the thesis, in which the beginnings of a quantitative theory of quantum dynamics are developed.

•Jan 1, 2004•7 citations
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.
Recent ideas about understanding physics of black hole information-processing in terms of quantum criticality allow us to implement black hole mechanisms of quantum computing within critical Bose-Einstein systems. The generic feature, uncovered both by analytic and numeric studies, is the emergence at the critical point of gapless weakly-interacting modes, which act as qubits for information-storage at a very low energy cost. These modes can be effectively described in terms of either Bogoliubov or Goldstone degrees of freedom. The ground-state at the critical point is maximally entangled and far from being classical. We confirm this near-critical behavior by a new analytic method. We compute growth of entanglement and show its consistency with black hole type behavior. On the other hand, in the over-critical regime the system develops a Lyapunov exponent and scrambles quantum information very fast. By, manipulating the system parameters externally, we can put it in and out of various regimes and in this way control the sequence of information storage and processing. By using gapless Bogoliubov modes as control qubits we design some simple logic gates.
Recently a quantum portrait of black holes was suggested according to which a macroscopic black hole is a Bose--Einstein condensate of soft gravitons stuck at the critical point of a quantum phase transition. We explain why quantum criticality and instability are the key for an efficient generation of entanglement and consequently of the scrambling of information. By studying a simple Bose--Einstein prototype, we show that the scrambling time, which is set by the quantum break time of the system, goes as log N\mathrm{log}\text{ }Nlog N for NNN the number of quantum constituents or equivalently the black hole entropy.
Analyzing some well established facts, we give a model‐independent parameterization of black hole quantum computing in terms of a set of macro and micro quantities and their relations. These include the relations between the extraordinarily‐small energy gap of black hole qubits and important time‐scales of information‐processing, such as, scrambling time and Page's time. We then show, confirming and extending previous results, that other systems of nature with identical quantum informatics features are attractive Bose‐Einstein systems at the critical point of quantum phase transition. Here we establish a complete isomorphy between the quantum computational properties of these two systems. In particular, we show that the quantum hair of a critical condensate is strikingly similar to the quantum hair of a black hole. Irrespectively whether one takes the similarity between the two systems as a remarkable coincidence or as a sign of a deeper underlying connection, the following is evident. Black holes are not unique in their way of quantum information processing and we can manufacture black hole based quantum computers in labs by taking advantage of quantum criticality.
We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates. Introduction It has been known for several years that the theory of quantum computers --- i.e. machines that rely on characteristically quantum phenomena to perform computations [1] --- is substantially different from the classical theory of computation, which is essentially the theory of the universal Turing machine. We may identify three important differences. Firstly, the properties of quantum computers are not postulated in abstracto but are deduced entirely from the laws of physics. Logically, this was already true of the classical theory, as Landauer [2] has pointed out, but the intuitive nature of the classically-available computational operations, and the millennia-long history of their study, allowed pioneers such as Turing, Chu...
The effective field theory description of a radiating black hole introduces redundant degrees of freedom that necessitate annihilation of those modes at late stages to conserve entropy. The prevailing view is that such effective process can result in information loss unless the redundant states are annihilated in maximally entangled pairs, resembling quantum teleportation. In this Letter, we demonstrate that this view can be relaxed in a new postselection model. We investigate information recoverability in a radiating black hole through the non-unitary dynamics that projects the randomly-selected modes from a scrambling unitary. We show that the model has the merit of producing the von Neumann entropy of black holes consistent with the island formula calculation and that information in the black hole interior can be decoded from the Hawking radiation without loss after the Page time. Moreover, in this model the Page time gains a new interpretation as the transition point between two channels of information transmission when sufficient amounts of effective modes are annihilated inside the horizon. We present two decoding strategies along with their quantum circuit realizations. The experimental verification of the strategies employs 7-qubit IBM quantum processors, demonstrating the viability of these strategies and the potential for quantum processors to probe the black hole interior.
A quantum computer is similar to an ordinary computer, except that instead of bits it uses two-level quantum systems (qubits), and the usual logical operations on bits are replaced with noiseless quantum dynamics in the form of unitary gates or Hamiltonian interactions. Many sets of resources that are universal for quantum computation (that is, capable of implementing any quantum computation) have been found, but general conditions for universality are still only partially understood. Improving our understanding of these conditions contributes to two broad goals. On the one hand, understanding what class of physical systems is suitable for quantum computation allows us choose the systems that are most easily controlled or built in the laboratory. On the other hand, identifying the unifying characteristics of such a class provides insight into the fundamental physics responsible for the much greater computational power of quantum computers.        The original results presented in this thesis are a contribution to our understanding of the physical requirements for universal quantum computation. These results lead to the identification of a new, large class of universal dynamics. More specifically, the main problem that is addressed is the following: consider a physical system that is made up of a finite number of qubits that are subject to a natural, fixed interaction described by a two-body Hamiltonian. Suppose we have the ability to control the system only by applying fast one-qubit operations. Under what conditions is this system capable of universal quantum computation? The first original result of the thesis is to prove that universal quantum computation is possible under these conditions given the single extra constraint that the Hamiltonian must entangle, or connect, all of the qubits. In other words, since a two-body Hamiltonian is expressible as a sum of coupling terms each of which acts nontrivially on a pair of qubits, consider the graph whose vertices correspond to qubits and whose edges connect qubits that are coupled by a term in the Hamiltonian. Then this Hamiltonian, together with fast one-qubit unitaries, is universal for quantum computation precisely when the corresponding graph is connected.       This result suggests many potential generalizations, three of which are explored in this thesis. The first generalization is to show that the same result holds for a two-body Hamiltonian that acts on D-dimensional quantum systems (qudits), given fast one-qudit unitaries. A second extension is to the case of a many-body Hamiltonian, that is, a Hamiltonian that has coupling terms that act on more than two qubits. Again, we find that under mild restrictions, such Hamiltonians are universal provided they are connected and that arbitrary one-qubit unitaries are available. We also discover and explore some surprising structure in many-body Hamiltonians that is associated with the parity of the couplings. A third related problem that is addressed is the question of what two-qubit unitaries are universal for quantum computation. This problem was originally solved by J.-L. and R. Brylinski [BB02], who gave a technical proof of the universality of any two-qudit gate that is not the swap gate or a product of one-qudit unitaries, given one-qudit unitaries as a free resource. We develop an elementary and constructive proof for the case of qubits, and prove that our construction is very close to optimal in the number of uses of the two-qubit gate.       Given a qualitative understanding of what dynamical resources are universal for quantum computation, it is natural to consider developing a quantitative measure of the usefulness of quantum dynamics for quantum information processing. This is done in the final chapter of the thesis, in which the beginnings of a quantitative theory of quantum dynamics are developed.