REVIEW 2 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
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.
Forward citations
Cited by 2 Pith papers
-
CFT Complexity and Penalty Factors
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.
-
Probing the self-coherence of primordial quantum fluctuations with complexity
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.
Discussion (0). Continue with ORCID to comment.