Pith. sign in

REVIEW 2 cited by

Spread Complexity and Topological Transitions in the Kitaev Chain

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 2208.06311 v2 pith:RSYMCU7R submitted 2022-08-12 hep-th cond-mat.stat-mechquant-ph

classification hep-thcond-mat.stat-mechquant-ph
keywords phasequantumchaincomplexitykitaevtopologicaltransitionsable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A number of recent works have argued that quantum complexity, a well-known concept in computer science that has re-emerged recently in the context of the physics of black holes, may be used as an efficient probe of novel phenomena such as quantum chaos and even quantum phase transitions. In this article, we provide further support for the latter, using a 1-dimensional p-wave superconductor - the Kitaev chain - as a prototype of a system displaying a topological phase transition. The Hamiltonian of the Kitaev chain manifests two gapped phases of matter with fermion parity symmetry; a trivial strongly-coupled phase and a topologically non-trivial, weakly-coupled phase with Majorana zero-modes. We show that Krylov-complexity (or, more precisely, the associated spread-complexity) is able to distinguish between the two and provides a diagnostic of the quantum critical point that separates them. We also comment on some possible ambiguity in the existing literature on the sensitivity of different measures of complexity to topological phase transitions.

Discussion (0). Sign in 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. Complexity of PXP scars revisited

    hep-th 2025-06 conditional novelty 6.0 of 10

    In the PXP model, the arch in the Lanczos coefficients is traced to a linear sl(3) part of the Hamiltonian, and the arch width is proposed as a signal distinguishing scarred from thermalizing states.

  2. Emergence of Krylov complexity through quantum walks: An exploration of the quantum origins of complexity

    hep-th 2026-02 conditional novelty 5.0 of 10

    Reducing a graph walk to distance-layers reproduces Krylov/spread complexity, yielding analytic finite-q SYK Lanczos coefficients and hypercube complexity D sin²(t/D), with faster saturation than classical-walk circuits.

Pith tools