Polynomial Initial-State Jumps and Christoffel Transforms in Krylov Complexity

• URL: http://arxiv.org/abs/2607.05294v1
• Date: Mon, 06 Jul 2026 16:37:39 GMT
• Title: Polynomial Initial-State Jumps and Christoffel Transforms in Krylov Complexity
• Abstract summary: State Krylov, or spread, complexity is a property of a pair $(H,ketK)$ rather than of Hamiltonian alone.<n>We derive exact finite sums for individual amplitudes and projected Christoffel-Darboux kernels for cumulative probabilities and spread complexity.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: State Krylov, or spread, complexity is a property of a pair $(H,\ket{K_0})$ rather than of the Hamiltonian alone. Thus, changing the initial state at fixed $H$ generally changes the Lanczos coefficients and the ordered Krylov basis. We solve this relative initial-state problem for normalized polynomial filters, $\ket{ψ_Q}=Q(H)\ket{K_0}/\sqrt{N_Q}$ with $N_Q=\langle K_0|Q(H)^\dagger Q(H)|K_0\rangle$. The filtered spectral measure is the positive polynomial modification $|Q(E)|^2\mathrm dμ(E)/N_Q$, and orthogonality turns this measure change into a finite-band transfer from reference Fourier-orthogonal-polynomial moments to shifted Krylov amplitudes. We derive exact finite sums for individual amplitudes and projected Christoffel-Darboux kernels for cumulative probabilities and spread complexity. The formulae cover confluent roots, complex seed coefficients, support loss, and terminal quotients in finite dimensions. We evaluate the construction in three canonical Jacobi families, the Heisenberg--Weyl/Charlier oscillator, the compact $SU(2)$/Krawtchouk spin, and the constant-coefficient tight-binding/Chebyshev chain, with a Hermite central-limit scaling of Charlier as a continuous-spectrum check of this Christoffel jump machinery. Finite seed families are organized by a matrix-valued parent measure whose scalar compressions recover the individual shifted problems. The fixed-inner-product construction carries over to operator Krylov complexity after the replacement \(H\mapsto\mathcal L\) and \(\ket{K_0}\mapsto O\); polynomial seeds then become nested-commutator descendants \(Q(\mathcal L)O\). The result is an exact relative calculus in which a solved cyclic problem generates a family of polynomially related initial-state dynamics without repeating Lanczos in the original Hilbert space.

Related papers

• Restricted Eigenvalues Beyond Gaussian Width: Threshold Occupancy under Heavy Tails [47.36630149538994]
  For isotropic sub-Gaussian measurements, the benchmark sample size is $1+w(A)2$, where $w(A)$ is the Gaussian width of the normalized descent cone.<n>We give an explicit and systematic negative answer to the general question as formulated there: the proposed law fails in its full dimension-free, arbitrary-set form.<n>Under isotropy, a distribution-free fallback governed by affine dimension times squared enclosing radius is sharp on this family.
  arXiv  Detail & Related papers  (2026-09-03T08:05:05Z)
• Zero-Energy Problems for Supersymmetric Hamiltonians on a Chain Are $\mathrm{QMA}_1$-Complete [2.4344882758650743]
  We study exact zero modes of supersymmetric quantum systems whose interactions are arranged on a one-dimensional chain.<n>The construction gives an explicit inverse-polynomial lower bound on the ground energy of every reduced NO instance, separating it from zero.
  arXiv  Detail & Related papers  (2026-08-29T15:32:39Z)
• Poisson-Compiled Quantum Singular Value Transformation for Power-Exponential Dissipation [2.1496959255800188]
  We study quantum implementations of the contraction $exp(T H)$ for $H=Hdaggersucceq0$ and $>0$.<n>Nearest-neighbor Laplacians give a unit-normalized shifted signal.<n>We establish a noncommutative Weyl-Poisson identity compatible with LCHS quadrature bounds.
  arXiv  Detail & Related papers  (2026-08-04T22:49:03Z)
• A Provable Oracle-Free Quantum Algorithm for Nonlinear Dynamics on Hybrid Oscillator-Qubit Processors [14.814423713691623]
  We develop a hybrid qubit-qumode algorithm for nonlinear ordinary differential equations of the form $dotmathbfx=mathbff(mathbfx)$ with warped degree$L$.<n>The algorithm propagates the state density and returns the trajectory as the peak of that density in the small-noise limit.
  arXiv  Detail & Related papers  (2026-07-30T17:10:47Z)
• Exponential Reduction of Mesh Dependence in Quantum Estimation of Parabolic PDE Observables [3.3636842548621275]
  We develop a quantum PDE algorithm that estimates linear and quadratic observables and places fine-coarse cancellation inside the circuit before measurement.<n>We also give a non-Fourier realization based on energyorthogonal dyadic midpoint details in one dimension.
  arXiv  Detail & Related papers  (2026-07-20T16:09:24Z)
• The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems [46.657699628769336]
  Entanglement and interference are among the most fundamental properties of quantum mechanics.<n>We prove that entanglement gives no additional power to stoquastic verification.
  arXiv  Detail & Related papers  (2026-05-15T17:52:33Z)
• A Factorization Identity for Twisted Multinomial Coefficients with Application to Pilot States in Hamiltonian Decoded Quantum Interferometry [0.0]
  We introduce the twisted multinomial coefficient, in which each inversion between letters $i$ and $j$ carries a pair-dependent weight.<n>We show that the factorization yields an exact matrix product state (MPS) of bond dimension $k+1$ for the expansion coefficients of $hk$ in a twisted algebra.
  arXiv  Detail & Related papers  (2026-04-01T15:27:23Z)
• Hardness of High-Dimensional Linear Classification [58.29089693778071]
  We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem.<n>Both are fundamental problems in computational geometry and machine learning in their exact and approximate forms.
  arXiv  Detail & Related papers  (2026-03-19T15:53:41Z)
• Higher-Order Krylov State Complexity in Random Matrix Quenches [3.7179067164913]
  In quantum many-body systems, time-evolved states typically remain confined to a smaller region of the Hilbert space known as the $textitKrylov subspace$.<n>We investigate the time evolution of generalized spread complexities following a quantum quench in random matrix theory.
  arXiv  Detail & Related papers  (2024-12-21T03:59: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)
• Quantum and classical low-degree learning via a dimension-free Remez inequality [52.12931955662553]
  We show a new way to relate functions on the hypergrid to their harmonic extensions over the polytorus. We show the supremum of a function $f$ over products of the cyclic group $exp(2pi i k/K)_k=1K$. We extend to new spaces a recent line of work citeEI22, CHP, VZ22 that gave similarly efficient methods for learning low-degrees on hypercubes and observables on qubits.
  arXiv  Detail & Related papers  (2023-01-04T04:15:40Z)
• Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials [93.59919600451487]
  "Statistical-computational gaps" occur in many statistical inference tasks. We consider a model for random order-3 decomposition where one component is slightly larger in norm than the rest. We show that tensor entries can accurately estimate the largest component when $ll n3/2$ but fail to do so when $rgg n3/2$.
  arXiv  Detail & Related papers  (2022-11-10T00:40:37Z)
• Geometric relative entropies and barycentric Rényi divergences [16.385815610837167]
  monotone quantum relative entropies define monotone R'enyi quantities whenever $P$ is a probability measure. We show that monotone quantum relative entropies define monotone R'enyi quantities whenever $P$ is a probability measure.
  arXiv  Detail & Related papers  (2022-07-28T17:58:59Z)
• 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)

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.