Related papers: Lazy Quantum Walks with Native Multiqubit Gates
The quantum walk is the quantum analogue of the well-known random walk, which forms the basis for models and applications in many realms of science. Its properties are markedly different from the classical counterpart and might lead to…
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…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
We present a native approach for realizing multi-qubit parity phase gates in neutral atom systems through global phase modulation of a Rydberg excitation laser. By shaping the temporal profile of the laser's phase, we enable high fidelity,…
Rydberg quantum gate serving as an indispensable computing unit for neutral-atom quantum computation, has attracted intense research efforts for the last decade. However the state-of-the-art experiments have not reached the high gate…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…
We have previously discussed the design of a neutral atom quantum computer with an on-demand interaction [E. Hosseini Lapasar, et al., J. Phys. Soc. Jpn. 80, 114003 (2011)]. In this contribution, we propose an experimental method to…
Continuous-time quantum walk is one of the alternative approaches to quantum computation, where a universal set of quantum gates can be achieved by scattering a quantum walker on some specially-designed structures embedded in a sparse graph…
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…
The quantum random walk is a possible approach to construct new quantum algorithms. Several groups have investigated the quantum random walk and experimental schemes were proposed. In this paper we present the experimental implementation of…
Exploiting multi-dimensional quantum walks as feasible platforms for quantum computation and quantum simulation is attracting constantly growing attention from a broad experimental physics community. Here, we propose a two-dimensional…
We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently…
Recently, several groups have investigated quantum analogues of random walk algorithms, both on a line and on a circle. It has been found that the quantum versions have markedly different features to the classical versions. Namely, the…
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…
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science.…
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…
We introduce the quantum quincunx, which physically demonstrates the quantum walk and is analogous to Galton's quincunx for demonstrating the random walk. In contradistinction to the theoretical studies of quantum walks over orthogonal…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
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…
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…