Pith. sign in

REVIEW 5 cited by

Lorentzian threads as 'gatelines' and holographic complexity

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 2105.12735 v3 pith:VJJ36ZD3 submitted 2021-05-26 hep-th gr-qc

classification hep-thgr-qc
keywords complexitybulkgatelineslorentzianusedequalflowsholographic
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The continuous min flow-max cut principle is used to reformulate the 'complexity=volume' conjecture using Lorentzian flows -- divergenceless norm-bounded timelike vector fields whose minimum flux through a boundary subregion is equal to the volume of the homologous maximal bulk Cauchy slice. The nesting property is used to show the rate of complexity is bounded below by "conditional complexity", describing a multi-step optimization with intermediate and final target states. Conceptually, discretized Lorentzian flows are interpreted in terms of threads or gatelines such that complexity is equal to the minimum number of gatelines used to prepare a CFT state by an optimal tensor network (TN) discretizing the state. We propose a refined measure of complexity, capturing the role of suboptimal TNs, as an ensemble average. The bulk symplectic potential provides a 'canonical' thread configuration characterizing perturbations around arbitrary CFT states. Its consistency requires the bulk to obey linearized Einstein's equations, which are shown to be equivalent to the holographic first law of complexity, thereby advocating a notion of 'spacetime complexity'.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

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

  1. Recursion Coefficients and Krylov Dynamics in Polynomial Random Matrix Models

    hep-th 2026-08 conditional novelty 6.0 of 10

    Recursion coefficients for high-degree asymmetric polynomial random matrix models are computed efficiently via a moment recursion, with large-n asymptotics reproducing Freud's conjecture and transition regions mapped ...

  2. Complexity measures in holographic cascading theories with multiscale dynamics

    hep-th 2026-08 accept novelty 6.0 of 10

    In holographic B8 gauge theories, complexity growth flattens near a walking conformal regime, while Krylov oscillation periods track the infrared scale and persist in screened, non-confining phases.

  3. Brickwall One-Loop Determinant: Spectral Statistics & Krylov Complexity

    hep-th 2024-12 conditional novelty 6.0 of 10

    In the brickwall model of a BTZ black hole, hand-tuned Gaussian randomness at a stretched horizon reproduces random-matrix-theory spectral statistics and Krylov complexity peaks for scalar and fermionic probes.

  4. $T\bar{T}$ deformation and multiple-flavor Lorentzian threads

    hep-th 2026-07 conditional novelty 5.0 of 10

    TTbar-induced corrections to complexity=anything expand into generalized Willmore functionals that admit a local multi-flavor Lorentzian-thread decomposition by curvature sector.

  5. The thread embodiment of holographic quantum entanglement

    hep-th 2025-01 conditional novelty 5.0 of 10

    Holographic entanglement is represented by geodesic threads whose fluxes equal half conditional mutual information, and kinematic space is treated as the input board of a quantum circuit that reproduces holographic co...

Pith tools