A linear stochastic biharmonic heat equation: hitting probabilities

Consider the linear stochastic biharmonic heat equation on a d–dimen- sional torus ($$d=1,2,3$$ d = 1 , 2 , 3 ), driven by a space-time white noise and with periodic boundary conditions: $$\begin{aligned} \left( \frac{\partial }{\partial t}+(-\varDelta )^2\right) v(t,x)= \sigma \dot{W}(t,x),\ (t,x)\in (0,T]\times {\mathbb {T}}^d, \end{aligned}$$ ∂ ∂ t + ( - Δ ) 2 v ( t , x ) = σ W ˙ ( t , x ) , ( t , x ) ∈ ( 0 , T ] × T d , $$v(0,x)=v_0(x)$$ v ( 0 , x ) = v 0 ( x ) . We find the canonical pseudo-distance corresponding to the random field solution, therefore the precise description of the anisotropies of the process. We see that for $$d=2$$ d = 2 , they include a $$z(\log \tfrac{c}{z})^{1/2}$$ z ( log c z ) 1 / 2 term. Consider D independent copies of the random field solution to (0.1). Applying the criteria proved in Hinojosa-Calleja and Sanz-Solé (Stoch PDE Anal Comp 2021. 10.1007/s40072-021-00190-1), we establish upper and lower bounds for the probabilities that the path process hits bounded Borel sets.This yields results on the polarity of sets and on the Hausdorff dimension of the path process.

An HHL-based algorithm for computing hitting probabilities of quantum walks

We present a novel application of the HHL (Harrow-Hassidim-Lloyd) algorithm --- a quantum algorithm solving systems of linear equations --- in solving an open problem about quantum walks, namely computing hitting (or absorption) probabilities of a general (not only Hadamard) one-dimensional quantum walks with two absorbing boundaries. This is achieved by a simple observation that the problem of computing hitting probabilities of quantum walks can be reduced to inverting a matrix. Then a quantum algorithm with the HHL algorithm as a subroutine is developed for solving the problem, which is faster than the known classical algorithms by numerical experiments.