Krylov Complexity for Jacobi Coherent States

• URL: http://arxiv.org/abs/2212.13758v1
• Date: Wed, 28 Dec 2022 09:21:58 GMT
• Title: Krylov Complexity for Jacobi Coherent States
• Authors: S. Shajidul Haque, Jeff Murugan, Mpho Tladi, Hendrik J.R. Van Zyl
• Abstract summary: We show how the Lanczos algorithm that iteratively generates the Krylov basis can be augmented to treat coherent states associated with the Jacobi group. We exploit this to benchmark a scheme to numerically compute the Lanczos coefficients which, in principle, generalizes to the more general Jacobi group $H_nrtimes Sp(2n,mathbbR)$.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We develop computational tools necessary to extend the application of Krylov complexity beyond the simple Hamiltonian systems considered thus far in the literature. As a first step toward this broader goal, we show how the Lanczos algorithm that iteratively generates the Krylov basis can be augmented to treat coherent states associated with the Jacobi group, the semi-direct product of the 3-dimensional real Heisenberg-Weyl group $H_{1}$, and the symplectic group, $Sp(2,\mathbb{R})\simeq SU(1,1)$. Such coherent states are physically realized as squeezed states in, for example, quantum optics. With the Krylov basis for both the $SU(1,1)$ and Heisenberg-Weyl groups being well understood, their semi-direct product is also partially analytically tractable. We exploit this to benchmark a scheme to numerically compute the Lanczos coefficients which, in principle, generalizes to the more general Jacobi group $H_{n}\rtimes Sp(2n,\mathbb{R})$.

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)
• Sample-Efficient Constrained Reinforcement Learning with General Parameterization [35.22742439337603]
  We consider a constrained Markov Decision Problem (CMDP) where the goal of an agent is to maximize the expected discounted sum of rewards over an infinite horizon. We develop the Primal-Dual Accelerated Natural Policy Gradient (PD-ANPG) algorithm that ensures an $epsilon$ global optimality gap and $epsilon$ constraint violation.
  arXiv  Detail & Related papers  (2024-05-17T08:39:05Z)
• Tensor decompositions with applications to LU and SLOCC equivalence of multipartite pure states [0.552480439325792]
  Kraus' (2010) algorithm used the HOSVD to compute normal forms of almost all $n$-qubit pure states under the action of the local unitary group. We produce similar algorithms that compute normal forms for almost all $n$-qubit pure states under the action of the SLOCC group.
  arXiv  Detail & Related papers  (2024-02-19T21:06:55Z)
• 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)
• Clustering Mixtures of Bounded Covariance Distributions Under Optimal Separation [44.25945344950543]
  We study the clustering problem for mixtures of bounded covariance distributions. We give the first poly-time algorithm for this clustering task. Our algorithm is robust to $Omega(alpha)$-fraction of adversarial outliers.
  arXiv  Detail & Related papers  (2023-12-19T01:01:53Z)
• Do you know what q-means? [50.045011844765185]
  Clustering is one of the most important tools for analysis of large datasets. We present an improved version of the "$q$-means" algorithm for clustering. We also present a "dequantized" algorithm for $varepsilon which runs in $Obig(frack2varepsilon2(sqrtkd + log(Nd))big.
  arXiv  Detail & Related papers  (2023-08-18T17:52:12Z)
• Annihilating Entanglement Between Cones [77.34726150561087]
  We show that Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied. Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation.
  arXiv  Detail & Related papers  (2021-10-22T15:02:39Z)
• Mechanism for particle fractionalization and universal edge physics in quantum Hall fluids [58.720142291102135]
  We advance a second-quantization framework that helps reveal an exact fusion mechanism for particle fractionalization in FQH fluids. We also uncover the fundamental structure behind the condensation of non-local operators characterizing topological order in the lowest-Landau-level (LLL)
  arXiv  Detail & Related papers  (2021-10-12T18:00:00Z)
• Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach [94.37521840642141]
  We study the correlation clustering problem using the quantum approximate optimization algorithm (QAOA) and qudits. Specifically, we consider a neutral atom quantum computer and propose a full stack approach for correlation clustering. We show the qudit implementation is superior to the qubit encoding as quantified by the gate count.
  arXiv  Detail & Related papers  (2021-06-22T11:07:38Z)
• Bosonic and fermionic Gaussian states from K\"ahler structures [0.0]
  We show that bosonic and fermionic Gaussian states can be uniquely characterized by their linear complex structure $J$. We apply these methods to the study of entanglement and complexity, (B) dynamics of stable systems, (C) dynamics of driven systems.
  arXiv  Detail & Related papers  (2020-10-29T12:21:47Z)
• Local optimization on pure Gaussian state manifolds [63.76263875368856]
  We exploit insights into the geometry of bosonic and fermionic Gaussian states to develop an efficient local optimization algorithm. The method is based on notions of descent gradient attuned to the local geometry. We use the presented methods to collect numerical and analytical evidence for the conjecture that Gaussian purifications are sufficient to compute the entanglement of purification of arbitrary mixed Gaussian states.
  arXiv  Detail & Related papers  (2020-09-24T18:00:36Z)
• Multi-boundary entanglement in Chern-Simons theory with finite gauge groups [5.100636992246072]
  In (1+1)-$d$, we focus on the states associated with torus link complements which live in the tensor product of Hilbert spaces associated with multiple $T2$. In (2+1)-$d$, we focus on the states associated with torus link complements which live in the tensor product of Hilbert spaces associated with multiple $T2$.
  arXiv  Detail & Related papers  (2020-03-03T09:40:03Z)

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.