Unsupervised Techniques to Detect Quantum Chaos

• URL: http://arxiv.org/abs/2507.12887v1
• Date: Thu, 17 Jul 2025 08:16:34 GMT
• Title: Unsupervised Techniques to Detect Quantum Chaos
• Abstract summary: We show that an unsupervised neural network can detect quantum chaos directly from the Hamiltonian matrix.<n>We show that the same transition can be detected via unsupervised neural networks, or more specifically, Self-Organizing Maps.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Conventional spectral probes of quantum chaos require eigenvalues, and sometimes, eigenvectors of the quantum Hamiltonian. This involves computationally expensive diagonalization procedures. We test whether an unsupervised neural network can detect quantum chaos directly from the Hamiltonian matrix. We use a single-body Hamiltonian with an underlying random graph structure and random coupling constants, with a parameter that determines the randomness of the graph. The spectral analysis shows that increasing the amount of randomness in the underlying graph results in a transition from integrable spectral statistics to chaotic ones. We show that the same transition can be detected via unsupervised neural networks, or more specifically, Self-Organizing Maps by feeding the Hamiltonian matrix directly into the neural network, without any diagonalization procedure.

Related papers

• Fermi-Dirac machines as quantizations of neurons [51.809748057605184]
  We reinterpret Fermi-Dirac machines as canonical quantizations of classical neurons.<n>We develop efficient hybrid quantum-classical algorithms for evaluating outputs and gradients of our quantized neurons.<n> Numerical experiments indicate that neurons based on quantum Hamiltonians can learn functions that classical neurons cannot.
  arXiv  Detail & Related papers  (2026-05-23T04:09:03Z)
• Probes of chaos over the Clifford group and approach to Haar values [0.0]
  Chaotic behavior of quantum systems can be characterized by the adherence to the expectation values of given probes to moments of the Haar distribution.<n>We analyze the behavior of several probes of chaos using a technique known as Isospectral Twirling.
  arXiv  Detail & Related papers  (2026-03-31T12:49:34Z)
• On the Spectral theory of Isogeny Graphs and Quantum Sampling of Hard Supersingular Elliptic curves [0.0]
  We present the first provable quantum-time algorithm that samples a random hard supersingular elliptic curve with high probability.<n>Our algorithm gives a secure instantiation of the hash function and other cryptographic primitives.
  arXiv  Detail & Related papers  (2026-02-02T16:04:54Z)
• Ground and excited-state energies with analytic errors and short time evolution on a quantum computer [0.0]
  Accurately solving the Schr"odinger equation remains a central challenge in computational physics, chemistry, and materials science.<n>We propose an alternative eigenvalue problem based on a system's autocorrelation function, avoiding direct reference to a wave function.<n>We develop a rigorous approximation framework that enables precise frequency estimation from a finite number of signal samples.
  arXiv  Detail & Related papers  (2025-07-20T22:56:00Z)
• Avoided-crossings, degeneracies and Berry phases in the spectrum of quantum noise through analytic Bloch-Messiah decomposition [49.1574468325115]
  "analytic Bloch-Messiah decomposition" provides approach for characterizing dynamics of quantum optical systems.<n>We show that avoided crossings arise naturally when a single parameter is varied, leading to hypersensitivity of the singular vectors.<n>We highlight the possibility of programming the spectral response of photonic systems through the deliberate design of avoided crossings.
  arXiv  Detail & Related papers  (2025-04-29T13:14:15Z)
• Simulating NMR Spectra with a Quantum Computer [49.1574468325115]
  This paper provides a formalization of the complete procedure of the simulation of a spin system's NMR spectrum. We also explain how to diagonalize the Hamiltonian matrix with a quantum computer, thus enhancing the overall process's performance.
  arXiv  Detail & Related papers  (2024-10-28T08:43:40Z)
• Neural Pfaffians: Solving Many Many-Electron Schrödinger Equations [58.130170155147205]
  Neural wave functions accomplished unprecedented accuracies in approximating the ground state of many-electron systems, though at a high computational cost. Recent works proposed amortizing the cost by learning generalized wave functions across different structures and compounds instead of solving each problem independently. This work tackles the problem by defining overparametrized, fully learnable neural wave functions suitable for generalization across molecules.
  arXiv  Detail & Related papers  (2024-05-23T16:30:51Z)
• Quantum tomography of helicity states for general scattering processes [55.2480439325792]
  Quantum tomography has become an indispensable tool in order to compute the density matrix $rho$ of quantum systems in Physics. We present the theoretical framework for reconstructing the helicity quantum initial state of a general scattering process.
  arXiv  Detail & Related papers  (2023-10-16T21:23:42Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Random tensor networks with nontrivial links [1.9440833697222828]
  We initiate a systematic study of the entanglement properties of random tensor networks. We employ tools from free probability, random matrix theory, and one-shot quantum information theory. We draw connections to previous work on split transfer protocols, entanglement negativity in random tensor networks, and Euclidean path integrals in quantum gravity.
  arXiv  Detail & Related papers  (2022-06-21T15:49:29Z)
• Quantum Sampling Algorithms, Phase Transitions, and Computational Complexity [0.0]
  Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum computer by preparing a quantum state that encodes the entire probability distribution followed by a projective measurement. We investigate the complexity of adiabatically preparing such quantum states for the Gibbs distributions of various models including the Ising chain, hard-sphere models on different graphs, and a model encoding the unstructured search problem.
  arXiv  Detail & Related papers  (2021-09-07T11:43:45Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• Isospectral twirling and quantum chaos [0.0]
  We show that the most important measures of quantum chaos like frame potentials, scrambling, Loschmidt echo, and out-of-time correlators (OTOCs) can be described by the unified framework of the isospectral twirling. We show that, by exploiting random matrix theory, these measures of quantum chaos clearly distinguish the finite time profiles of probes to quantum chaos.
  arXiv  Detail & Related papers  (2020-11-11T19:01:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.