Related papers: Discrete-time quantum walk approach to high-dimens…
A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of discrete-time quantum walk whose transition matrix is given by two reflections, using…
The ability to realize high-fidelity quantum communication is one of the many facets required to build generic quantum computing devices. In addition to quantum processing, sensing, and storage, transferring the resulting quantum states…
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…
We investigate quantum state transfer on a class of bipartite graphs, namely the butterfly graphs, within the framework of discrete-time quantum walks. These graphs facilitate the construction of scalable quantum networks that enable…
In a continuous-time quantum walk on a network of qubits, pretty good state transfer is the phenomenon of state transfer between two vertices with fidelity arbitrarily close to 1. We construct families of graphs to demonstrate that there is…
In many quantum information processing applications, it is important to be able to transfer a quantum state from one location to another - even within a local device. Typical approaches to implement the quantum state transfer rely on…
Quantum spin networks can be used to transport information between separated registers in a quantum information processor. To find a practical implementation, the strict requirements of ideal models for perfect state transfer need to be…
We propose a scheme to implement the one-dimensional coined quantum walk with electrons transported through a two-dimensional network of spintronic semiconductor quantum rings. The coin degree of freedom is represented by the spin of the…
We suggest a scheme that allows arbitrarily perfect state transfer even in the presence of random fluctuations in the couplings of a quantum chain. The scheme performs well for both spatially correlated and uncorrelated fluctuations if they…
Quantum networks are complex systems formed by the interaction among quantum processors through quantum channels. Analogous to classical computer networks, quantum networks allow for the distribution of quantum computation among quantum…
Quantum percolation describes the problem of a quantum particle moving through a disordered system. While certain similarities to classical percolation exist, the quantum case has additional complexity due to the possibility of Anderson…
Here, a new two-dimensional process, discrete in time and space, that yields the results of both a random walk and a quantum random walk, is introduced. This model describes the population distribution of four coin states |1>,-|1>, |0> -|0>…
Discrete time quantum walks are known to be universal for quantum computation. This has been proven by showing that they can simulate a universal quantum gate set. In this paper, we examine computation by quantum walks in terms of language…
Effective transport of quantum information is an essential element of quantum computation. We consider the problem of transporting a quantum state by using a moving potential well, while maintaining the encoded quantum information. In…
We study the existence of quantum state transfer on non-integral circulant graphs. We find that continuous time quantum walks on quantum networks based on certain circulant graphs with $2^k$ $\left(k\in\mathbb{Z}\right)$ vertices exhibit…
We propose and analyze an efficient high-dimensional quantum state transfer scheme through an $XXZ$-Heisenberg spin chain in an inhomogeneous magnetic field. By the use of a combination of coherent quantum coupling and free spin-wave…
We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker can move [C. Di Franco, M. Mc Gettrick, and…
The quantum walk (QW) is the term given to a family of algorithms governing the evolution of a discrete quantum system and as such has a founding role in the study of quantum computation. We contribute to the investigation of QW phenomena…
Quantum walks, in virtue of the coherent superposition and quantum interference, possess exponential superiority over its classical counterpart in applications of quantum searching and quantum simulation. The quantum enhanced power is…
Discrete time quantum walks are known to be universal for quantum computation. This has been proven by showing that they can simulate a universal gate set. In this paper we examine computation in terms of language acceptance and present two…