Related papers: Universal computation by multi-particle quantum wa…
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…
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. Searching in this mathematical framework has interested the community since a long time. However, most results consider spatial search…
Unitary Coined Discrete-Time Quantum Walks (UC-DTQW) constitute a universal model of quantum computation, meaning that any computation done by a general purpose quantum computer can either be done using the UC-DTQW framework. In the last…
Quantum computation can proceed solely through single-qubit measurements on an appropriate quantum state, such as the ground state of an interacting many-body system. We investigate a simple spin-lattice system based on the cluster-state…
Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the…
Quantum walk is a useful model to simulate complex quantum systems and to build quantum algorithms; in particular, to develop spatial search algorithms on graphs, which aim to find a marked vertex as quickly as possible. Quantum walks are…
The characterization of the Hamiltonian parameters defining a quantum walk is of paramount importance when performing a variety of tasks, from quantum communication to computation. When dealing with physical implementations of quantum…
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…
A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results…
We show that with the addition of multiple walkers, quantum walks on a line can be transformed into lattice graphs of higher dimension. Thus, multi-walker walks can simulate single-walker walks on higher dimensional graphs and vice versa.…
Quantum walks constitute a rich area of quantum information science, where multipartite entanglement plays a central role in the dynamics and scalability of quantum advantage over classical simulators. In this work, we study the…
Coherent evolution governs the behaviour of all quantum systems, but in nature it is often subjected to influence of a classical environment. For analysing quantum transport phenomena quantum walks emerge as suitable model systems. In…
Loop is a powerful program construct in classical computation, but its power is still not exploited fully in quantum computation. The exploitation of such power definitely requires a deep understanding of the mechanism of quantum loop…
In a Quantum Walk (QW) the "walker" follows all possible paths at once through the principle of quantum superposition, differentiating itself from classical random walks where one random path is taken at a time. This facilitates the…
A universal quantum simulator would enable efficient simulation of quantum dynamics by implementing quantum-simulation algorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that…
In this letter we introduce the concept of a driven quantum walk. This work is motivated by recent theoretical and experimental progress that combines quantum walks and parametric down- conversion, leading to fundamentally different…
A proposal for a magnetic quantum processor that consists of individual molecular spins coupled to superconducting coplanar resonators and transmission lines is carefully examined. We derive a simple magnetic quantum electrodynamics…
We describe how one may go about performing quantum computation with arbitrary "quantum stuff", as long as it has some basic physical properties. Imagine a long strip of stuff, equipped with regularly spaced wires to provide input settings…
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…
This paper presents a novel quantum walk approach to simulating parton showers on a quantum computer. We demonstrate that the quantum walk paradigm offers a natural and more efficient approach to simulating parton showers on quantum…