相关论文: Complexity is Simple

The quantum gravity has great difficulties with application of the probability notion. In given article this problem is analyzed according to algorithmic viewpoint. According to A.N. Kolmogorov, the probability notion can be connected with…

We give a brief summary of results and ongoing research in the application of linearized theory to the study of black hole collisions in the limit in which the holes start close to each other. This approximation can be a valuable tool for…

In these notes we discuss various methods relevant to the numerical construction of stationary black hole solutions in General Relativity with negative cosmological constant. We focus on solutions which explicitly break translational…

We study the holographic "complexity=action'" (CA) and "complexity=volume" (CV) proposals in Einstein-dilaton gravity in all spacetime dimensions. We analytically construct an infinite family of black hole solutions and use CA and CV…

The holographic principle is tested by examining the logarithmic and higher order corrections to the Bekenstein-Hawking entropy of black holes. For the BTZ black hole, I find some disagreement in the principle for a holography screen at…

The Weak Gravity Conjecture imposes stringent constraints on effective field theories to allow for an ultraviolet completion within quantum gravity. While substantial evidence supports the conjecture across broad classes of string…

In this paper we consider the maximal volume and the action, which are conjectured to be gravity duals of the complexity, in the black hole geometries with end of the world branes. These geometries are duals of boundary states in CFTs which…

It is not known what the limitations are on using quantum computation to speed up classical computation. An example would be the power to speed up PSPACE-complete computations. It is also not known what the limitations are on the duration…

The idea of holography in gravity arose from the fact that the entropy of black holes is given by their surface area. The holography encountered in gauge/gravity duality has no such relation however; the boundary surface can be placed at an…

Universal algebra and clone theory have proven to be a useful tool in the study of constraint satisfaction problems since the complexity, up to logspace reductions, is determined by the set of polymorphisms of the constraint language. For…

The issues of holography and possible links with gauge theories in spacetime physics is discussed, in an approach quite distinct from the more restricted AdS-CFT correspondence. A particular notion of holography in the context of black hole…

In general relativity without a cosmological constant, a classical theorem due to Hawking states that stationary black holes must be topologically spherical. This result is one of the several ingredients that collectively imply the…

We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…

We investigate the ``complexity equals anything" proposal with codimension-one and codimension-zero gravitational observables for multi-horizon black holes, using the Bardeen-AdS class black hole as an example. In particular, we compare the…

In this paper, assuming the low-degree conjecture, we provide evidence of computational hardness for two problems: (1) the (partial) matching recovery problem in the sparse correlated Erd\H{o}s-R\'enyi graphs $\mathcal G(n,q;\rho)$ when the…

Transversal gates are the simplest form of fault-tolerant gates and are relatively easy to implement in practice. Yet designing codes that support useful transversal operations -- especially non-Clifford or addressable gates -- remains…

Topological phases of matter are often described using auxiliary systems in one extra dimension. I review the one-dimensional cluster state--the simplest quantum state with Symmetry-Protected Topological (SPT) order--as a toy model of…

Given a reference computer, Kolmogorov complexity is a well defined function on all binary strings. In the standard approach, however, only the asymptotic properties of such functions are considered because they do not depend on the…

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…

We study holographic implications of Lovelock gravities in AdS spacetimes. For a generic Lovelock gravity in arbitrary spacetime dimensions we formulate the existence condition for asymptotically AdS black holes. We consider small…