相关论文: Slow transport by continuous time quantum walks
We consider a quantum walk model on a finite graph which has an interaction with the outside. Here a quantum walker from the outside penetrates the graph and also a quantum walker in the graph goes out to the outside at every time step.…
We study the quantum-mechanical transport on two-dimensional graphs by means of continuous-time quantum walks and analyse the effect of different boundary conditions (BCs). For periodic BCs in both directions, i.e., for tori, the problem…
We explore the use of machine-learning techniques to detect quantum speedup in random walks on graphs. Specifically, we investigate the performance of three different neural-network architectures (variations on fully connected and…
Coherent transport of an excitation through a network corresponds to continuous-time quantum walk on a graph, and the transport properties of the system may be radically different depending on the graph and on the initial state. The…
Discrete-time quantum walks, quantum generalizations of classical random walks, provide a framework for quantum information processing, quantum algorithms and quantum simulation of condensed matter systems. The key property of quantum…
Continuous-time quantum walks (CTQWs) provide a versatile framework for exploring quantum transport on graphs. In this work, we investigate how the introduction of edge-weight modulation at a single vertex can suppress its occupation…
We introduce a continuous-time quantum walk on an ultrametric space corresponding to the set of p-adic integers and compute its time-averaged probability distribution. It is shown that localization occurs for any location of the ultrametric…
A quantum computer, i.e. utilizing the resources of quantum physics, superposition of states and entanglement, could furnish an exponential gain in computing time. A simulation using such resources is called a quantum simulation. The…
In this paper we present a model exhibiting a new type of continuous-time quantum walk (as a quantum mechanical transport process) on networks, which is described by a non-Hermitian Hamiltonian possessing a real spectrum. We call it…
In this paper we study continuous-time quantum walks on Cayley graphs of the symmetric group, and prove various facts concerning such walks that demonstrate significant differences from their classical analogues. In particular, we show that…
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…
Classical algorithms are often not effective for solving nonconvex optimization problems where local minima are separated by high barriers. In this paper, we explore possible quantum speedups for nonconvex optimization by leveraging the…
In this paper we are examining diffusion properties of stationary continuous-time Weierstrass walk (CTWW). We are showing it is a multi-phase representation of the L\'evy walk. The hierarchical spatial-temporal coupling, combined with…
We consider the dynamics of a separable Continuous Time Random Walk (CTRW) when the random walker is biased by a velocity field in a uniformly growing domain. Concrete examples for such domains include growing biological cells or lipid…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
Continuous-time random walks (CTRWs) on discrete state spaces, ranging from regular lattices to complex networks, are ubiquitous across physics, chemistry, and biology. Models with coarse-grained states, for example those employed in…
We study transport within a spatially heterogeneous one-dimensional quantum walk with a combination of hierarchical and random barriers. Recent renormalization group calculations for a spatially disordered quantum walk with a regular…
Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time instants is identical to the vertex distribution of any…
We study the existence of quantum state transfer on non-integral circulant graphs. We find that continuous time quantum walks on quantum networks based on certain circulant graphs with $2^k$ $\left(k\in\mathbb{Z}\right)$ vertices exhibit…
We present a theoretical framework for the analysis of amplitude transfer in Quantum Variational Algorithms (QVAs) for combinatorial optimisation with mixing unitaries defined by vertex-transitive graphs, based on their continuous-time…