相关论文: Quantum walks and quantum search on graphene latti…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…
We address continuous-time quantum walks on graphs in the presence of time- and space-dependent noise. Noise is modeled as generalized dynamical percolation, i.e. classical time-dependent fluctuations affecting the tunneling amplitudes of…
Nowadays, quantum simulation schemes come in two flavours. Either they are continuous-time discrete-space models (a.k.a Hamiltonian-based), pertaining to non-relativistic quantum mechanics. Or they are discrete-spacetime models (a.k.a…
In this paper, we propose a circuit design for implementing quantum walks on complex networks. Quantum walks are powerful tools for various graph-based applications such as spatial search, community detection, and node classification.…
Recently several quantum search algorithms based on quantum walks were proposed. Those algorithms differ from Grover's algorithm in many aspects. The goal is to find a marked vertex in a graph faster than classical algorithms. Since the…
A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the…
We study numerically the behavior of continuous-time quantum walks over networks which are topologically equivalent to square lattices. On short time scales, when placing the initial excitation at a corner of the network, we observe a fast,…
Quantum walks have emerged as an interesting alternative to the usual circuit model for quantum computing. While still universal for quantum computing, the quantum walk model has very different physical requirements, which lends itself more…
We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum-walk features such as localization that starkly distinguishes classical from quantum…
To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a…
Quantum walks are a powerful framework for the development of quantum algorithms, with lackadaisical quantum walks (LQWs) standing out as an efficient model for spatial search. In this work, we investigate how broken-link decoherence…
We study quantum transport on finite discrete structures and we model the process by means of continuous-time quantum walks. A direct and effective comparison between quantum and classical walks can be attained based on the average…
Continuous time quantum walks provide an important framework for designing new algorithms and modelling quantum transport and state transfer problems. Often, the graph representing the structure of a problem contains certain symmetries that…
One approach to the development of quantum search algorithms is the quantum walk. A spatial search can be effected by the continuous-time evolution of a single quantum particle on a graph containing a marked site. In many physical…
We introduce the driven discrete time quantum walk, where walkers are added during the walk instead of only at the beginning. This leads to interference in walker number and very different dynamics when compared to the original quantum…
Quantum walks, both discrete (coined) and continuous time, on a general graph of N vertices with undirected edges are reviewed in some detail. The resource requirements for implementing a quantum walk as a program on a quantum computer are…
We discuss an efficient physical realization of topological quantum walks on a finite lattice. The $N$-point lattice is realized with $\log_2 N$ qubits, and the quantum circuit utilizes a number of quantum gates which is polynomial in the…
In this paper we isolate the combinatorial property responsible (at least in part) for the computational speedups recently observed in some quantum walk algorithms. We find that continuous-time quantum walks can exploit the covering space…
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…
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…