We propose that finite cutoff regions of holographic spacetimes represent quantum circuits that map between boundary states at different times and Wilsonian cutoffs, and that the complexity of those quantum circuits is given by the gravitational action. The optimal circuit minimizes the gravitational action. This is a generalization of both the "complexity equals volume" conjecture to unoptimized circuits, and path integral optimization to finite cutoffs. Using tools from holographic T (T) over bar, we find that surfaces of constant scalar curvature play a special role in optimizing quantum circuits. We also find an interesting connection of our proposal to kinematic space, and discuss possible circuit representations and gate counting inte...
Abstract We study three different types of local quenches (local operator, splitting and joining) in...
International audienceWe analyze different holographic complexity proposals for black holes that inc...
In this note we investigate the role of Lloyd’s computational bound in holographic complexity. Our g...
We propose that finite cutoff regions of holographic spacetimes represent quantum circuits that map ...
Abstract We propose that holographic spacetimes can be regarded as collections of quantum circuits b...
Holographic complexity proposals have sparked interest in quantifying the cost of state preparation ...
Inspired by the universality of computation, we advocate for a principle of spacetime complexity, wh...
In this dissertation, we investigate how some properties of quantum mechanics integrate in our descr...
Abstract In this work we elaborate on holographic description of the path-integral optimization in c...
Holographic dualities like AdS/CFT provide a non-perturbative definition of a bulk theory of quantum...
The AdS/CFT correspondence relates quantum gravity in asymptotically AdS spacetimes to conformal fie...
Abstract: Tensor networks,$$ T\overline{T} $$TT¯, and broader notions of a holographic principle al...
Motivated by recent studies of holographic complexity, we examine the question of circuit complexity...
Abstract We study the “complexity equals volume” (CV) and “complexity equals action” (CA) conjecture...
Abstract We perform a comparative study of the time dependence of the holographic quantum complexity...
Abstract We study three different types of local quenches (local operator, splitting and joining) in...
International audienceWe analyze different holographic complexity proposals for black holes that inc...
In this note we investigate the role of Lloyd’s computational bound in holographic complexity. Our g...
We propose that finite cutoff regions of holographic spacetimes represent quantum circuits that map ...
Abstract We propose that holographic spacetimes can be regarded as collections of quantum circuits b...
Holographic complexity proposals have sparked interest in quantifying the cost of state preparation ...
Inspired by the universality of computation, we advocate for a principle of spacetime complexity, wh...
In this dissertation, we investigate how some properties of quantum mechanics integrate in our descr...
Abstract In this work we elaborate on holographic description of the path-integral optimization in c...
Holographic dualities like AdS/CFT provide a non-perturbative definition of a bulk theory of quantum...
The AdS/CFT correspondence relates quantum gravity in asymptotically AdS spacetimes to conformal fie...
Abstract: Tensor networks,$$ T\overline{T} $$TT¯, and broader notions of a holographic principle al...
Motivated by recent studies of holographic complexity, we examine the question of circuit complexity...
Abstract We study the “complexity equals volume” (CV) and “complexity equals action” (CA) conjecture...
Abstract We perform a comparative study of the time dependence of the holographic quantum complexity...
Abstract We study three different types of local quenches (local operator, splitting and joining) in...
International audienceWe analyze different holographic complexity proposals for black holes that inc...
In this note we investigate the role of Lloyd’s computational bound in holographic complexity. Our g...