相关论文: Complexity, action, and black holes

We discuss black hole quantization in the Wheeler-DeWitt approach. Our consideration is based on a detailed investigation of the canonical formulation of gravity with special considerations of surface terms. Since the phase space of gravity…

I give a critical review of the holographic hypothesis, which posits that a universe with gravity can be described by a quantum field theory in fewer dimensions. I first recall how the idea originated from considerations on black hole…

It was recently shown that a black hole (or any Killing horizon) will decohere any quantum superposition in their vicinity. I review three distinct but equivalent arguments that illustrate how this phenomenon arises: (1) entanglement with…

There is good evidence that quantum computers are more powerful than classical computers, and that various simple modifications of quantum theory yield computational power that is dramatically greater still. However, these modifications…

A solvable 2-dimensional conformally invariant midi-superspace model for black holes is obtained by imposing spherical symmetry in 4-dimensional conformally invariant Einstein gravity. The Wheeler-DeWitt equation for the theory is solved…

Quantum entanglement lies at the heart of quantum information theory, with applications to quantum computing, teleportation, cryptography and communication. In the apparently separate world of quantum gravity, the Hawking effect of…

This is a chapter in the Encyclopedia of Robotics. It is devoted to the study of complexity of complete (or exact) algorithms for robot motion planning. The term ``complete'' indicates that an approach is guaranteed to find the correct…

We discuss the notion of an effective, average, quantum mechanical path which is a solution of the dynamical equations obtained by extremizing the quantum effective action. Since the effective action can, in general, be complex, the…

Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes.…

Most continuous mathematical formulations arising in science and engineering can only be solved numerically and therefore approximately. We shall always assume that we're dealing with a numerical approximation to the solution. There are two…

In a seminal paper[JHEP09(2007)120], Hayden and Preskill showed that information can be retrieved from a black hole that is sufficiently scrambling, assuming that the retriever has perfect control of the emitted Hawking radiation and…

Quantum computing promises to provide the next step up in computational power for diverse application areas. In this review, we examine the science behind the quantum hype, and the breakthroughs required to achieve true quantum advantage in…

We employ holography to calculate the quantum complexity of $T\bar{T}$-deformation, utilizing the complexity equals volume (CV) and the complexity equals action (CA) proposals within the bulk spacetime with a finite radius cutoff. We find…

A central problem in quantum computing is to identify computational tasks which can be solved substantially faster on a quantum computer than on any classical computer. By studying the hardest such tasks, known as BQP-complete problems, we…

We show that if a massive body is put in a quantum superposition of spatially separated states, the mere presence of a black hole in the vicinity of the body will eventually destroy the coherence of the superposition. This occurs because,…

The intensive pursuit for quantum advantage in terms of computational complexity has further led to a modernized crucial question: {\it When and how will quantum computers outperform classical computers?} The next milestone is undoubtedly…

We describe in detail the quantum tunneling of massive particles from Kerr black hole by using complex trajectories, which are solutions to the Hamilton's equations of motion with imaginary proper time. The trajectories are smooth and cover…

We consider the problem of how fast a quantum system can scramble (thermalize) information, given that the interactions are between bounded clusters of degrees of freedom; pairwise interactions would be an example. Based on previous work,…

A theoretical model of computation is proposed based on Lorentz quantum mechanics. Besides the standard qubits, this model has an additional bit, which we call hyperbolic bit (or hybit in short). A set of basic logical gates are constructed…

We explore the quantum nature of black holes by introducing an effective framework that takes into account deviations from the classical results. The approach is based on introducing quantum corrections to the classical Schwarzschild…