Related papers: DeepRWCap: Neural-Guided Random-Walk Capacitance S…
We present a quantum image encryption protocol that harnesses discrete-time quantum walks (DTQWs) on cycles and explicitly examines the role of the Parrondo paradox in security. Using the NEQR representation, a DTQW-generated probability…
We present a deep neural network (DNN) accelerated Hamiltonian Monte Carlo (HMC) algorithm called DeepHMC for the inference of binary neutron star systems. The HMC is a non-random walk sampler that uses background gradient information to…
Web-based interactions can be frequently represented by an attributed graph, and node clustering in such graphs has received much attention lately. Multiple efforts have successfully applied Graph Convolutional Networks (GCN), though with…
Many current works directly adopt multi-rate depth-wise dilated convolutions to capture multi-scale contextual information simultaneously from one input feature map, thus improving the feature extraction efficiency for real-time semantic…
We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently…
In recent years, there has been an emerging trend of combining two innovations in computer science and physics to achieve better computation capability. Exploring the potential of quantum computation to achieve highly efficient performance…
While one-dimensional Markov processes are well understood, going to higher dimensions there are only a few analytically solved Ising-like models, in practice requiring to use relatively costly, uncontrollable and inaccurate Monte-Carlo…
Promising results have been reported in quantifying microstructural parameters (free diffusivity, cell size, and membrane permeability) in head and neck cancers (HNCs) using time-dependent diffusion MRI fitted to Random Walk with Barrier…
Quantum walks are powerful kernels in quantum computing protocols that possess strong capabilities in speeding up various simulation and optimisation tasks. One striking example is given by quantum walkers evolving on glued trees for their…
Researchers have designed many algorithms to measure the distances between graph nodes, such as average hitting times of random walks, cosine distances from DeepWalk, personalized PageRank, etc. Successful although these algorithms are,…
Random walks are frequently used as a model for very diverse physical phenomena. The Monte Carlo method is a versatile tool for the study of the properties of systems modelled as random walks. Often, each walker is associated with a…
Partial differential equation (PDE) solvers underpin scientific computing, but real-world deployment is bounded by compute. Classical Monte Carlo solvers such as Walk-on-Spheres (WoS) are unbiased and geometry-agnostic but are slow. Learned…
Reactive stepping and push recovery for biped robots is often restricted to flat terrains because of the difficulty in computing capture regions for nonlinear dynamic models. In this paper, we address this limitation by using reinforcement…
We study the dynamical localization of discrete time evolution of topological split-step quantum random walk (QRW) on a single-site defect starting from a uniform distribution. Using analytical and numerical calculations, we determine the…
We introduce a class of multifractal processes, referred to as Multifractal Random Walks (MRWs). To our knowledge, it is the first multifractal processes with continuous dilation invariance properties and stationary increments. MRWs are…
Quantum walks are central to a wide range of applications such as quantum search, quantum information processing, and entanglement transport. Gaining control over the duration and the direction of quantum walks (QWs) is crucial to…
High dimensional sampling is an important computational tool in statistics and other computational disciplines, with applications ranging from Bayesian statistical uncertainty quantification, metabolic modeling in systems biology to volume…
Deep learning systems extensively use convolution operations to process input data. Though convolution is clearly defined for structured data such as 2D images or 3D volumes, this is not true for other data types such as sparse point…
Learning-based approaches have witnessed great successes in blind single image super-resolution (SISR) tasks, however, handcrafted kernel priors and learning based kernel priors are typically required. In this paper, we propose a…
Accurately predicting chemical reactions is essential for driving innovation in synthetic chemistry, with broad applications in medicine, manufacturing, and agriculture. At the same time, reaction prediction is a complex problem which can…