Pith. sign in

REVIEW 1 cited by

Spacetime as a quantum circuit

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2101.01185 v2 pith:2XETEY2L submitted 2021-01-04 hep-th gr-qcquant-ph

classification hep-thgr-qcquant-ph
keywords circuitsquantumactioncircuitgravitationalcomplexitycutoffsfind
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

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\bar T$, 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 interpretations of the gravitational action.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. CFT Complexity and Penalty Factors

    hep-th 2025-07 conditional novelty 6.0 of 10

    A submersion-based method turns weighted generator costs into state-complexity metrics for CFTs, giving analytic formulas in simple limits and constraints on which weight choices are viable.

Pith tools