Machine Learns Quantum Complexity?

• URL: http://arxiv.org/abs/2501.02005v1
• Date: Thu, 02 Jan 2025 04:32:34 GMT
• Title: Machine Learns Quantum Complexity?
• Authors: Dongsu Bak, Su-Hyeong Kim, Sangnam Park, Jeong-Pil Song,
• Abstract summary: We study how a machine based on deep learning algorithms learns Krylov spread complexity in quantum systems. We demonstrate that a convolutional neural network-based algorithm successfully learns the Krylov spread complexity across all timescales.
• Score: 0.0
• License:
• Abstract: We study how a machine based on deep learning algorithms learns Krylov spread complexity in quantum systems with N x N random Hamiltonians drawn from the Gaussian unitary ensemble. Using thermofield double states as initial conditions, we demonstrate that a convolutional neural network-based algorithm successfully learns the Krylov spread complexity across all timescales, including the late-time plateaus where states appear nearly featureless and random. Performance strongly depends on the basis choice, performing well with the energy eigenbasis or the Krylov basis but failing in the original basis of the random Hamiltonian. The algorithm also effectively distinguishes temperature-dependent features of thermofield double states. Furthermore, we show that the system time variable of state predicted by deep learning is an irrelevant quantity, reinforcing that the Krylov spread complexity well captures the essential features of the quantum state, even at late times.

Related papers

• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Generating Approximate Ground States of Strongly Correlated Quantum Many-Body Systems Through Quantum Imaginary Time Evolution [0.0]
  We numerically study the capabilities of the QITE algorithm in approximating the ITE of lattice and molecular electronic structure Hamiltonians. We show how imaginary time evolved fermionic Gaussian states can serve as initial states which can be efficiently computed on classical computers.
  arXiv  Detail & Related papers  (2024-09-02T15:20:41Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Improved iterative quantum algorithm for ground-state preparation [4.921552273745794]
  We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian system. Our approach has advantages including the higher success probability at each iteration, the measurement precision-independent sampling complexity, the lower gate complexity, and only quantum resources are required when the ancillary state is well prepared.
  arXiv  Detail & Related papers  (2022-10-16T05:57:43Z)
• Real-Time Krylov Theory for Quantum Computing Algorithms [0.0]
  New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information. We develop the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware. We discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.
  arXiv  Detail & Related papers  (2022-08-01T18:00:48Z)
• Quantum Alphatron: quantum advantage for learning with kernels and noise [2.94944680995069]
  We provide quantum versions of the Alphatron in the fault-tolerant setting. We discuss the quantum advantage in the context of learning of two-layer neural networks.
  arXiv  Detail & Related papers  (2021-08-26T09:36:20Z)
• Continuous-variable neural-network quantum states and the quantum rotor model [2.3398944692275476]
  We study neural-network quantum state algorithms for analyzing continuous-variable lattice quantum systems in first quantization. A family of continuous-variable trial wavefunctons is introduced which naturally generalizes the Boltzmann machine (RBM) wavefunction. Results are compared against those obtained from partial differential equation (PDE) based scalable eigensolvers.
  arXiv  Detail & Related papers  (2021-07-15T03:53:14Z)
• Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with an artificial neural-network correlator ansatz [62.997667081978825]
  We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei. We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
  arXiv  Detail & Related papers  (2020-07-28T14:52:28Z)

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.