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

Unveiling hidden features of the Kitaev model through a complex-network analysis (2505.00444v2)

Published 1 May 2025 in quant-ph

Abstract: We introduce a density matrix-based network analysis to explore the ground state of the Kitaev chain, uncovering previously hidden structural and entanglement features. This approach successfully identifies the critical point associated with the topological phase transition and reveals a singular point where the ground state exhibits uniform, nonzero entanglement between all fermion pairs, corresponding to a fully connected network structure. We provide an analytical explanation for this singular behavior and establish a connection to the concept of ground state factorization observed in spin chains. Moreover, we analyze the open chain scenario and observe characteristic symmetry changes in the ground state corresponding to Majorana zero modes. While complex network theory has been employed in the study of quantum systems before, we demonstrate that it can uncover fundamentally new physical insights.

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.