<p dir="ltr">Complexity has played an increasingly important role in recent years. In this dissertation, we study some notions of complexity in systems that exhibit critical behaviour. Our results show that complexity as it is generally understood in holographic and lattice models of criticality can have several ambiguities. But despite these ambiguities, there are some features that are universally true. On the phase diagram of the system, it is the critical point which has the most complex ground state. States of physical systems with a large complexity tend to be hard to simulate using quantum circuits. Near the critical point, there is a part of complexity which is non-analytic and scales universally, i.e, the scaling is independent of the microscopic details of the Hamiltonian but depends only on the dimensionality of the system, and of the deforming operator. The coefficient of this term is unambiguous, i.e, it is not affected by the various changes in the definition of complexity which plague all the analytic terms near the critical point. We show this in lattice, field-theoretic and holographic calculations. These results were first presented in our earlier studies.</p>
| Identifer | oai:union.ndltd.org:purdue.edu/oai:figshare.com:article/24150417 |
| Date | 15 September 2023 |
| Creators | Uday Sood (16993635) |
| Source Sets | Purdue University |
| Detected Language | English |
| Type | Text, Thesis |
| Rights | CC BY 4.0 |
| Relation | https://figshare.com/articles/thesis/Complexity_near_critical_points/24150417 |
Page generated in 0.0021 seconds