Related papers: Two-particle scattering on general graphs
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 propose a phenomenon of discrete-time quantum walks on graphs called the pulsation, which is a generalization of a phenomenon in the quantum searches. This phenomenon is discussed on a composite graph formed by two connected graphs…
Quantum walks have been shown to have a wide range of applications, from artificial intelligence, to photosynthesis, and quantum transport. Quantum stochastic walks (QSWs) generalize this concept to additional non-unitary evolution. In this…
Universal quantum computation may be realized based on quantum walk, by formulating it as a scattering problem on a graph. In this paper, we simulate quantum gates through electric circuits, following a recent report that a one-dimensional…
Hitting the exit node from the entrance node faster on a graph is one of the properties that quantum walk algorithms can take advantage of to outperform classical random walk algorithms. Especially, continuous-time quantum walks on…
Society relies and depends increasingly on information exchange and communication. In the quantum world, security and privacy is a built-in feature for information processing. The essential ingredient for exploiting these quantum advantages…
A quantum scattering theory is developed for Fock states scattered by two-level systems in the free space. Compared to existing scattering theories that treat incident light semi-classically, the theory fully quantizes the incident light as…
In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for $N$-fold star power graph, which are invariant under the quantum…
We develop a scattering theory to investigate the multi-photon transmission in a one-dimensional waveguide in the presence of quantum emitters. It is based on a path integral formalism, uses displacement transformations, and does not…
Near-term quantum computers can hold only a small number of qubits. One way to facilitate large-scale quantum computations is through a distributed network of quantum computers. In this work, we consider the problem of distributing quantum…
Many-particles quantum walks of particles obeying Bose statistics moving on graphs of various topologies are introduced. A single coin tossing commands the conditional shift operation over the whole graph. Vertices particle densities, the…
Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time…
The coined quantum walk is a discretization of the Dirac equation of relativistic quantum mechanics, and it is the basis of many quantum algorithms. We investigate how it searches the complete bipartite graph of $N$ vertices for one of $k$…
We study the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of $S^+(U^3)$, a matrix based on the amplitudes of walks in the quantum walk,…
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 give new observations on the mixing dynamics of a continuous-time quantum walk on circulants and their bunkbed extensions. These bunkbeds are defined through two standard graph operators: the join G + H and the Cartesian product of…
In this paper we review recent work that has been done on quantum many-particle systems on metric graphs. Topics include the implementation of singular interactions, Bose-Einstein condensation, sovable models and spectral properties of some…
Quantum circuits generating probability distributions has applications in several areas. Areas like finance require quantum circuits that can generate distributions that mimic some given data pattern. Hamiltonian simulations require…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
We give a new determinant expression for the characteristic polynomial of the bond scattering matrix of a quantum graph G. Also, we give a decomposition formula for the characteristic polynomial of the bond scattering matrix of a regular…