Complexity and Operator Growth for Quantum Systems in Dynamic Equilibrium

• URL: http://arxiv.org/abs/2312.15790v1
• Date: Mon, 25 Dec 2023 18:58:13 GMT
• Title: Complexity and Operator Growth for Quantum Systems in Dynamic Equilibrium
• Authors: Cameron Beetar, Nitin Gupta, S. Shajidul Haque, Jeff Murugan, Hendrik J R Van Zyl
• Abstract summary: 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.
• Score: 1.1868310494908512
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Krylov complexity is a measure of operator growth in quantum systems, based on the number of orthogonal basis vectors needed to approximate the time evolution of an operator. In this paper, we study the Krylov complexity of a $\mathsf{PT}$-symmetric system of oscillators, which exhibits two phase transitions that separate a dissipative state, a Rabi-oscillation state, and an ultra-strongly coupled regime. We use a generalization of the $su(1,1)$ algebra associated to the Bateman oscillator to describe the Hamiltonian of the coupled system, and construct a set of coherent states associated with this algebra. We compute the Krylov (spread) complexity using these coherent states, and find that it can distinguish between the $\mathsf{PT}$-symmetric and $\mathsf{PT}$ symmetry-broken phases. We also show that the Krylov complexity reveals the ill-defined nature of the vacuum of the Bateman oscillator, which is a special case of our system. Our results demonstrate the utility of Krylov complexity as a tool to probe the properties and transitions of $\mathsf{PT}$-symmetric systems.

Related papers

• Krylov Complexity of Optical Hamiltonians [0.0]
  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.
  arXiv  Detail & Related papers  (2024-09-06T09:39:30Z)
• 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)
• Spectral Convergence of Complexon Shift Operators [38.89310649097387]
  We study the transferability of Topological Signal Processing via a generalized higher-order version of graphon, known as complexon. Inspired by the graphon shift operator and message-passing neural network, we construct a marginal complexon and complexon shift operator. We prove that when a simplicial complex signal sequence converges to a complexon signal, the eigenvalues, eigenspaces, and Fourier transform of the corresponding CSOs converge to that of the limit complexon signal.
  arXiv  Detail & Related papers  (2023-09-12T08:40:20Z)
• Emergence of non-Abelian SU(2) invariance in Abelian frustrated fermionic ladders [37.69303106863453]
  We consider a system of interacting spinless fermions on a two-leg triangular ladder with $pi/2$ magnetic flux per triangular plaquette. Microscopically, the system exhibits a U(1) symmetry corresponding to the conservation of total fermionic charge, and a discrete $mathbbZ$ symmetry. At the intersection of the three phases, the system features a critical point with an emergent SU(2) symmetry.
  arXiv  Detail & Related papers  (2023-05-11T15:57:27Z)
• Deep Learning Symmetries and Their Lie Groups, Algebras, and Subalgebras from First Principles [55.41644538483948]
  We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset. We use fully connected neural networks to model the transformations symmetry and the corresponding generators. Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.
  arXiv  Detail & Related papers  (2023-01-13T16:25:25Z)
• Sharp complexity phase transitions generated by entanglement [0.0]
  We quantitatively connect the entanglement present in certain quantum systems to the computational complexity of simulating those systems. Specifically, we consider the task of simulating single-qubit measurements of $k$--regular graph states on $n$ qubits.
  arXiv  Detail & Related papers  (2022-12-20T19:00:08Z)
• Circuit Complexity in an interacting quenched Quantum Field Theory [0.0]
  We explore the effects of a quantum quench on the circuit complexity for a quenched quantum field theory having weakly coupled quartic interaction. We show the analytical computation of circuit complexity for the quenched and interacting field theory.
  arXiv  Detail & Related papers  (2022-09-07T18:00:03Z)
• Boundary time crystals in collective $d$-level systems [64.76138964691705]
  Boundary time crystals are non-equilibrium phases of matter occurring in quantum systems in contact to an environment. We study BTC's in collective $d$-level systems, focusing in the cases with $d=2$, $3$ and $4$.
  arXiv  Detail & Related papers  (2021-02-05T19:00:45Z)
• 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)
• 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)

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.