相关论文: Quantum hash function using discrete-time quantum …
The dimensionality of the internal coin space of discrete-time quantum walks has a strong impact on the complexity and richness of the dynamics of quantum walkers. While two-dimensional coin operators are sufficient to define a certain…
High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient…
Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model for a discrete-time quantum walk with…
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains.…
The quantum walk was originally proposed as a quantum mechanical analogue of the classical random walk, and has since become a powerful tool in quantum information science. In this paper, we show that discrete time quantum walks provide a…
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 hashing is a useful technique that allows us to construct memory-efficient algorithms and secure quantum protocols. First, we present a circuit that implements the phase form of quantum hashing using $2^{n-1}$ CNOT gates, where n is…
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing…
We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…
We formulate a framework for discrete-time quantum walks, motivated by classical random walks with memory. We present a specific representation of the classical walk with memory 2 on which this is based. The framework has no need for coin…
Quantum blockchains provide inherent resilience against quantum adversaries and represent a promising alternative to classical blockchain systems in the quantum era. However, existing quantum blockchain architectures largely depend on…
Continuous-time quantum walks are natural tools for spatial search, where one searches for a marked vertex in a graph. Sometimes, the structure of the graph causes the walker to get trapped, such that the probability of finding the marked…
The quantum walk is a dynamical protocol which describes the motion of spinful particles on a lattice. Also, it has been demonstrated to be a powerful platform to explore topological quantum matter. Recently, the quantum walk in coherent…
The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at locating a specially marked vertex on square grid graphs,…
In this paper, we study the properties of lackadaisical quantum walks on a line. This model is first proposed in~\cite{wong2015grover} as a quantum analogue of lazy random walks where each vertex is attached $\tau$ self-loops. We derive an…
Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…
We demonstrate an implementation of the hitting time of a discrete time quantum random walk on cubelike graphs using IBM's Qiskit platform. Our implementation is based on efficient circuits for the Grover and Shift operators. We verify the…
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential quantum-classical gap in the hitting time of discrete quantum…
Quantum walks (QWs) are of interest as examples of uniquely quantum behavior and are applicable in a variety of quantum search and simulation models. Implementing QWs on quantum devices is useful from both points of view. We describe a…