Krylov Complexity in Lifshitz-type Dirac Field Theories

• URL: http://arxiv.org/abs/2506.08765v3
• Date: Sun, 09 Nov 2025 16:49:03 GMT
• Title: Krylov Complexity in Lifshitz-type Dirac Field Theories
• Authors: Hamid R. Imani, Komeil Babaei Velni, M. Reza Mohammadi Mozaffar,
• Abstract summary: We study Krylov complexity in Lifshitz-type Dirac field theories with a generic dynamical exponent $z$.<n>We analyze the growth and saturation behavior of Krylov complexity in different regimes.<n>We find that increasing the Lifshitz exponent $z$ suppresses Krylov complexity, entropy, and Lanczos growth in both massless and massive cases.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We study Krylov complexity in Lifshitz-type Dirac field theories with a generic dynamical critical exponent $z$. By computing the Lanczos coefficients for massless and massive cases, we analyze the growth and saturation behavior of Krylov complexity in different regimes. We incorporate a hard UV cutoff and investigate the effects of lattice discretization, revealing fundamental differences between continuum and lattice models. In the presence of a UV cutoff, Krylov complexity exhibits an initial exponential growth followed by a linear regime, with saturation values of the Lanczos coefficients dictated by the cutoff scale. For the lattice model, we find a fundamental departure from the continuum case: due to the finite Krylov basis, Krylov complexity saturates rather than growing indefinitely. Our findings suggest that Lifshitz scaling influences operator growth and information spreading in quantum systems. We further find that increasing the Lifshitz exponent $z$ suppresses Krylov complexity, entropy, and Lanczos growth in both massless and massive cases, while enhancing K-variance. This trend reverses under a hard UV cutoff, where complexity and entropy increase with $z$. In lattice models, early-time complexity and $b_n$ decay shift with $z$, echoing the continuum behavior of massive and massless regimes.

Related papers

• On the Computational Complexity of Performative Prediction [59.584063949469645]
  We show that computing an $$-performatively stable point is PPAD-complete.<n>One of our key technical contributions is to extend this PPAD-hardness result to general convex domains.
  arXiv  Detail & Related papers  (2026-01-28T02:26:35Z)
• Superadditivity of Krylov Complexity for Tensor Products [0.0]
  We study Krylov complexity for quantum systems whose Hamiltonians factorise as tensor products.<n>We prove that complexity is superadditive under tensor products, $C_12ge C_1+C$, and identify a positive operator that quantifies the resulting excess complexity.
  arXiv  Detail & Related papers  (2026-01-13T16:48:16Z)
• Random-Matrix-Induced Simplicity Bias in Over-parameterized Variational Quantum Circuits [72.0643009153473]
  We show that expressive variational ansatze enter a Haar-like universality class in which both observable expectation values and parameter gradients concentrate exponentially with system size.<n>As a consequence, the hypothesis class induced by such circuits collapses with high probability to a narrow family of near-constant functions.<n>We further show that this collapse is not unavoidable: tensor-structured VQCs, including tensor-network-based and tensor-hypernetwork parameterizations, lie outside the Haar-like universality class.
  arXiv  Detail & Related papers  (2026-01-05T08:04:33Z)
• Loss-Complexity Landscape and Model Structure Functions [56.01537787608726]
  We develop a framework for dualizing the Kolmogorov structure function $h_x(alpha)$.<n>We establish a mathematical analogy between information-theoretic constructs and statistical mechanics.<n>We explicitly prove the Legendre-Fenchel duality between the structure function and free energy.
  arXiv  Detail & Related papers  (2025-07-17T21:31:45Z)
• Evolution of Gaussians in the Hellinger-Kantorovich-Boltzmann gradient flow [44.500314182711236]
  We derive explicit ordinary equations govern the evolution of mean, covariance, and mass under HK-Boltzmann flow.<n>We demonstrate exponential convergence to equilibrium through constructing a gradient structure associated with a Polyak-Lojasiewicz-type inequalities.<n>We extend our analysis to non-Gaussian targets exhibiting strong log-lambda-concavity.
  arXiv  Detail & Related papers  (2025-04-29T03:54:56Z)
