Maximal-velocity deficit under a finite-support constraint in hard-wall half-line continuous-time quantum walk

• URL: http://arxiv.org/abs/2609.01970v1
• Date: Wed, 02 Sep 2026 00:56:20 GMT
• Title: Maximal-velocity deficit under a finite-support constraint in hard-wall half-line continuous-time quantum walk
• Abstract summary: Continuous-time quantum walks on a lattice spread ballistically and converge to a limiting distribution for the rescaled position.<n>We show that optimizing the moment-generating function of the limiting-velocity distribution over this finite-support class reduces to the principal eigenvalue of an explicit $Mtimes M$ Hermitian matrix.
• Score: 1.8620637029128544
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Continuous-time quantum walks on a lattice spread ballistically and converge to a limiting distribution for the rescaled position. On the hard-wall half line the boundary reflects the walker but does not change the bulk dispersion, so the ballistic front remains set by the maximal group velocity. We ask how close one can get to this front when the initial state is constrained to occupy only the first $M$ sites. We show that optimizing the moment-generating function of the limiting-velocity distribution over this finite-support class reduces to the principal eigenvalue of an explicit $M\times M$ Hermitian matrix, which yields the optimal state by direct diagonalization. For large $M$, a near-front scaling limit produces a continuum description that controls the entire peak region. In particular, the maximal mean drift approaches the front with an inverse-square deficit in $M$ and a constant prefactor $π^2/4$. Numerical results verify both the finite-$M$ spectral formulation and the predicted scaling.

Related papers

• Constrained Online Learning with Noisy Constraint Values [55.29259818039367]
  Under common feasibility, our LEDGER algorithm attains $O(sqrt T)$ expected regret and $O(sqrtTlog(eT))$ expected budget violation.<n>Neither a Slater condition, independence between feedback channels, nor an absolute constraint-value bound is needed.
  arXiv  Detail & Related papers  (2026-09-07T01:38:41Z)
• Large deviations in quantum dynamics and complexity [0.0]
  In generic systems without conservation laws, the large deviation function reaches its longtime limit at $t sim mathcalO(1)$.<n>We propose that the evolution of these values with $t_max$ provides a measure of quantum complexity.
  arXiv  Detail & Related papers  (2026-07-23T06:36:47Z)
• Dimension Reduction for Curves: Simplified and Generalized [56.23281156053955]
  We revisit random projections for reducing the dimension of high-dimensional polygonal curves.<n>We give a simplified proof of the known $O(varepsilon-2log(nm))$ bound on the target dimension of a random projection.<n>Our proof is based on the concept of sparse oblivious subspace embeddings.
  arXiv  Detail & Related papers  (2026-07-03T08:48:35Z)
• How Deep Are Deep GPs, Really? A Sharp Threshold and a Non-Gaussian Limit for Compositional GPs [48.096969031315744]
  Previous work has established that for the RBF kernel and a certain range of bandwidths $r$, the prior degenerates in the limit.<n>We prove that for $r$ below the threshold $r_c(d)$ the prior converges to a limit distribution $_barZ$.
  arXiv  Detail & Related papers  (2026-06-06T15:12:43Z)
• Towards Scalable Persistence-Based Topological Optimization [44.16669776030478]
  Persistence-based topological optimization deforms a point cloud $X subset mathbbRd$ by minimizing objectives of the form $L(X) = ell(mathrmDgm(X))$, where $mathrmDgm(X)$ is a persistence diagram.<n>In practice, optimization is limited by two coupled issues: persistent homology is typically computed on subsamples, and the resulting topological gradients are highly sparse, with only a few anchor points receiving nonzero updates.
  arXiv  Detail & Related papers  (2026-05-09T15:47:20Z)
• Intrinsic Heisenberg-type lower bounds on spacelike hypersurfaces in general relativity [0.0]
  We prove a coordinate- and foliation-independent Heisenbergtype lower bound for quantum states strictly localized in geodesic balls of radius spacelike hypersurfaces of arbitrary spacetimes with matter and a constant.
  arXiv  Detail & Related papers  (2025-10-02T03:19:11Z)
• Finite-Time Information-Theoretic Bounds in Queueing Control [54.11376591632282]
  We derive new policies that achieve them-for the total queue length in scheduling problems over processing networks with both adversarial and arrivals.<n>These findings reveal a fundamental limitation on "drift-only" methods and point the way toward principled, non-asymptotic optimality in queueing control.
  arXiv  Detail & Related papers  (2025-06-23T04:14:40Z)
• Nonasymptotic CLT and Error Bounds for Two-Time-Scale Stochastic Approximation [12.69327994479157]
  We consider linear two-time-scale approximation algorithms driven by martingale noise.<n>We derive the first non-asymptotic central limit theorem with respect to the Wasserstein-1 distance for two-time-scale approximation with PolyakRuppert averaging.
  arXiv  Detail & Related papers  (2025-02-14T03:20:30Z)
• Optimal convergence rates in trace distance and relative entropy for the quantum central limit theorem [2.7855886538423182]
  We show that for a centered $m$-mode quantum state with finite third-order moments, the trace distance between $rhoboxplus n$ and $rho_G$ decays at the optimal rate of $mathcalO(n-1/2)$.<n>For states with finite fourth-order moments, we prove that the relative entropy between $rhoboxplus n$ and $rho_G$ decays at the optimal rate of $mathcalO(n-1)$.
  arXiv  Detail & Related papers  (2024-10-29T12:35:47Z)
• Exponential tail estimates for quantum lattice dynamics [1.2499537119440245]
  We consider the quantum dynamics of a particle on a lattice for large times. We show that the total probability of strictly outside the support of the measure goes to zero exponentially with $t$.
  arXiv  Detail & Related papers  (2024-08-04T18:35:36Z)
• Determining the validity of cumulant expansions for central spin models [0.0]
  For a model with many-to-one connectivity it is widely expected that mean-field theory captures the exact many-particle $Ntoinfty$ limit. Here we show that this is in fact not always the case. Even when a higher-order cumulant expansion does recover the correct limit, the error is not monotonic with $N$ and may exceed that of mean-field theory.
  arXiv  Detail & Related papers  (2023-03-08T07:13:49Z)
• Emergence of Fermi's Golden Rule [55.73970798291771]
  Fermi's Golden Rule (FGR) applies in the limit where an initial quantum state is weakly coupled to a continuum of other final states overlapping its energy. Here we investigate what happens away from this limit, where the set of final states is discrete, with a nonzero mean level spacing.
  arXiv  Detail & Related papers  (2022-06-01T18:35:21Z)
• Optimal route to quantum chaos in the Bose-Hubbard model [6.528382036284375]
  dependence of the chaotic phase of the Bose-Hubbard Hamiltonian on particle number $N$, system size $L$ and particle density is investigated.
  arXiv  Detail & Related papers  (2022-05-09T11:58:56Z)
• A Dynamical Central Limit Theorem for Shallow Neural Networks [48.66103132697071]
  We prove that the fluctuations around the mean limit remain bounded in mean square throughout training. If the mean-field dynamics converges to a measure that interpolates the training data, we prove that the deviation eventually vanishes in the CLT scaling.
  arXiv  Detail & Related papers  (2020-08-21T18:00:50Z)

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.