REVIEW 2 cited by
Circuit Complexity in Fermionic Field Theory
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 define and calculate versions of complexity for free fermionic quantum field theories in 1+1 and 3+1 dimensions, adopting Nielsen's geodesic perspective in the space of circuits. We do this both by discretizing and identifying appropriate classes of Bogoliubov-Valatin transformations, and also directly in the continuum by defining squeezing operators and their generalizations. As a closely related problem, we consider cMERA tensor networks for fermions: viewing them as paths in circuit space, we compute their path lengths. Certain ambiguities that arise in some of these results because of cut-off dependence are discussed.
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.