Pith. sign in

REVIEW 1 cited by

Circuit Complexity and 2D Bosonisation

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 1904.03003 v3 pith:4S44IWNL submitted 2019-04-05 hep-th quant-ph

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

We consider the circuit complexity of free bosons, or equivalently free fermions, in 1+1 dimensions. Motivated by the results of [1] and [2, 3] who found different behavior in the complexity of free bosons and fermions, in any dimension, we consider the 1+1 dimensional case where, thanks to the bosonisation equivalence, we can consider the same state from both the bosonic and the fermionic perspectives. In this way the discrepancy can be attributed to a different choice of the set of gates allowed in the circuit. We study the effect in two classes of states: i) bosonic-coherent / fermionic-gaussian states; ii) states that are both bosonic- and fermionic-gaussian. We consider the complexity relative to the ground state. In the first class, the different results can be reconciled admitting a mode-dependent cost function in one of the descriptions. The differences in the second class are more important, in terms of the cutoff-dependence and the overall behavior of the complexity.

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

Pith tools