Pith. sign in

REVIEW 1 cited by

Renormalized Circuit 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 1907.08223 v3 pith:6JLLEGPR submitted 2019-07-18 hep-th quant-ph

classification hep-thquant-ph
keywords circuitcomplexityoptimizedtoleranceanti-decoordinatecorrelatedcounting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose a modification to Nielsen's circuit complexity for Hamiltonian simulation using the Suzuki-Trotter (ST) method, which provides a network like structure for the quantum circuit. This leads to an optimized gate counting linear in the geodesic distance and spatial volume, unlike in the original proposal. The optimized ST iteration order is correlated with the error tolerance and plays the role of an anti-de Sitter (AdS) radial coordinate. The density of gates is shown to be monotonic with the tolerance and a holographic interpretation using path-integral optimization is given.

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. Probing the self-coherence of primordial quantum fluctuations with complexity

    hep-th 2025-02 conditional novelty 5.0 of 10

    Complexity of formation, unlike complexity of purification, shows distinct and timescale-matching signatures of both decoherence and recoherence in a Gaussian two-field de Sitter model.

Pith tools