Related papers: Experimental Implementation of the Quantum Random-…
People are witnessing quantum computing revolutions nowadays. Progress in the number of qubits, coherence times and gate fidelities are happening. Although quantum error correction era has not arrived, the research and development of…
Quantum algorithms have demonstrated provable speedups over classical counterparts, yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge. In this work, we decode the quantum…
Quantum random walks are the quantum counterpart of classical random walks, and were recently studied in the context of quantum computation. A quantum random walker is subject to self interference, leading to a remarkably different behavior…
Quantum walks function as essential means to implement quantum simulators, allowing one to study complex and often directly inaccessible quantum processes in controllable systems. In this contribution, the notion of a driven Gaussian…
We present a discrete-time, one-dimensional quantum walk based on the entanglement between the momentum of ultracold rubidium atoms (the walk space) and two internal atomic states (the "coin" degree of freedom). Our scheme is highly…
We introduce a quantum algorithm for simulating the time-dependent Dirac equation in 3+1 dimensions using discrete-time quantum walks. Thus far, promising quantum algorithms have been proposed to simulate quantum dynamics in…
We show that quantum walks interpolate between a coherent `wave walk' and a random walk depending on how strongly the walker's coin state is measured; i.e., the quantum walk exhibits the quintessentially quantum property of complementarity,…
The quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range…
A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. Here we…
Quantum state preparation in high-dimensional systems is an essential requirement for many quantum-technology applications. The engineering of an arbitrary quantum state is, however, typically strongly dependent on the experimental platform…
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,…
The standard quantum annealing algorithm tries to approach the ground state of a classical system by slowly decreasing the hopping rates of a quantum random walk in the configuration space of the problem, where the on-site energies are…
We present a scheme for multi-bit quantum random number generation using a single qubit discrete-time quantum walk in one-dimensional space. Irrespective of the initial state of the qubit, quantum interference and entanglement of particle…
Although quantum walks exhibit peculiar properties that distinguish them from random walks, classical behavior can be recovered in the asymptotic limit by destroying the coherence of the pure state associated to the quantum system. Here I…
Quantum Cryptography is a rapidly developing field of research that benefits from the properties of Quantum Mechanics in performing cryptographic tasks. Quantum walks are a powerful model for quantum computation and very promising for…
Quantum walk has emerged as an essential tool for searching marked vertices on various graphs. Recent advances in the discrete-time quantum walk search algorithm have enabled it to effectively handle multiple marked vertices, expanding its…
In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical random walk and its quantum analogue. In this graph,…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Quantum walks are recognizably useful for the development of new quantum algorithms, as well as for the investigation of several physical phenomena in quantum systems. Actual implementations of quantum walks face technological difficulties…
A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…