Pith. sign in

REVIEW 6 cited by

Circuit Complexity for Coherent States

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 1807.07677 v2 pith:R7PS3UV6 submitted 2018-07-20 hep-th quant-ph

classification hep-thquant-ph
keywords statescomplexitycoherentstateapproachcircuitcircuitsnielsen
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We examine the circuit complexity of coherent states in a free scalar field theory, applying Nielsen's geometric approach as in [1]. The complexity of the coherent states have the same UV divergences as the vacuum state complexity and so we consider the finite increase of the complexity of these states over the vacuum state. One observation is that generally, the optimal circuits introduce entanglement between the normal modes at intermediate stages even though our reference state and target states are not entangled in this basis. We also compare our results from Nielsen's approach with those found using the Fubini-Study method of [2]. For general coherent states, we find that the complexities, as well as the optimal circuits, derived from these two approaches, are different.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 6 Pith papers

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

  1. Complexity measures in QFT and constrained geometric actions

    hep-th 2019-08 reject novelty 7.0 of 10

    The authors claim to rule out inhomogeneous complexity costs such as F_kappa and F_sigma^2 and to single out F_⟨H^2⟩ as the canonical complexity measure, but the no-go proof is incomplete.

  2. 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.

  3. Time dependence of complexity for Lovelock black holes

    hep-th 2019-08 conditional novelty 6.0 of 10

    For Lovelock black holes, the Complexity=Action growth rate at late times is a coupling-independent multiple of the mass, and the Schwarzschild limit is recovered only up to a constant under the authors' boundary-term...

  4. 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.

  5. Dynamics of monitored SSH Model in Krylov Space: From Complexity to Quantum Fisher Information

    quant-ph 2025-02 conditional novelty 5.0 of 10

    Time-averaged quantum Fisher information in Krylov space changes slope at the PT transition (gamma=1) and saturates near the entanglement transition (gamma=2) in the monitored SSH model, suggesting it as a probe of both.

  6. Reflections on Virasoro circuit complexity and Berry phase

    hep-th 2019-08 reject novelty 3.0 of 10

    A claimed identification of Virasoro circuit complexity with the Berry connection fails a basic consistency check for pure rotations.

Pith tools