Pith. sign in

REVIEW 2 cited by

Circuit Complexity across a Topological Phase Transition

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 1902.10720 v3 pith:2H3IIYQ2 submitted 2019-02-27 quant-ph cond-mat.str-elhep-th

classification quant-phcond-mat.str-elhep-th
keywords circuitcomplexitystatesdifferentkitaevphasetopologicalacross
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We use Nielsen's geometric approach to quantify the circuit complexity in a one-dimensional Kitaev chain across a topological phase transition. We find that the circuit complexities of both the ground states and non-equilibrium steady states of the Kitaev model exhibit non-analytical behaviors at the critical points, and thus can be used to detect both {\it equilibrium} and {\it dynamical} topological phase transitions. Moreover, we show that the locality property of the real-space optimal Hamiltonian connecting two different ground states depends crucially on whether the two states belong to the same or different phases. This provides a concrete example of classifying different gapped phases using Nielsen's circuit complexity. We further generalize our results to a Kitaev chain with long-range pairing, and discuss generalizations to higher dimensions. Our result opens up a new avenue for using circuit complexity as a novel tool to understand quantum many-body systems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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.

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