Probing quantum scars and weak ergodicity-breaking through quantum complexity

• URL: http://arxiv.org/abs/2208.05503v3
• Date: Tue, 29 Nov 2022 06:40:37 GMT
• Title: Probing quantum scars and weak ergodicity-breaking through quantum complexity
• Authors: Budhaditya Bhattacharjee, Samudra Sur, Pratik Nandy
• Abstract summary: We compute the Krylov state (spread) complexity of typical states generated by the time evolution of the PXP Hamiltonian. We show that the complexity for the Neel state revives in an approximate sense, while complexity for the generic ETH-obeying state always increases.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Scar states are special many-body eigenstates that weakly violate the eigenstate thermalization hypothesis (ETH). Using the explicit formalism of the Lanczos algorithm, usually known as the forward scattering approximation in this context, we compute the Krylov state (spread) complexity of typical states generated by the time evolution of the PXP Hamiltonian, hosting such states. We show that the complexity for the Neel state revives in an approximate sense, while complexity for the generic ETH-obeying state always increases. This can be attributed to the approximate SU(2) structure of the corresponding generators of the Hamiltonian. We quantify such ''closeness'' by the q-deformed SU(2) algebra and provide an analytic expression of Lanczos coefficients for the Neel state within the approximate Krylov subspace. We intuitively explain the results in terms of a tight-binding model. We further consider a deformation of the PXP Hamiltonian and compute the corresponding Lanczos coefficients and the complexity. We find that complexity for the Neel state shows nearly perfect revival while the same does not hold for a generic ETH-obeying state.

Related papers

• Schrödingerization based Quantum Circuits for Maxwell's Equation with time-dependent source terms [24.890270804373824]
  This paper explicitly constructs a quantum circuit for Maxwell's equations with perfect electric conductor (PEC) boundary conditions. We show that quantum algorithms constructed using Schr"odingerisation exhibit acceleration in computational complexity compared to the classical Finite Difference Time Domain (FDTD) format.
  arXiv  Detail & Related papers  (2024-11-17T08:15:37Z)
• Entanglement entropy bounds for pure states of rapid decorrelation [0.0]
  We construct high fidelity approximations of relatively low complexity for pure states of quantum lattice systems. The applicability of the general results is demonstrated on the quantum Ising model in transverse field. We establish an area-law type bound on the entanglement in the model's subcritical ground states, valid in all dimensions and up to the model's quantum phase transition.
  arXiv  Detail & Related papers  (2024-06-14T17:28:03Z)
• Spread complexity and quantum chaos for periodically driven spin chains [0.0]
  We study the dynamics of spread complexity for quantum maps using the Arnoldi iterative procedure. We find distinctive behaviour of the Arnoldi coefficients and spread complexity for regular vs. chaotic dynamics.
  arXiv  Detail & Related papers  (2024-05-25T11:17:43Z)
• Krylov Complexity of Fermionic and Bosonic Gaussian States [9.194828630186072]
  This paper focuses on emphKrylov complexity, a specialized form of quantum complexity. It offers an unambiguous and intrinsically meaningful assessment of the spread of a quantum state over all possible bases.
  arXiv  Detail & Related papers  (2023-09-19T07:32:04Z)
• Quantum state complexity meets many-body scars [0.0]
  Scar eigenstates in a many-body system refer to a small subset of non-thermal finite energy density eigenstates embedded into an otherwise thermal spectrum. We probe these small sets of special eigenstates starting from particular initial states by computing the spread complexity associated to time evolution of the PXP hamiltonian.
  arXiv  Detail & Related papers  (2023-05-16T18:10:46Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Krylov complexity in quantum field theory, and beyond [44.99833362998488]
  We study Krylov complexity in various models of quantum field theory. We find that the exponential growth of Krylov complexity satisfies the conjectural inequality, which generalizes the Maldacena-Shenker-Stanford bound on chaos.
  arXiv  Detail & Related papers  (2022-12-29T19:00:00Z)
• The inflation hierarchy and the polarization hierarchy are complete for the quantum bilocal scenario [1.9798034349981157]
  We show that the quantum inflation hierarchy is complete for the bilocal scenario in the commuting observables model of locality. We also give a bilocal version of an observation by Tsirelson, namely that in finite dimensions, the commuting observables model and the tensor product model of locality coincide.
  arXiv  Detail & Related papers  (2022-12-21T19:00:09Z)
• Growth of entanglement of generic states under dual-unitary dynamics [77.34726150561087]
  Dual-unitary circuits are a class of locally-interacting quantum many-body systems. In particular, they admit a class of solvable" initial states for which, in the thermodynamic limit, one can access the full non-equilibrium dynamics. We show that in this case the entanglement increment during a time step is sub-maximal for finite times, however, it approaches the maximal value in the infinite-time limit.
  arXiv  Detail & Related papers  (2022-07-29T18:20:09Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• 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.