Related papers: Generator of an abstract quantum walk
Quantum walks exhibit properties without classical analogues. One of those is the phenomenon of asymptotic trapping -- there can be non-zero probability of the quantum walker being localised in a finite part of the underlying graph…
Quantum counting is a key quantum algorithm that aims to determine the number of marked elements in a database. This algorithm is based on the quantum phase estimation algorithm and uses the evolution operator of Grover's algorithm because…
In this paper, we introduce and investigate a model of magnetic quantum walk on a general hypercube. We first construct a set of unitary involutions associated with a magnetic potential $\nu$ by using quantum Bernoulli noises. And then,…
We clarify that coined quantum walk is determined by only the choice of local quantum coins. To do so, we characterize coined quantum walks on graph by disjoint Euler circles with respect to symmetric arcs. In this paper, we introduce a new…
We investigate the quantum dynamics of the isotropic Universe in the presence of a free massless scalar field, playing the role of a physical clock. The Hilbert space is constructed via a direct analogy between the Wheeler-DeWitt equation…
We propose categories of $1$-dimensional and multi-dimensional quantum walks. In the categories, an object is a quantum walk, and a morphism is an intertwining operator between two quantum walks. The new framework enables us to discuss…
We introduce and solve from first principles a continuous-time quantum walk with absorption generated by a Lindblad boundary sink of arbitrary strength. Tracing out the sink maps the problem onto a non-Hermitian tight-binding Hamiltonian…
Quantum walks (QWs) describe particles evolving coherently on a lattice. The internal degree of freedom corresponds to a Hilbert space, called coin system. We consider QWs on Cayley graphs of some group $G$. In the literature,…
The Grover walk, which is related to the Grover's search algorithm on a quantum computer, is one of the typical discrete time quantum walks. However, a localization of the two-dimensional Grover walk starting from a fixed point is striking…
The concept of open quantum walks (OQW), quantum walks exclusively driven by the interaction with the external environment, is reviewed. OQWs are formulated as discrete completely positive maps on graphs. The basic properties of OQWs are…
Very much as its classical counterpart, quantum cellular automata are expected to be a great tool for simulating complex quantum systems. Here we introduce a partitioned model of quantum cellular automata and show how it can simulate, with…
Recent developments in the index theory of discrete-time quantum walks allow us to assign a certain well-defined supersymmetric index to a pair of a unitary time-evolution $U$ and a $\mathbb{Z}_2$-grading operator $\varGamma$ satisfying the…
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. For a long time, these models have interested the community for their nice properties such as locality or translation invariance. This…
This paper presents a novel methodology that transforms discrete-time quantum walks into a graph embedding technique, offering a fresh perspective on graph representation methods.Through mathematical manipulations, the approach of this…
A convergence theorem is obtained for quantum random walks with particles in an arbitrary normal state. This result unifies and extends previous work on repeated-interactions models, including that of the author (2010, J. London Math. Soc.…
This article presents a simplified version of the author's previous work. We first construct a causal growth process (CGP). We then form path Hilbert spaces using paths of varying lengths in the CGP. A sequence of positive operators on…
The capability to generate and manipulate quantum states in high-dimensional Hilbert spaces is a crucial step for the development of quantum technologies, from quantum communication to quantum computation. One-dimensional quantum walk…
In this work, we generalize the recently-introduced graph composition framework to the non-boolean setting. A quantum algorithm in this framework is represented by a hypergraph, where each hyperedge is adjacent to multiple vertices. The…
For the description of quantum evolution, the use of a manifestly time-dependent quantum Hamiltonian $\mathfrak{h}(t) =\mathfrak{h}^\dagger(t)$ is shown equivalent to the work with its simplified, time-independent alternative $G\neq…
Open Quantum Walks (OQW) are a type of quantum walk governed by the system's interaction with its environment. We explore the time evolution and the limit behavior of the OQW framework for Quantum Computation and show how we can represent…