Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
112 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Complexity and information geometry in spin chains (2005.03532v3)

Published 7 May 2020 in cond-mat.stat-mech and hep-th

Abstract: We study Nielsen complexity and Fubini-Study complexity for a class of exactly solvable one dimensional spin systems. Our examples include the transverse XY spin chain and its natural extensions, the quantum compass model with and without an external magnetic field. We obtain the scaling behaviour of both complexities near quantum phase transitions in the thermodynamic limit, as a function of the system parameters. We provide analytical proofs of these, in an information geometric framework, which verify our numerical analysis. The scaling of the Nielsen complexity with the system size is also established, close to criticality. We also obtain analytic expressions for the Fubini-Study complexity in some special cases for all the models, while a numerical analysis in more generic situations is carried out. Our study clearly demonstrates the differences in the two notions of complexity in quasi-free fermionic systems.

Citations (11)

Summary

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