相关论文: Limit Theorems for Quantum Walks on the Union of P…

The number of walks from one vertex to another in a finite graph can be counted by the adjacency matrix. In this paper, we prove two theorems that connect the graph Laplacian with two types of walks in a graph. By defining two types of…

We prove a central limit theorem for random walks with finite variance on linear groups.

First, we prove a \emph{local almost sure central limit theorem} for lattice random walks in the plane. The corresponding version for random walks in the line was considered by the author in \cite{5}. This gives us a quantitative version of…

We give a new formula for computing the isospectral reduction of a matrix (and graph) down to a submatrix (or subgraph). Using this, we generalize the notion of isospectral reductions. In addition, we give a procedure for constructing a…

We extend the scheme of quantum teleportation by quantum walks introduced by Wang et al. (2017). First, we introduce the mathematical definition of the accomplishment of quantum teleportation by this extended scheme. Secondly, we show a…

In this paper, we review the recently formulated quantum laws of motion and provide new observations. We also extend these laws to higher dimensions. By applying in two dimensions the obtained relations to charge submitted to an electric…

Quantum trajectories are Markov processes modeling the evolution of a quantum system subjected to repeated independent measurements. Inspired by the theory of random products of matrices, it has been shown that these Markov processes admit…

The connection between coined and continuous-time quantum walk models has been addressed in a number of papers. In most of those studies, the continuous-time model is derived from coined quantum walks by employing dimensional reduction and…

A continuous-time quantum walk on a dynamic graph evolves by Schr\"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that…

We study a class of symmetric quantum walks on Hamming graphs, where the distance between vertices specifies the transition probability. A special model is the simple quantum walk on the hypercube, which has been discussed in the…

We develop a new framework that extends the quantum walk framework of Magniez, Nayak, Roland, and Santha, by utilizing the idea of quantum data structures to construct an efficient method of nesting quantum walks. Surprisingly, only…

Discrete-time quantum walks are considered a counterpart of random walks and the study for them has been getting attention since around 2000. In this paper, we focus on a quantum walk which generates a probability distribution splitting to…

We formulate and prove a general weak limit theorem for quantum random walks in one and more dimensions. With $X_n$ denoting position at time $n$, we show that $X_n/n$ converges weakly as $n \to \infty$ to a certain distribution which is…

We introduce an object called a \emph{subspace graph} that formalizes the technique of multidimensional quantum walks. Composing subspace graphs allows one to seamlessly combine quantum and classical reasoning, keeping a classical structure…

We generalize the classical K\"onig's and B\"ottcher's Theorems in complex dynamics to certain quasiregular mappings in the plane. Our approach to these results is unified in the sense that it does not depend on the local injectivity, or…

We introduce action quantum speed limits (QSLs) as a family of bounds on the minimal time to connect two states that, unlike the usual geometric approach, crucially depend on how the path is traversed, i.e. on the instantaneous speed. The…

We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…

We consider the range of random walks up to time n, R_n, on graphs satisfying a uniform condition. This condition is characterized by potential theory. Not only all vertex transitive graphs but also many non-regular graphs satisfy the…

Quantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation. Any given quantum circuit can be broken down into single- and two-qubit gates, which can then…

Quantum state preparation in high-dimensional systems is an essential requirement for many quantum-technology applications. The engineering of an arbitrary quantum state is, however, typically strongly dependent on the experimental platform…