Related papers: Complexity, action, and black holes
Interactions between outgoing Hawking particles and ingoing matter are determined by gravitational forces and Standard Model interactions. In particular the gravitational interactions are responsible for the unitarity of the scattering…
It is congruous with the quantum nature of the world to view the space-time geometry as an emergent structure that shows classical features only at some observational level. One can thus conceive the space-time manifold as a purely…
We use Deutsch's algorithm as a stand in for more complex quantum algorithms in order to determine how quantum properties of an environment manifest themselves in results that can be obtained on quantum computers. We model pure dephasing in…
We establish a version of the Momentum/Complexity (PC) duality between the rate of operator complexity growth and a radial component of bulk momentum for a test system falling into a black hole. In systems of finite entropy, our map remains…
Arguments for black hole formation in collisions of high-energy particles have rested on the emergence of a closed trapped surface in the classical geometry of two colliding Aichelburg-Sexl solutions. Recent analysis has, however, shown…
We introduce the notion of quantum computational webs: These are quantum states universal for measurement-based computation which can be built up from a collection of simple primitives. The primitive elements - reminiscent of building…
Scattering processes in high-energy physics are inherently quantum mechanical, yet are typically analyzed at the level of final states, where entanglement appears as a property of the outcome rather than a consequence of the underlying…
Quantum computers are expected to revolutionize our ability to process information. The advancement from classical to quantum computing is a product of our advancement from classical to quantum physics -- the more our understanding of the…
A quantum computer has a clear advantage over a classical computer for exhaustive search. The quantum mechanical algorithm for exhaustive search was originally derived by using subtle properties of a particular quantum mechanical operation…
Recent work has exposed the idea that interesting quantum-like probability laws, including interference effects, can be manifest in classical systems. Here we propose a model for quantum-like (QL) states and QL bits. We suggest a way that…
We describe two different, but equivalent semiclassical views of black hole physics in which the equivalence principle and unitarity are both accommodated. In one, unitarity is built-in, while the black hole interior emerges only…
We investigate a large-$N$ CFT in a high-energy pure state coupled to a small auxiliary system of $M$ weakly-interacting degrees of freedom, and argue the relative state complexity of the auxiliary system is holographically dual to an…
In recent years we've seen the birth of a new field known as hamiltonian complexity lying at the crossroads between computer science and theoretical physics. Hamiltonian complexity is directly concerned with the question: how hard is it to…
I assess the potential of quantum computation. Broad and important applications must be found to justify construction of a quantum computer; I review some of the known quantum algorithms and consider the prospects for finding new ones.…
Within the setting of the AdS/CFT correspondence, we ask about the power of computers in the presence of gravity. We show that there are computations on $n$ qubits which cannot be implemented inside of black holes with entropy less than…
Quantum gravity is likely the deepest problem facing current physics. While traditionally associated with short distance nonrenormalizability, it is evident that the long distance problem of unitarity, arising at high energies with black…
We describe quantum and classical Hamiltonian dynamics in a common Hilbert space framework, that allows the treatment of mixed quantum-classical systems. The analysis of some examples illustrates the possibility of entanglement between…
HodgeRank generalizes ranking algorithms, e.g. Google PageRank, to rank alternatives based on real-world (often incomplete) data using graphs and discrete exterior calculus. It analyzes multipartite interactions on high-dimensional networks…
The issue of black hole entropy is reexamined within a finite lattice framework along the lines of Wheeler, 't Hooft and Susskind, with an additional criterion to identify physical horizon states contributing to the entropy. As a…
In this research, we explore the semiclassical approximation to canonical quantum gravity and how a classical background emerges from the Wheeler-DeWitt (WDW) states. By employing the Wigner functional analysis, we derive the backreacted…