Related papers: Computing Large Deviations of First-Passage-Time S…
We consider two particles performing continuous-time nearest neighbor random walk on $\mathbb Z$ and interacting with each other when they are at neighboring positions. Typical examples are two particles in the partial exclusion process or…
We present the statistical method as a direct extension of the mean first-passage time concept to the analysis of molecular dynamics simulation data of a phase transformation. According to the method, the mean first-passage time…
We propose a measurement-based model for fault-tolerant quantum computation that can be realised with one-dimensional cluster states and fusion measurements only; basic resources that are readily available with scalable photonic hardware.…
Under suitable conditions, one-step generalized method of moments (GMM) based on the first-difference (FD) transformation is numerically equal to one-step GMM based on the forward orthogonal deviations (FOD) transformation. However, when…
A hybrid asymptotic-numerical method is presented for obtaining the full probability distribution of capture times of a random walker by multiple small traps located inside a bounded two-dimensional domain with reflective boundaries. As…
First-passage times are often the most relevant aspect of a complex Markovian network, because they signify when information processing has resulted in a definite decision. Previous studies have shown that for kinetic proofreading networks…
The information of quantum pathways can be extracted in the framework of the Hamiltonian-encoding and Observable-decoding method. For closed quantum systems, only off-diagonal elements of the Hamiltonian in the Hilbert space is required to…
In this work we study drawdowns and drawups of general diffusion processes. The drawdown process is defined as the current drop of the process from its running maximum, while the drawup process is defined as the current increase over its…
We apply a large-deviation method to study the diffusive trajectories of the quadrature operators of light within a reservoir connected to dissipative quantum systems. We formulate the study of quadrature trajectories in terms of…
A numerical method is proposed for simulation of composite open quantum systems. It is based on Lindblad master equations and adiabatic elimination. Each subsystem is assumed to converge exponentially towards a stationary subspace, slightly…
We consider the branching random walk drifting to $-\infty$ and we investigate large deviations-type estimates for the first passage time. We prove the corresponding law of large numbers and the central limit theorem.
Variational quantum algorithms dominate contemporary gate-based quantum enhanced optimisation, eigenvalue estimation and machine learning. Here we establish the quantum computational universality of variational quantum computation by…
The 1+1D Ising model is an ideal benchmark for quantum algorithms, as it is very well understood theoretically. This is true even when expanding the model to include complex coupling constants. In this work, we implement quantum algorithms…
The first passage time (FPT) problem is studied for superstatistical models assuming that the mesoscopic system dynamics is described by a Fokker-Planck equation. We show that all moments of the random intensive parameter associated to the…
Quantum computers can efficiently sample from probability distributions that are believed to be classically intractable, providing a foundation for quantum generative modeling. However, practical training of such models remains challenging,…
Probability generating functions for first passage times of Markov chains are found using the method of collective marks. A system of equations is found which can be used to obtain moments of the first passage times.
Spatial fields in the Earth and environmental sciences are often available at multiple scales or resolutions. While coarse-scale data (e.g., from global circulation models) are often abundant, they lack the local detail provided by…
We present a new tool, GPA, that can generate key performance measures for very large systems. Based on solving systems of ordinary differential equations (ODEs), this method of performance analysis is far more scalable than stochastic…
Let $\{D(s), s \geq 0\}$ be a non-decreasing L\'evy process. The first-hitting time process $\{E(t) t \geq 0\}$ (which is sometimes referred to as an inverse subordinator) defined by $E(t) = \inf \{s: D(s) > t \}$ is a process which has…
We consider the first-passage problem for $N$ identical independent particles that are initially released uniformly in a finite domain $\Omega$ and then diffuse toward a reactive area $\Gamma$, which can be part of the outer boundary of…