相关论文: Electric circuit induced by quantum walk

Time-reversal symmetry is of fundamental importance to physics. In the classical theory of time-reversal symmetry, the time-reversal symmetry of a quantum system is described by an anti-unitary operator, which is known as the time-reversal…

We introduce a minimal set of physically motivated postulates that the Hamiltonian H of a continuous-time quantum walk should satisfy in order to properly represent the quantum counterpart of the classical random walk on a given graph. We…

Recently, Apers and Piddock [TQC '23] strengthened the connection between quantum walks and electrical networks via Kirchhoff's Law and Ohm's Law. In this work, we develop a new multidimensional electrical network by defining Alternative…

Recently, random walks on dynamic graphs have been studied because of their adaptivity to the time-varying structure of real-world networks. In general, there is a tremendous gap between static and dynamic graph settings for the lazy simple…

We consider the definition of quantum walks on directed graphs. Call a directed graph reversible if, for each pair of vertices (i, j), if i is connected to j then there is a path from j to i. We show that reversibility is a necessary and…

This paper presents a connection between the quantum walk and the absolute mathematics. The quantum walk is a quantum counterpart of the classical random walk. We especially deal with the Grover walk on a graph. The Grover walk is a typical…

Consider a quantum graph consisting of a ring with two attached edges, and assume Kirchhoff-Neumann conditions hold at the internal vertices. Associated to this graph is a Schr\"{o}dinger type operator $L=-\Delta +q(x)$ with Dirichlet…

We extend our study of random walks and induced Dirichlet forms on self-similar sets [arXiv:1604.05440, 1612.01708] to compact spaces of homogeneous type $(K, \rho ,\mu)$. A successive partition on $K$ brings a natural augmented tree…

A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…

The simplest way to make a dynamical system out of a finite connected graph $G$ is to give it a polarization, that is to say a cyclic ordering of the edges incident to a vertex, for each vertex. The phase space $\mathcal{P}(G)$ then…

We define a general model of stochastically-evolving graphs, namely the \emph{Edge-Uniform Stochastically-Evolving Graphs}. In this model, each possible edge of an underlying general static graph evolves independently being either alive or…

There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…

We introduce a family of discrete-time quantum walks, called two-partition model, based on two equivalence-class partitions of the computational basis, which establish the notion of local dynamics. This family encompasses most versions of…

Let $G_S$ be a graph with loops attached at each vertex in $S \subseteq V(G).$ In this article, we develop exact formulae for the number of closed $3$- and $4$-walks on $G_S$ in terms of vertex degrees and certain elementary subgraphs of…

Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…

A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…

We study continuous time random walks on $\mathbb{Z}^d$ (with $d \geq 2$) among random conductances $\{ \omega(\{x,y\}) : x,y \in \mathbb{Z}^d\}$ that permit jumps of arbitrary length. The law of the random variables $\omega(\{x,y\})$,…

We define a zeta function of a finite graph derived from time evolution matrix of quantum walk, and give its determinant expression. Furthermore, we generalize the above result to a periodic graph.

A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of discrete-time quantum walk whose transition matrix is given by two reflections, using…

In certain instances an electric network transforms in natural ways by the addition or removal of an edge. This can have interesting consequences for random walks, in light of the known relationships between electric resistance and random…