Related papers: Multi-qubit quantum computing using discrete-time …
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…
Currently there are three major paradigms of quantum computation, the gate model, annealing, and walks on graphs. The gate model and quantum walks on graphs are universal computation models, while annealing plays within a specific subset of…
We present an experimental implementation of the coined discrete time quantum walk on a square using a three qubit liquid state nuclear magnetic resonance (NMR) quantum information processor (QIP). Contrary to its classical counterpart, we…
Quantum walks are promising tools based on classical random walks, with plenty of applications such as many variants of optimization. Here we introduce the semiclassical walks in discrete time, which are algorithms that combines classical…
In this work, we present a new algorithm for generating quantum circuits that efficiently implement continuous time quantum walks on arbitrary simple sparse graphs. The algorithm, called matching decomposition, works by decomposing a…
Based on the Dirac representation of Maxwell equations we present an explicit, discrete space-time, quantum walk-inspired algorithm suitable for simulating the electromagnetic wave propagation and scattering from inhomogeneities within…
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…
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…
Quantum random walks have received much interest due to their non-intuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable…
Simulation and programming of current quantum computers as Noisy Intermediate-Scale Quantum (NISQ) devices represent a hot topic at the border of current physical and information sciences. The quantum walk process represents a basic…
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…
Quantum walks are referred to as quantum analogs to random walks in mathematics. They have been studied as quantum algorithms in quantum information for quantum computers. There are two types of quantum walks. One is the discrete-time…
The connection between coined and continuous-time quantum walk models has been addressed in a number of papers. In most of those studies, the continuous-time model is derived from coined quantum walks by employing dimensional reduction and…
We demonstrate that continuous time quantum walks on several types of branching graphs, including graphs with loops, are identical to quantum walks on simpler linear chain graphs. We also show graph types for which such equivalence does not…
Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations.…
We propose a scheme for realizing the scalable quantum computation based on nonidentical quantum dots trapped in a single-mode waveguide. In this system, the quantum dots simultaneously interact with a large detuned waveguide and classical…
We identify a key difference between quantum search by discrete- and continuous-time quantum walks: a discrete-time walk typically performs one walk step per oracle query, whereas a continuous-time walk can effectively perform multiple walk…
Using electrostatic gates to control the electron positions, we present a new controlled-NOT gate based on quantum dots. The qubit states are chosen to be the spin states of an excess conductor electron in the quantum dot; and the main…
This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is on the connections and differences between the two types of…
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…