相关论文: Complexity is Simple

We are interested in black holes in Loop Quantum Gravity (LQG). We study the simple model of static black holes: the horizon is made of a given number of identical elementary surfaces and these small surfaces all behaves as a spin-s system…

The holographic complexity has been studied in a background which includes a critical point in the dual field theory. We have examined how the complexity rate and the saturation time of dynamical variables in the theory behave as one moves…

For a field theory with a gravitational dual, following Susskind's proposal we define holographic complexity for a subsystem. The holographic complexity is proportional to the volume of a co-dimension one time slice in the bulk geometry…

The Weak Gravity Conjecture (WGC) demands the existence of superextremal particles in any consistent quantum theory of gravity. The standard lore is that these particles are introduced to ensure that extremal black holes are either unstable…

This is a review of the results on black hole physics in the framework of loop quantum gravity. The key feature underlying the results is the discreteness of geometric quantities at the Planck scale predicted by this approach to quantum…

It was recently observed in \cite{Park:2014tia} that the holographic nature of gravity may hold a key to quantization of gravity. The so-called "holographic quantization" has been carried out in \cite{Park:2014noa,Park:2015ota} for Einstein…

Transversal Pauli $Z$ rotations provide a natural route to fault-tolerant logical diagonal gates in quantum CSS codes, but their capability is inherently constrained. We develop a homological framework that organizes transversal diagonal…

Combining principles with pragmatism, a new approach and accompanying algorithm are presented to a longstanding problem in applied statistics: the interpretation of principal components. Following Rousson and Gasser [53 (2004) 539--555]…

This letter provides evidence of complexity-volume and complexity-action conjectures by examining the structure of a black hole, which comprises a horizon linked to the singularity through a wormhole. In this situation, the shape of the…

We compute holographic R\'enyi entropies for spherical entangling surfaces on the boundary while considering third order Lovelock gravity with negative cosmological constant in the bulk. Our study shows that third order Lovelock black holes…

For the double complex structure of grading-restricted vertex algebra cohomology defined in \cite{Huang}, we introduce a multiplication of elements of double complex spaces. We show that the orthogonality and bi-grading conditions applied…

There is strong evidence that the area of any surface limits the information content of adjacent spacetime regions, at 10^(69) bits per square meter. We review the developments that have led to the recognition of this entropy bound, placing…

The holographic entropy cone characterizes the relations between entanglement entropies for a spatial partitioning of the boundary spacetime of a holographic CFT in any state describing a classical bulk geometry. We argue that the…

Black holes monopolize nowadays the center stage of fundamental physics. Yet, they are poorly understood objects. Notwithstanding, from their generic properties, one can infer important clues to what a fundamental theory, a theory that…

This paper considers the realizability of quantum gates from the perspective of information complexity. Since the gate is a physical device that must be controlled classically, it is subject to random error. We define the complexity of gate…

In this paper, we study the problem of computing the majority function by low-depth monotone circuits and a related problem of constructing low-depth sorting networks. We consider both the classical setting with elementary operations of…

Two dimensional conformal field theories with large central charge and a sparse low-lying spectrum are expected to admit a classical string holographic dual. We construct a large class of such theories employing permutation orbifold…

The holographic complexity is UV divergent. As a finite complexity, we propose a "regularized complexity" by employing a similar method to the holographic renormalization. We add codimension-two boundary counterterms which do not contain…

Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems.…

We investigate Clifford+$T$ quantum circuits with a small number of $T$-gates. Using the sparsification lemma, we identify time complexity lower bounds in terms of $T$-gate count below which a strong simulator would improve on the…