Monte Carlo integration is fundamentally limited by the M^(-1/2) rate that the Cramer-Rao bound imposes on any sample-mean estimator of an expectation value, regardless of how the samples are drawn. Coined discrete-time quantum walks (DTQWs) are known to spread ballistically - their position variance scales as T^2 against the diffusive T of classical random walks - yet this faster spreading has not been exploited for numerical integration. We show that coupling the ballistic scaling of a 2D DTQW to the Hardy-Huxley asymptotic for Gauss circle lattice counts produces estimators whose dominant error is a deterministic number-theoretic residual controlled by walk depth T, not a statistical fluctuation controlled by sample count M. The construction replaces the empirical mean of a sample-mean estimator with the ratio N(R-hat)/R-hat^2 of a lattice count to the square of a radial position quantile, a structural change that sidesteps the Cramer-Rao barrier. A single batch of measurements then propagates through classically precomputed multipliers to cover an entire family of integrals simultaneously. We develop the framework for convex smooth domains via Kraetzel's lattice asymptotic and for smooth integrals with convex or annular super-level sets via Cavalieri's principle, and provide a parameter-free identity for the bias floor (validated to within 1.5x across all tested depths). Every experiment is benchmarked against the classical random walk with the identical estimator to isolate the quantum contribution; the framework is oracle-free in the QAE sense (no controlled unitary encoding the integrand is required) and structurally distinct from quantum amplitude estimation and Szegedy-walk approaches. These ratios compare measurement counts at fixed precision and do not include quantum circuit execution cost.
Monte Carlo integration is fundamentally limited by the M^(-1/2) rate that the Cramer-Rao bound imposes on any sample-mean estimator of an expectation value, regardless of how the samples are drawn. Coined discrete-time quantum walks (DTQWs) are known to spread ballistically - their position variance scales as T^2 against the diffusive T of classical random walks - yet this faster spreading has not been exploited for numerical integration. We show that coupling the ballistic scaling of a 2D DTQW to the Hardy-Huxley asymptotic for Gauss circle lattice counts produces estimators whose dominant error is a deterministic number-theoretic residual controlled by walk depth T, not a statistical fluctuation controlled by sample count M. The construction replaces the empirical mean of a sample-mean estimator with the ratio N(R-hat)/R-hat^2 of a lattice count to the square of a radial position quantile, a structural change that sidesteps the Cramer-Rao barrier. A single batch of measurements then propagates through classically precomputed multipliers to cover an entire family of integrals simultaneously. We develop the framework for convex smooth domains via Kraetzel's lattice asymptotic and for smooth integrals with convex or annular super-level sets via Cavalieri's principle, and provide a parameter-free identity for the bias floor (validated to within 1.5x across all tested depths). Every experiment is benchmarked against the classical random walk with the identical estimator to isolate the quantum contribution; the framework is oracle-free in the QAE sense (no controlled unitary encoding the integrand is required) and structurally distinct from quantum amplitude estimation and Szegedy-walk approaches. These ratios compare measurement counts at fixed precision and do not include quantum circuit execution cost.
We introduce a discrete-time quantum random walk (QRW) framework for spatial epidemic modelling on a two-dimensional square lattice and compare its dynamics to classical random-walk SIR models. In our model, each infected site spawns a quantum walker whose coherent evolution (controlled by an amplitude-splitting coin and conditional shifts) can infect visited susceptible sites with probability p and persists for a lifetime of τ steps. We perform extensive quantum simulations on finite lattices and compute the basic reproduction number R0 across a broad grid of (p,τ) values. Results show that QRW dynamics interpolate between diffusive and super-diffusive regimes: at low p the QRW reproduces classical-like R0, while at higher p and τ ballistic propagation and interference produce markedly larger R0 and non-Gaussian spatial profiles. We compare the QRW R0 range to empirical estimates from historical outbreaks and discuss parameter regimes where QRW offers a closer qualitative match than classical diffusion. We conclude that QRWs provide a flexible, conceptually novel toy model for exploring rapid or heavy-tailed epidemic spread.
Quantum amplitude estimation (QAE) promises a quadratic reduction in the sampling cost of Monte Carlo (MC) particle transport, but two obstacles have kept it from radiotherapy physics: the lack of an efficient unitary encoding of charged-particle transport, and the mismatch between QAE's single-scalar output and the per-voxel structure of dose calculation. We address both. We construct a discrete-time quantum-walk transport oracle for protons in which an energy register is driven by an energy-dependent coin encoding a continuous-slowing-down surrogate of the stopping power, so that stochastic energy loss and range straggling follow from the circuit dynamics. The oracle is unitary, with one fresh coin qubit per step, and its gate count grows linearly in the number of energy levels. On it we formulate a scalar range statistic, the probability that a proton penetrates beyond a distal depth threshold, as a directly marked amplitude, and estimate it by maximum-likelihood amplitude estimation (MLQAE) with Grover iterations and finite shots. The oracle reproduces a Bragg-shaped depth-deposit profile agreeing with a classical MC of identical rules to within 0.27%, and Grover amplification matches sin2((2k+1)θ) to machine precision up to k=32. At matched budget the MLQAE error falls as N−0.93 against N−0.49 for sampling, 4.8 times smaller at the largest budget. A three-gate resource analysis (output structure, amortization, error-corrected wall-clock) finds full dose maps structurally unfavourable irrespective of hardware, and the scalar statistic short of a wall-clock crossover at clinical scale: the oracle's derived cost of 1.0×106 logical gates per call (3.5×107 with rotation synthesis), dominated by the multiplexed coin, is 160 to 5400 times the permitted budget. We report the reduction that would be required and identify the term responsible for it.
Quantum walks can be defined in two quite distinct ways: discrete-time and continuous-time quantum walks (DTQWs and CTQWs). For classical random walks, there is a natural sense in which continuous-time walks are a limit of discrete-time walks. Quantum mechanically, in the discrete-time case, an additional ``coin space'' must be appended for the walk to have nontrivial time evolution. Continuous-time quantum walks, however, have no such constraints. This means that there is no completely straightforward way to treat a CTQW as a limit of a DTQW, as can be done in the classical case. Various approaches to this problem have been taken in the past. We give a construction for walks on d-regular, d-colorable graphs when the coin flip operator is Hermitian: from a standard DTQW we construct a family of discrete-time walks with a well-defined continuous-time limit on a related graph. One can think of this limit as a ``coined'' continuous-time walk. We show that these CTQWs share some properties with coined DTQWs. In particular, we look at a spatial search by a DTQW over the two-dimensional (2D) torus (a grid with periodic boundary conditions) of size $\sqrt{N}\ifmmode\times\else\texttimes\fi{}\sqrt{N}$, where it was shown that a coined DTQW can search in time O(NlogN), but a standard CTQW takes $\mathrm{\ensuremath{\Omega}}(N)$ time to search for a marked element. The continuous limit of the DTQW search over the 2D torus exhibits the O(NlogN) scaling, like the coined walk it is derived from. We also look at the effects of graph symmetry on the limiting walk, and show that the properties are similar to those of the DTQW as shown in Krovi and Brun, Phys. Rev. A 75, 062332 (2007).
We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., nonrandom) case, we allow any unitary operator which commutes with translations and couples only sites at a finite distance from each other. For example, a single step of the walk could be composed of any finite succession of different shift and coin operations in the usual sense, with any lattice dimension and coin dimension. We find ballistic scaling and establish a direct method for computing the asymptotic distribution of position divided by time, namely as the distribution of the discrete time analog of the group velocity. In the random case, we let a Markov chain (control process) pick in each step one of finitely many unitary walks, in the sense described above. In ballistic order, we find a nonrandom drift which depends only on the mean of the control process and not on the initial state. In diffusive scaling, the limiting distribution is asymptotically Gaussian, with a covariance matrix (diffusion matrix) depending on momentum. The diffusion matrix depends not only on the mean but also on the transition rates of the control process. In the nonrandom limit, i.e., when the coins chosen are all very close or the transition rates of the control process are small, leading to long intervals of ballistic evolution, the diffusion matrix diverges. Our method is based on spatial Fourier transforms, and the first and second order perturbation theory of the eigenvalue 1 of the transition operator for each value of the momentum.
We consider general quantum random walks in a d -dimensional half-space. We first obtain a path integral formula for general quantum random walks in a d -dimensional space. Our path integral formula is valid for general quantum random walks on Cayley graphs as well. Then the path integral formula is applied to obtain the scaling limit of the exit distribution, the expectation of exit time and the asymptotic behaviour of the exit probabilities, for general quantum random walks in a half-space under some conditions on amplitude functions. The conditions are shown to be satisfied by both the Hadamard and Grover quantum random walks in two-dimensional half-spaces. For the two-dimensional case, we show that the critical exponent for the scaling limit of the hitting distribution is 1 as the lattice spacing tends to zero, i.e. the natural magnitude of the hitting position is of order O (1) if the lattice spacing is set to be 1/ n . We also show that the rate of convergence of the total hitting probability has lower bound n −2 and upper bound n −2+ for any > 0. For a quantum random walk with a fixed starting point, we show that the probability of hitting times at the hyperplane decays faster than that of the classical random walk. In both one and two dimensions, given the event of a hit, the conditional expectation of hitting times is finite, in contrast to being infinite for the classical case. In the one-dimensional case, we also obtain an exact order of the probability distribution of the hitting time at 0.
Lackadaisical quantum walks (LQW) extend discrete-time quantum walks (DTQW) by introducing weighted self-loops, enabling improved spatial-search performance through controlled localization of the walker. Despite substantial theoretical progress, practical gate-level implementations suitable for quantum hardware remain largely unexplored, limiting evaluation under realistic architectural constraints, noise, and resource requirements. In this work, we present a gate-level implementation framework for lackadaisical quantum walk search. The proposed construction encodes the position and coin spaces into qubit registers, and realizes the walk dynamics through oracle, coin, and flip-flop shift operations. We validate the circuit by reproducing the expected search behavior for single and multiple marked vertices and by analyzing the effect of the self-loop weight on the success probability. We further evaluate the implementation under realistic noisy settings using superconducting hardware's noise models. Logical resource analysis shows that, for grids ranging from 8×8 to 64×64, the transpiled gate count increases from 3.63×105 to 4.38×106 and the circuit depth from 2.13×105 to 2.56×106. Finally, fault-tolerant resource estimates based on a surface-code model using the Microsoft Quantum Resource Estimator demonstrate the substantial space-time trade-off associated with magic-state production. The results establish a practical circuit-level pathway for implementing the LQW search and provide a basis for evaluating its performance.