Related papers: Microwave Experiments Simulating Quantum Search an…
Transient gravitational-wave searches can be divided into two main families of approaches: modelled and unmodelled searches, based on matched filtering techniques and time-frequency excess power identification respectively. The former,…
We analyse the eigenvalue and eigenvector structure of the flip-flop quantum walk on regular graphs, explicitly demonstrating how it is quadratically faster than the classical random walk. Then we use it in a controlled spatial search…
Gravitational wave science is a pioneering field with rapidly evolving data analysis methodology currently assimilating and inventing deep learning techniques. The bulk of the sophisticated flagship searches of the field rely on the…
The problem of finding a marked node in a graph can be solved by the spatial search algorithm based on continuous-time quantum walks (CTQW). However, this algorithm is known to run in optimal time only for a handful of graphs. In this work,…
Grover search is a renowned quantum search algorithm that leverages quantum superposition to find a marked item with quadratic speedup. However, when implemented on Noisy Intermediate-scale Quantum (NISQ) hardware, the required repeated…
Continuous-time quantum walks provide a natural framework to tackle the fundamental problem of finding a node among a set of marked nodes in a graph, known as spatial search. Whether spatial search by continuous-time quantum walk provides a…
In this work we use the wave equation to obtain a classical analog of the quantum search algorithm and we verify that the essence of search algorithms resides in the establishment of resonances between the initial and the serched states. In…
The unconventional properties of graphene, with a massless Dirac band dispersion and large coherence properties, have raised a large interest for applications in nanoelectronics. In this work, we emphasize that graphene two dimensional…
The emergence of local moments in graphene zigzag edges, grain boundaries, vacancies and sp3 defects has been widely studied theoretically. However, conclusive experimental evidence is scarce. Recent progress in on-surface synthesis has…
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an…
We investigate the spatial search problem on the two-dimensional square lattice, using the Dirac evolution operator discretised according to the staggered lattice fermion formalism. $d=2$ is the critical dimension for the spatial search…
We propose a continuous time quantum search algorithm using a generalization of the Jaynes-Cummings model. In this model the states of the atom are the elements among which the algorithm realizes the search, exciting resonances between the…
As the characteristic lengths of advanced electronic devices are approaching the atomic scale, ab initio simulation method, with fully consideration of quantum mechanical effects, becomes essential to study the quantum transport phenomenon…
The unusual electronic properties of graphene, which are a direct consequence of its two-dimensional (2D) honeycomb lattice, have attracted a great deal of attention in recent years. Creation of artificial lattices that recreate graphene's…
We consider the problem of search of an unstructured list for a marked element, when one is given advice as to where this element might be located, in the form of a probability distribution. The goal is to minimise the expected number of…
Traditionally resonant interactions among short waves, with large real wave-numbers, were described statistically and only a small domain in spectral space with integer wave-numbers, discrete resonances, had to be studied separately in…
The geometry of optical lattices can be engineered allowing the study of atomic transport along paths arranged in patterns that are otherwise difficult to probe in the solid state. A question readily accessible to atomic systems is related…
Gadget3 is nowadays one of the most frequently used high performing parallel codes for cosmological hydrodynamical simulations. Recent analyses have shown t\ hat the Neighbour Search process of Gadget3 is one of the most time-consuming…
The recent experimental observations of designer Dirac Fermions and topological phases in molecular graphene are addressed theoretically. Using scattering theory we calculate the electronic structure of finite lattices of scattering centers…
A randomly walking quantum particle evolving by Schr\"odinger's equation searches on $d$-dimensional cubic lattices in $O(\sqrt{N})$ time when $d \ge 5$, and with progressively slower runtime as $d$ decreases. This suggests that graph…