Related papers: Microwave Experiments Simulating Quantum Search an…
We present a continuous-time quantum search algorithm on a graphene lattice. This provides the sought-after implementation of an efficient continuous-time quantum search on a two-dimensional lattice. The search uses the linearity of the…
Quantum walks have been very successful in the development of search algorithms in quantum information, in particular in the development of spatial search algorithms. However, the construction of continuous-time quantum search algorithms in…
Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms…
Wave transport devices, such as amplifiers, frequency converters, and nonreciprocal devices, are essential for modern communication, signal processing, and sensing applications. Of particular interest are traveling wave setups, which offer…
A quantum walk on a lattice is a paradigm of a quantum search in a database. The database qubit strings are the lattice sites, qubit rotations are tunneling events, and the target site is tagged by an energy shift. For quantum walks on a…
We propose a novel way to communicate signals in the form of waves across a d - dimensional lattice. The mechanism is based on quantum search algorithms and makes it possible to both search for marked positions in a regular grid and to…
We present a new model to realize artificial 2D lattices with cold atoms investigating the atomic artificial graphene: a 2D-confined matter wave is scattered by atoms of a second species trapped around the nodes of a honeycomb optical…
Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…
Continuous-time quantum walks (CTQW) have shown the capability to perform efficiently the spatial search of a marked site on many kinds of graphs. However, most of such graphs are hard to realize in an experimental setting. Here we study…
Grover's unstructured search algorithm is one of the best examples to date for the superiority of quantum algorithms over classical ones. Its applicability, however, has been questioned by many due to its oracular nature. We propose a…
Artificial graphene consisting of honeycomb lattices other than the atomic layer of carbon has been shown to exhibit electronic properties similar to real graphene. Here, we reverse the argument to show that transport properties of real…
Since Grover's seminal work which provides a way to speed up combinatorial search, quantum search has been studied in great detail. We propose a new method for designing quantum search algorithms for finding a marked element in the state…
Quantum computational devices, currently under development, have the potential to accelerate data analysis techniques beyond the ability of any classical algorithm. We propose the application of a quantum algorithm for the detection of…
We experimentally study the propagation of microwaves in an artificial honeycomb lattice made of dielectric resonators. This evanescent propagation is well described by a tight-binding model, very much like the propagation of electrons in…
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…
We consider the problem of searching a general $d$-dimensional lattice of $N$ vertices for a single marked item using a continuous-time quantum walk. We demand locality, but allow the walk to vary periodically on a small scale. By…
We apply a machine learning algorithm, the artificial neural network, to the search for gravitational-wave signals associated with short gamma-ray bursts. The multi-dimensional samples consisting of data corresponding to the statistical and…
We present a continuous time quantum search algorithm analogous to Grover's. In particular, the optimal search time for this algorithm is proportional to $\sqrt{N}$, where $N$ is the database size. This search algorithm can be implemented…
We address quantum spatial search on graphs and its implementation by continuous-time quantum walks in the presence of dynamical noise. In particular, we focus on search on the complete graph and on the star graph of order $N$, proving that…
Graphene has opened new avenues of research in quantum transport, with potential applications for coherent electronics. Coherent transport depends sensitively on scattering from microscopic disorder present in graphene samples: electron…