Related papers: Quantum Computation vs. Firewalls
Effective theories describing black hole exteriors resemble open quantum systems inasmuch as many unmeasurable degrees of freedom beyond the horizon interact with those we can see. A solvable Caldeira-Leggett type model of a quantum field…
Black holes in equilibrium and the counting of their entropy within Loop Quantum Gravity are reviewed. In particular, we focus on the conceptual setting of the formalism, briefly summarizing the main results of the classical formalism and…
We give a short introduction to the approaches currently used to describe black holes in loop quantum gravity. We will concentrate on the classical issues related to the modeling of black holes as isolated horizons, give a short discussion…
We use the formalism of Holographic Space-time (HST) to investigate the claim of [1] that old black holes contain a firewall, i.e. an in-falling observer encounters highly excited states at a time much shorter than the light crossing time…
We investigate if physical laws can impose limit on computational time and speed of a quantum computer built from elementary particles. We show that the product of the speed and the running time of a quantum computer is limited by the type…
Query complexity is a common tool for comparing quantum and classical computation, and it has produced many examples of how quantum algorithms differ from classical ones. Here we investigate in detail the role that oracles play for the…
Quantum theory on manifolds with boundaries have been studied extensively through von Neumann analysis of self adjoint operators. We approach the issues through introduction of singular $\delta$ and $\delta'$ potentials. The advantages of…
The effect of the inevitable coupling to external degrees of freedom of a quantum computer are examined. It is found that for quantum calculations (in which the maintenance of coherence over a large number of states is important), not only…
Both AdS/CFT duality and more general reasoning from quantum gravity point to a rich collection of boundary observables that always evolve unitarily. The physical quantum gravity states described by these observables must be solutions of…
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling, that is beyond the practical reach of modern supercomputers. We examine the…
We argue that novel (highly nonclassical) quantum extremal surfaces play a crucial role in reconstructing the black hole interior even for isolated, single-sided, non-evaporating black holes (i.e. with no auxiliary reservoir). Specifically,…
Black hole thermodynamics suggests that the maximum entropy that can be contained in a region of space is proportional to the area enclosing it rather than its volume. I argue that this follows naturally from loop quantum gravity and a…
Black hole complementarity requires that the interior of a black hole be represented by the same degrees of freedom that describe its exterior. Entanglement plays a crucial role in the reconstruction of the interior degrees of freedom. This…
There are inherent limits in classical computation for it to serve as an adequate model of human cognition. In particular, non-commutativity, while ubiquitous in physics and psychology, cannot be sufficiently handled. We propose that we…
Masking quantum information, which is impossible without randomness as a resource, is a task that encodes quantum information into bipartite quantum state while forbidding local parties from accessing to that information. In this work, we…
We suggest a quantum circuit model which simulates the black-hole evaporation process. In particular, Almheiri-Marolf-Polchinski-Sully (AMPS) paradox and the ER=EPR correspondence are reconsidered regarding our proposed model, which assumes…
We argue that the complementarity picture, as interpreted as a reference frame change represented in quantum gravitational Hilbert space, does not suffer from the "firewall paradox" recently discussed by Almheiri, Marolf, Polchinski, and…
Quantum computers promise not only to outperform classical machines for certain important tasks, but also to preserve privacy of computation. For example, the blind quantum computing protocol enables secure delegated quantum computation,…
The physical limits to computation have been under active scrutiny over the past decade or two, as theoretical investigations of the possible impact of quantum mechanical processes on computing have begun to make contact with realizable…
Richard Feynman's observation that quantum mechanical effects could not be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used quantum effects. This speculation…