• Krylov complexity of fermion chain in double-scaled SYK and power spectrum perspective [0.0]
  We investigate Krylov complexity of the fermion chain operator which consists of multiple Majorana fermions in the double-scaled SYK (DSSYK) model with finite temperature. Using the fact that Krylov complexity is computable from two-point functions, the analysis is performed in the limit where the two-point function becomes simple. We confirm the exponential growth of Krylov complexity in the very low temperature regime.
  arXiv  Detail & Related papers  (2024-07-18T08:47:05Z)
• 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 as an order parameter for deconfinement phase transitions at large $N$ [0.0]
  Krylov complexity is an order parameter of confinement/deconfinement transitions in large $N$ quantum field theories. We show that Krylov complexity reflects the confinement/deconfinement phase transitions through the continuity of mass spectrum.
  arXiv  Detail & Related papers  (2024-01-09T07:04:17Z)
• Operator dynamics in Lindbladian SYK: a Krylov complexity perspective [0.0]
  We analytically establish the linear growth of two sets of coefficients for any generic jump operators. We find that the Krylov complexity saturates inversely with the dissipation strength, while the dissipative timescale grows logarithmically.
  arXiv  Detail & Related papers  (2023-11-01T18:00:06Z)
• Krylov complexity in the IP matrix model II [0.0]
  We study how the Krylov complexity changes from a zero-temperature oscillation to an infinite-temperature exponential growth. The IP model for any nonzero temperature shows exponential growth for the Krylov complexity even though the Green function decays by a power law in time.
  arXiv  Detail & Related papers  (2023-08-15T04:25:55Z)
• 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)
• An operator growth hypothesis for open quantum systems [0.0]
  We study the dissipative $q$-body Sachdev-Ye-Kitaev (SYK$_q$) model. We conjecture to be generic for any dissipative (open) quantum systems.
  arXiv  Detail & Related papers  (2022-12-12T19:00:12Z)
• Krylov Complexity in Open Quantum Systems [3.5895926924969404]
  We show that Krylov complexity in open systems can be mapped to a non-hermitian tight-binding model in a half-infinite chain. Our work provides insights for discussing complexity, chaos, and holography for open quantum systems.
  arXiv  Detail & Related papers  (2022-07-27T16:03:41Z)
• Krylov Complexity in Quantum Field Theory [0.9998361283909821]
  We study the Krylov complexity in quantum field theory and make a connection with the holographic "Complexity equals Volume" conjecture. When Krylov basis matches with Fock basis, for several interesting settings, we observe that the Krylov complexity equals the average particle number showing that complexity scales with volume.
  arXiv  Detail & Related papers  (2022-04-05T14:42:10Z)
• Partial Counterfactual Identification from Observational and Experimental Data [83.798237968683]
  We develop effective Monte Carlo algorithms to approximate the optimal bounds from an arbitrary combination of observational and experimental data. Our algorithms are validated extensively on synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2021-10-12T02:21:30Z)
• On Function Approximation in Reinforcement Learning: Optimism in the Face of Large State Spaces [208.67848059021915]
  We study the exploration-exploitation tradeoff at the core of reinforcement learning. In particular, we prove that the complexity of the function class $mathcalF$ characterizes the complexity of the function. Our regret bounds are independent of the number of episodes.
  arXiv  Detail & Related papers  (2020-11-09T18:32:22Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)
• Kernel and Rich Regimes in Overparametrized Models [69.40899443842443]
  We show that gradient descent on overparametrized multilayer networks can induce rich implicit biases that are not RKHS norms. We also demonstrate this transition empirically for more complex matrix factorization models and multilayer non-linear networks.
  arXiv  Detail & Related papers  (2020-02-20T15:43:02Z)

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.