Related papers: Quantum Simulation of a Discrete-Time Quantum Stoc…
It was recently shown that continuous-time quantum walks on dynamic graphs, i.e., sequences of static graphs whose edges change at specific times, can implement a universal set of quantum gates. This result treated all isolated vertices as…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
Quantum walks have emerged as a transformative paradigm in quantum information processing and can be applied to various graph problems. This study explores discrete-time quantum walks on simplicial complexes, a higher-order generalization…
We present a novel Adaptive Distribution Generator that leverages a quantum walks-based approach to generate high precision and efficiency of target probability distributions. Our method integrates variational quantum circuits with…
We analyze a special class of 1-D quantum walks (QWs) realized using optical multi-ports. We assume non-perfect multi-ports showing errors in the connectivity, i.e. with a small probability the multi- ports can connect not to their nearest…
Distributing arbitrary graph states across quantum networks is a central challenge for modular quantum computing and measurement-based quantum communication. We introduce the phase quantum walk (PQW), a discrete-time quantum walk in which…
In the present paper, we study the continuous-time quantum walk on quotient graphs. On such graphs, there is a straightforward reduction of problem to a subspace that can be considerably smaller than the original one. Along the lines of…
The utilization of quantum entanglement as a cryptographic resource has superseded conventional approaches to secure communication. Security and fidelity of intranetwork communication between quantum devices is the backbone of a quantum…
Discrete-time Quantum Walks (QWs) are transportation models of single quantum particles over a lattice. Their evolution is driven through causal and local unitary operators. QWs are a powerful tool for quantum simulation of fundamental…
Discrete time quantum walks (DTQWs) are nontrivial generalizations of random walks with a broad scope of applications. In particular, they can be used as computational primitives, and they are suitable tools for simulating other quantum…
We compare discrete-time quantum walks on graphs to their natural classical equivalents, which we argue are lifted Markov chains, that is, classical Markov chains with added memory. We show that these can simulate quantum walks, allowing us…
Quantum walks are powerful tools for quantum applications and for designing topological systems. Although they are simulated in a variety of platforms, genuine two-dimensional realizations are still challenging. Here we present an…
In this work, we present a new model of the Discrete-Time Open Quantum Walk (DTOQW) applicable to an arbitrary graph, thereby going beyond the case of quantum walks on regular graphs. We study the impact of noise in the dynamics of quantum…
This paper reviews recent advances in continuous-time quantum walks (CTQW) and their application to transport in various systems. The introduction gives a brief survey of the historical background of CTQW. After a short outline of the…
Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum random walk on the line: the use of multiple…
By exploiting the complexity intrinsic to quantum dynamics, quantum technologies promise a whole host of computational advantages. One such advantage lies in the field of stochastic modelling, where it has been shown that quantum stochastic…
Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example…
Quantum walks are powerful kernels in quantum computing protocols that possess strong capabilities in speeding up various simulation and optimisation tasks. One striking example is given by quantum walkers evolving on glued trees for their…
In quantum computing, the connectivity of qubits placed on two-dimensional chips limits the scalability and functionality of solid-state quantum computers. This paper presents two approaches to constructing complex quantum networks from…
This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by…