Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 50 tok/s Pro
GPT-5 Medium 13 tok/s Pro
GPT-5 High 16 tok/s Pro
GPT-4o 98 tok/s Pro
GPT OSS 120B 472 tok/s Pro
Kimi K2 210 tok/s Pro
2000 character limit reached

Spread Complexity and Topological Transitions in the Kitaev Chain (2208.06311v2)

Published 12 Aug 2022 in hep-th, cond-mat.stat-mech, and quant-ph

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.

Citations (35)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube