Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2410.18754 · Journal of High Energy Physics

Benchmarking quantum chaos from geometric complexity

Arpan Bhattacharyya, Suddhasattwa Brahma, Satyaki Chowdhury, Xiancong Luo

Published Mar 25, 2025• 2 citations
arXivHTMLPDF

Abstract

A bstract Recent studies have shown that there is a strong interplay between quantum complexity and quantum chaos. In this work, we consider a new method to study geometric complexity for interacting non-Gaussian quantum mechanical systems to benchmark the quantum chaos in a well-known oscillator model. In particular, we study the circuit complexity for the unitary time-evolution operator of a non-Gaussian bosonic quantum mechanical system. Our results indicate that, within some limitations, geometric complexity can indeed be a good indicator of quantum chaos.

DOI
10.1007/jhep03(2025)177

Related papers

Simulating quantum chaos without chaos

Andi Gu, Yihui Quek, Susanne F. Yelin +2 more

Quantum chaos is a quantum many-body phenomenon that is associated with a number of intricate properties, such as level repulsion in energy spectra or distinct scalings of out-of-time ordered correlation functions. In this work, we introduce a novel class of "pseudochaotic" quantum Hamiltonians that fundamentally challenges the conventional understanding of quantum chaos and its relationship to computational complexity. Our ensemble is computationally indistinguishable from the Gaussian unitary ensemble (GUE) of strongly-interacting Hamiltonians, widely considered to be a quintessential model for quantum chaos. Surprisingly, despite this effective indistinguishability, our Hamiltonians lack all conventional signatures of chaos: it exhibits Poissonian level statistics, low operator complexity, and weak scrambling properties. This stark contrast between efficient computational indistinguishability and traditional chaos indicators calls into question fundamental assumptions about the nature of quantum chaos. We, furthermore, give an efficient quantum algorithm to simulate Hamiltonians from our ensemble, even though simulating Hamiltonians from the true GUE is known to require exponential time. Our work establishes fundamental limitations on Hamiltonian learning and testing protocols and derives stronger bounds on entanglement and magic state distillation. These results reveal a surprising separation between computational and information-theoretic perspectives on quantum chaos, opening new avenues for research at the intersection of quantum chaos, computational complexity, and quantum information. Above all, it challenges conventional notions of what it fundamentally means to actually observe complex quantum systems.

arXiv:2410.18196•Oct 23, 2024•0 citations

Geometric quantum complexity of bosonic oscillator systems

Satyaki Chowdhury, Martin Bojowald A, Jakub Mielczarek A B

A bstract According to the pioneering work of Nielsen and collaborators, the length of the minimal geodesic in a geometric realization of a suitable operator space provides a measure of the quantum complexity of an operation. Compared with the original concept of complexity based on the minimal number of gates required to construct the desired operation as a product, this geometrical approach amounts to a more concrete and computable definition, but its evaluation is nontrivial in systems with a high-dimensional Hilbert space. The geometrical formulation can more easily be evaluated by considering the geometry associated with a suitable finite-dimensional group generated by a small number of relevant operators of the system. In this way, the method has been applied in particular to the harmonic oscillator, which is also of interest in the present paper. However, subtle and previously unrecognized issues of group theory can lead to unforeseen complications, motivating a new formulation that remains on the level of the underlying Lie algebras for most of the required steps. Novel insights about complexity can thereby be found in a low-dimensional setting, with the potential of systematic extensions to higher dimensions as well as interactions. Specific examples include the quantum complexity of various target unitary operators associated with a harmonic oscillator, inverted harmonic oscillator, and coupled harmonic oscillators. The generality of this approach is demonstrated by an application to an anharmonic oscillator with a cubic term.

arXiv:2307.13736•Journal of High Energy Physics•Oct 4, 2024•7 citations

Non-Linear Geometric Chaos, Based on Quantum Simulation of Chaos Dynamics

Jincheng Zhang

This paper investigates the application of quantum simulation to the study of non-linear geometric chaos. Traditional chaos theory methods often struggle with the complexities of intricate geometric systems, limiting the ability to accurately model and control their behavior. Quantum simulation offers a novel approach by providing a fundamentally different method for representing and analyzing chaotic dynamics. We propose a new algorithm utilizing quantum simulations to emulate the formation and evolution of complex geometric structures, with the goal of optimizing control strategies through the analysis of simulated chaos. This work demonstrates the potential of quantum simulation to enhance our understanding and control of non-linear geometric chaos.

•Sep 7, 2026•0 citations

A study of chaos and randomness in quantum systems

Sreeram PG

How classical chaos emerges from the underlying quantum world is a fundamental problem in physics. The origin of this question is in the correspondence principle. Classical chaos arises due to non-linear dynamics, whereas quantum mechanics, driven by unitary evolution, is linear. The question that still remains is - what are the footprints of classical chaos in the quantum world? One can understand the quantum signatures of classical chaos by studying a quantum system whose classical analogue is chaotic. In this thesis, we use the quantum kicked top model of few qubits in the deep quantum regime to investigate signatures that can be considered as a precursor to chaos in the classical limit. In particular, we study out-of-time-ordered correlators (OTOCs) and Loschmidt echo, the two well-known dynamical diagnostics of chaos. We find vestiges of classical chaos even in such a deep quantum regime. Another arena where one can study the effects of chaos and randomness is quantum state tomography. We study quantum tomography from a continuous measurement record obtained by measuring expectation values of a set of Hermitian operators generated by a unitary evolution of an initial observable. The rate of information gain and reconstruction fidelity shows vestiges of chaos. As another contribution of this thesis, we have harnessed the power of randomness inherent in the maximally mixed state to give an efficient quantum algorithm to measure OTOCs. The protocol achieves an exponential speedup over the best known classical algorithm, provided the OTOC operator to be estimated admits an efficient gate decomposition. This protocol also helps benchmark unitary gates, which is important from the quantum computation and control perspective.

arXiv:2402.00287•Feb 1, 2024•0 citations

Complexity of quadratic quantum chaos

Pallab Basu, Suman Das, Pratik Nandy

A bstract We investigate minimal two-body Hamiltonians with random interactions that generate spectra resembling those of Gaussian random matrices, a phenomenon we term quadratic quantum chaos . Unlike integrable two-body fermionic systems, the corresponding hard-core boson models exhibit genuinely chaotic dynamics, closely paralleling the Sachdev-Ye-Kitaev (SYK) model in its spin representation. This chaotic behavior is diagnosed through spectral statistics and measures of operator growth, including Krylov complexity and the late-time decay of higher-order out-of-time-ordered correlators (OTOCs); the latter reveals the emergence of freeness in the sense of free probability. Moreover, the fractal dimension and Stabilizer Rényi entropy of a representative mid-spectrum eigenstate show finite-size deviations yet converge toward Haar-randomness as the system size increases. This convergence, constrained by local interactions, highlights the “weakly chaotic” character of these eigenstates. Owing to their simplicity and bosonic nature, these minimal models may constitute promising and resource-efficient candidates for probing quantum chaos and information scrambling on near-term quantum devices.

arXiv:2509.04075•Journal of High Energy Physics•Apr 10, 2026•2 citations

Complexity from the reduced density matrix: a new diagnostic for chaos

Arpan Bhattacharyya, S. Shajidul Haque, Eugene H. Kim

Abstract We investigate circuit complexity to characterize chaos in multiparticle quantum systems. In the process, we take a stride to analyze open quantum systems by using complexity. We propose a new diagnostic of quantum chaos from complexity based on the reduced density matrix by exploring different types of quantum circuits. Through explicit calculations on a toy model of two coupled harmonic oscillators, where one or both of the oscillators are inverted, we demonstrate that the evolution of complexity is a possible diagnostic of chaos.

