Krylov Complexity of Optical Hamiltonians

• URL: http://arxiv.org/abs/2409.04156v1
• Date: Fri, 6 Sep 2024 09:39:30 GMT
• Title: Krylov Complexity of Optical Hamiltonians
• Authors: Abhishek Chowdhury, Aryabrat Mahapatra,
• Abstract summary: We focus on various interacting quantum optical models, including a collection of two--level atoms, photonic systems and the quenched oscillator. We analyze the behaviour of complexity for these systems in different regimes of the driven field, focusing primarily on resonances. We also investigate the Krylov complexity in a three--level $SU(3)$ atomic system using the Lanczos algorithm, revealing the underlying complexity dynamics.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we investigate the Krylov complexity in quantum optical systems subject to time--dependent classical external fields. We focus on various interacting quantum optical models, including a collection of two--level atoms, photonic systems and the quenched oscillator. These models have Hamiltonians which are linear in the generators of $SU(2)$, $H(1)$ (Heisenberg--Weyl) and $SU(1,1)$ group symmetries allowing for a straightforward identification of the Krylov basis. We analyze the behaviour of complexity for these systems in different regimes of the driven field, focusing primarily on resonances. This is achieved via the Gauss decomposition of the unitary evolution operators for the group symmetries. Additionally, we also investigate the Krylov complexity in a three--level $SU(3)$ atomic system using the Lanczos algorithm, revealing the underlying complexity dynamics. Throughout we have exploited the the relevant group structures to simplify our explorations.

Related papers

• Krylov complexity for 1-matrix quantum mechanics [0.0]
  This paper investigates the notion of Krylov complexity, a measure of operator growth, within the framework of 1-matrix quantum mechanics (1-MQM) We analyze the Lanczos coefficients derived from the correlation function, revealing their linear growth even in this integrable system. Our findings in both ground and thermal states of 1-MQM provide new insights into the nature of complexity in quantum mechanical models.
  arXiv  Detail & Related papers  (2024-06-28T18:00:03Z)
• KPZ scaling from the Krylov space [83.88591755871734]
  Recently, a superdiffusion exhibiting the Kardar-Parisi-Zhang scaling in late-time correlators and autocorrelators has been reported. Inspired by these results, we explore the KPZ scaling in correlation functions using their realization in the Krylov operator basis.
  arXiv  Detail & Related papers  (2024-06-04T20:57:59Z)
• Krylov complexity of density matrix operators [0.0]
  Krylov-based measures such as Krylov complexity ($C_K$) and Spread complexity ($C_S$) are gaining prominence. We investigate their interplay by considering the complexity of states represented by density matrix operators.
  arXiv  Detail & Related papers  (2024-02-14T19:01:02Z)
• Complexity and Operator Growth for Quantum Systems in Dynamic Equilibrium [1.1868310494908512]
  Krylov complexity is a measure of operator growth in quantum systems. We show that Krylov complexity can distinguish between the $mathsfPT$-symmetric and $mathsfPT$ symmetry-broken phases. Our results demonstrate the utility of Krylov complexity as a tool to probe the properties and transitions of $mathsfPT$-symmetric systems.
  arXiv  Detail & Related papers  (2023-12-25T18:58:13Z)
• 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)
• Trapped-Ion Quantum Simulation of Collective Neutrino Oscillations [55.41644538483948]
  We study strategies to simulate the coherent collective oscillations of a system of N neutrinos in the two-flavor approximation using quantum computation. We find that the gate complexity using second order Trotter- Suzuki formulae scales better with system size than with other decomposition methods such as Quantum Signal Processing.
  arXiv  Detail & Related papers  (2022-07-07T09:39:40Z)
• Entanglement and correlations in fast collective neutrino flavor oscillations [68.8204255655161]
  Collective neutrino oscillations play a crucial role in transporting lepton flavor in astrophysical settings. We study the full out-of-equilibrium flavor dynamics in simple multi-angle geometries displaying fast oscillations. We present evidence that these fast collective modes are generated by the same dynamical phase transition.
  arXiv  Detail & Related papers  (2022-03-05T17:00:06Z)
• Operator complexity: a journey to the edge of Krylov space [0.0]
  Krylov complexity, or K-complexity', quantifies this growth with respect to a special basis. We study the evolution of K-complexity in finite-entropy systems for time scales greater than the scrambling time.
  arXiv  Detail & Related papers  (2020-09-03T18:10:20Z)
• Model-Independent Simulation Complexity of Complex Quantum Dynamics [0.13999481573773068]
  We present a model-independent measure of dynamical complexity based on simulating complex quantum dynamics using stroboscopic Markovian dynamics. Tools from classical signal processing enable us to infer the Hilbert space dimension of a complex quantum system evolving under a time-independent Hamiltonian.
  arXiv  Detail & Related papers  (2020-09-01T14:52:35Z)
• Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
  The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy. We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy. In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
  arXiv  Detail & Related papers  (2020-07-31T19:23:26Z)
• 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.