Quantum complexity and localization in random quantum circuits

Quantum complexity has emerged as a central concept in diverse areas of physics, ranging from quantum computing to the theory of black holes. We perform a systematic study of complexity in random quantum circuits with and without measurements. We observe that complexity grows linearly before saturat...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Sahu, Himanshu, Bhattacharya, Aranya, Pingal, Pratyush Nath
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 05.09.2024
Subjects
Anderson localization
Circuits
Complexity
Many body problem
Quantum computing
Qubits (quantum computing)
Online AccessGet full text

Cover

More Information
Summary:Quantum complexity has emerged as a central concept in diverse areas of physics, ranging from quantum computing to the theory of black holes. We perform a systematic study of complexity in random quantum circuits with and without measurements. We observe that complexity grows linearly before saturating to a constant value. For \(N\) qubits without measurements, the saturation value scales as \(2^{N-1}\), and the saturation time scales as \(2^N\). This behaviour remains identical in the presence of random measurements with different probabilities, indicating that this notion of complexity is insensitive to the rate of measurement. We also study the behaviour of complexity in two variants of the random unitary floquet circuit, where we observe that complexity acts as a novel probe of Anderson localization and many-body localization.
ISSN:2331-8422