arXiv:2011.04705•Journal of High Energy Physics•Oct 4, 2021•38 citations
A bstract Recent studies have shown that there is a strong interplay between quantum complexity and quantum chaos. In this work, we consider a new method to study geometric complexity for interacting non-Gaussian quantum mechanical systems to benchmark the quantum chaos in a well-known oscillator model. In particular, we study the circuit complexity for the unitary time-evolution operator of a non-Gaussian bosonic quantum mechanical system. Our results indicate that, within some limitations, geometric complexity can indeed be a good indicator of quantum chaos.
Quantum chaos is a quantum many-body phenomenon that is associated with a number of intricate properties, such as level repulsion in energy spectra or distinct scalings of out-of-time ordered correlation functions. In this work, we introduce a novel class of "pseudochaotic" quantum Hamiltonians that fundamentally challenges the conventional understanding of quantum chaos and its relationship to computational complexity. Our ensemble is computationally indistinguishable from the Gaussian unitary ensemble (GUE) of strongly-interacting Hamiltonians, widely considered to be a quintessential model for quantum chaos. Surprisingly, despite this effective indistinguishability, our Hamiltonians lack all conventional signatures of chaos: it exhibits Poissonian level statistics, low operator complexity, and weak scrambling properties. This stark contrast between efficient computational indistinguishability and traditional chaos indicators calls into question fundamental assumptions about the nature of quantum chaos. We, furthermore, give an efficient quantum algorithm to simulate Hamiltonians from our ensemble, even though simulating Hamiltonians from the true GUE is known to require exponential time. Our work establishes fundamental limitations on Hamiltonian learning and testing protocols and derives stronger bounds on entanglement and magic state distillation. These results reveal a surprising separation between computational and information-theoretic perspectives on quantum chaos, opening new avenues for research at the intersection of quantum chaos, computational complexity, and quantum information. Above all, it challenges conventional notions of what it fundamentally means to actually observe complex quantum systems.
A bstract According to the pioneering work of Nielsen and collaborators, the length of the minimal geodesic in a geometric realization of a suitable operator space provides a measure of the quantum complexity of an operation. Compared with the original concept of complexity based on the minimal number of gates required to construct the desired operation as a product, this geometrical approach amounts to a more concrete and computable definition, but its evaluation is nontrivial in systems with a high-dimensional Hilbert space. The geometrical formulation can more easily be evaluated by considering the geometry associated with a suitable finite-dimensional group generated by a small number of relevant operators of the system. In this way, the method has been applied in particular to the harmonic oscillator, which is also of interest in the present paper. However, subtle and previously unrecognized issues of group theory can lead to unforeseen complications, motivating a new formulation that remains on the level of the underlying Lie algebras for most of the required steps. Novel insights about complexity can thereby be found in a low-dimensional setting, with the potential of systematic extensions to higher dimensions as well as interactions. Specific examples include the quantum complexity of various target unitary operators associated with a harmonic oscillator, inverted harmonic oscillator, and coupled harmonic oscillators. The generality of this approach is demonstrated by an application to an anharmonic oscillator with a cubic term.
This paper investigates the application of quantum simulation to the study of non-linear geometric chaos. Traditional chaos theory methods often struggle with the complexities of intricate geometric systems, limiting the ability to accurately model and control their behavior. Quantum simulation offers a novel approach by providing a fundamentally different method for representing and analyzing chaotic dynamics. We propose a new algorithm utilizing quantum simulations to emulate the formation and evolution of complex geometric structures, with the goal of optimizing control strategies through the analysis of simulated chaos. This work demonstrates the potential of quantum simulation to enhance our understanding and control of non-linear geometric chaos.
How classical chaos emerges from the underlying quantum world is a fundamental problem in physics. The origin of this question is in the correspondence principle. Classical chaos arises due to non-linear dynamics, whereas quantum mechanics, driven by unitary evolution, is linear. The question that still remains is - what are the footprints of classical chaos in the quantum world? One can understand the quantum signatures of classical chaos by studying a quantum system whose classical analogue is chaotic. In this thesis, we use the quantum kicked top model of few qubits in the deep quantum regime to investigate signatures that can be considered as a precursor to chaos in the classical limit. In particular, we study out-of-time-ordered correlators (OTOCs) and Loschmidt echo, the two well-known dynamical diagnostics of chaos. We find vestiges of classical chaos even in such a deep quantum regime. Another arena where one can study the effects of chaos and randomness is quantum state tomography. We study quantum tomography from a continuous measurement record obtained by measuring expectation values of a set of Hermitian operators generated by a unitary evolution of an initial observable. The rate of information gain and reconstruction fidelity shows vestiges of chaos. As another contribution of this thesis, we have harnessed the power of randomness inherent in the maximally mixed state to give an efficient quantum algorithm to measure OTOCs. The protocol achieves an exponential speedup over the best known classical algorithm, provided the OTOC operator to be estimated admits an efficient gate decomposition. This protocol also helps benchmark unitary gates, which is important from the quantum computation and control perspective.
A bstract We investigate minimal two-body Hamiltonians with random interactions that generate spectra resembling those of Gaussian random matrices, a phenomenon we term quadratic quantum chaos . Unlike integrable two-body fermionic systems, the corresponding hard-core boson models exhibit genuinely chaotic dynamics, closely paralleling the Sachdev-Ye-Kitaev (SYK) model in its spin representation. This chaotic behavior is diagnosed through spectral statistics and measures of operator growth, including Krylov complexity and the late-time decay of higher-order out-of-time-ordered correlators (OTOCs); the latter reveals the emergence of freeness in the sense of free probability. Moreover, the fractal dimension and Stabilizer Rényi entropy of a representative mid-spectrum eigenstate show finite-size deviations yet converge toward Haar-randomness as the system size increases. This convergence, constrained by local interactions, highlights the “weakly chaotic” character of these eigenstates. Owing to their simplicity and bosonic nature, these minimal models may constitute promising and resource-efficient candidates for probing quantum chaos and information scrambling on near-term quantum devices.
Abstract We investigate circuit complexity to characterize chaos in multiparticle quantum systems. In the process, we take a stride to analyze open quantum systems by using complexity. We propose a new diagnostic of quantum chaos from complexity based on the reduced density matrix by exploring different types of quantum circuits. Through explicit calculations on a toy model of two coupled harmonic oscillators, where one or both of the oscillators are inverted, we demonstrate that the evolution of complexity is a possible diagnostic of chaos.