A Difference Operator Approach to Quantum Random Walks: Parseval Identity, Krawtchouk Matrices, and Hermite Limits

• URL: http://arxiv.org/abs/2607.24837v1
• Date: Fri, 24 Jul 2026 04:23:13 GMT
• Title: A Difference Operator Approach to Quantum Random Walks: Parseval Identity, Krawtchouk Matrices, and Hermite Limits
• Abstract summary: We study the one-dimensional quantum random walk (QRW) with the Hadamard coin.<n>Explicit expressions are obtained for the probability amplitudes a(n,k) and b(n,k)<n>We prove by induction that the amplitudes satisfy a Parseval identity sum (a2+b2)=2n-1.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a discrete difference operator D_k to study the one-dimensional quantum random walk (QRW) with the Hadamard coin. Explicit combinatorial expressions are obtained for the probability amplitudes a(n,k) and b(n,k), which encode the final step direction and carry alternating signs that reflect the merging of leftward steps. Removing these signs and the coin-state distinction recovers the classical binomial distribution. The symmetric and antisymmetric combinations $a\pm b$ are shown to coincide with diagonal and sub-diagonal entries of the Krawtchouk matrix. Using cross identities among Krawtchouk matrix elements, we prove by induction that the amplitudes satisfy a Parseval identity sum (a^2+b^2)=2^n-1, establishing probability conservation in the Krawtchouk formulation. The operator D_k acts as a discrete Hermite polynomial generator: the ratios h_m = (n choose k)^{-1} D_k^m (n choose k) admit explicit closed forms and converge to Hermite polynomials in the continuous limit. At the discrete level, D_k connects successive Krawtchouk matrices and acts as a coherence generator and a raising operator. The h_m quantify the position-dependent degree of quantum interference on both halves of the distribution, either individually (for x >= 0) or through an inverse-Pascal combination of several h_m (for x < 0), and the ballistic O(n^2) scaling of the variance emerges from the superposition of all excited states. Numerical illustrations for n=6 and n=10 corroborate the analytical results.

Related papers

• Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth [73.08853228981701]
  Matrix chain multiplication is a problem in scientific computing, machine learning, and graph analysis.<n>We present emphTwo-Tower Matrix, a quantum subroutine that encodes the product $mathcalW$ of the $K$ matrices into a quantum state in circuit depth.
  arXiv  Detail & Related papers  (2026-07-14T18:42:40Z)
• 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)
• Transmutation based Quantum Simulation for Non-unitary Dynamics [35.35971148847751]
  We present a quantum algorithm for simulating dissipative diffusion dynamics generated by positive semidefinite operators of the form $A=Ldagger L$.<n>Our main tool is the Kannai transform, which represents the diffusion semigroup $e-TA$ as a Gaussian-weighted superposition of unitary wave propagators.
  arXiv  Detail & Related papers  (2026-01-07T05:47:22Z)
• Lanczos Meets Orthogonal Polynomials [0.0]
  In large-$N$ and continuum limits, the average Lanczos coefficients and the recursion coefficients become equivalent.<n>We show that the two formalisms yield identical expressions for the leading density states.
  arXiv  Detail & Related papers  (2025-12-17T19:00:02Z)
• Work statistics of sudden Quantum quenches: A random matrix theory perspective on Gaussianity and its deviations [0.0]
  We show that, for sudden quenches, the work distribution reduces to the statistics of traces of powers of Haar unitaries.<n>We also characterise the conditions under which non-Gaussian tails arise, for example from many interaction terms or their slow decay, as well as the appearance of Fisher--Hartwig singularities.
  arXiv  Detail & Related papers  (2025-09-11T17:27:31Z)
• Tensor cumulants for statistical inference on invariant distributions [49.80012009682584]
  We show that PCA becomes computationally hard at a critical value of the signal's magnitude. We define a new set of objects, which provide an explicit, near-orthogonal basis for invariants of a given degree. It also lets us analyze a new problem of distinguishing between different ensembles.
  arXiv  Detail & Related papers  (2024-04-29T14:33:24Z)
• Efficient unitary designs and pseudorandom unitaries from permutations [35.66857288673615]
  We show that products exponentiated sums of $S(N)$ permutations with random phases match the first $2Omega(n)$ moments of the Haar measure. The heart of our proof is a conceptual connection between the large dimension (large-$N$) expansion in random matrix theory and the method.
  arXiv  Detail & Related papers  (2024-04-25T17:08:34Z)
• Quantum vs Classical Birth and Death Processes; Exactly Solvable Examples [0.0]
  A coinless quantisation procedure of continuous and discrete time Birth and Death (BD) processes is presented. The quantum and classical systems share the entire eigenvalues and the eigenvectors are related one to one.
  arXiv  Detail & Related papers  (2022-12-21T01:07:27Z)
• Markov chains with doubly stochastic transition matrices and application to a sequence of non-selective quantum measurements [0.0]
  A time-dependent finite-state Markov chain that uses doubly transition matrices is considered. entropy that describe the randomness of the probability vectors, and also the randomness of the discrete paths, are studied.
  arXiv  Detail & Related papers  (2022-03-16T14:58:38Z)
• Asymptotics of Entropy-Regularized Optimal Transport via Chaos Decomposition [1.7188280334580195]
  This paper is on the properties of a discrete Schr"odinger bridge as $N$ tends to infinity. We derive the first two error terms of orders $N-1/2$ and $N-1$, respectively. The kernels corresponding to the first and second order chaoses are given by Markov operators which have natural interpretations in the Sinkhorn algorithm.
  arXiv  Detail & Related papers  (2020-11-17T21:55:46Z)
• A Matrix Chernoff Bound for Markov Chains and Its Application to Co-occurrence Matrices [30.49132891333353]
  We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via a regular (aperiodic and irreducible) finite Markov chain. Our proof is based on the matrix expander (regular undirected graph) Chernoff bound [Garg et al. STOC '18] and scalar Chernoff-Hoeffding bounds for Markov chains. Our matrix Chernoff bound for Markov chains can be applied to analyze the behavior of co-occurrence statistics for sequential data.
  arXiv  Detail & Related papers  (2020-08-06T05:44:54Z)

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.