Related papers: Microwave Experiments Simulating Quantum Search an…
Graphene is a unique two-dimensional material with rich new physics and great promise for applications in electronic devices. Physical phenomena such as the half-integer quantum Hall effect and high carrier mobility are critically dependent…
Continuous-time quantum walks are natural tools for spatial search, where one searches for a marked vertex in a graph. Sometimes, the structure of the graph causes the walker to get trapped, such that the probability of finding the marked…
We prepare arbitrary patterns of neutral atoms in a one-dimensional (1D) optical lattice with single-site precision using microwave radiation in a magnetic field gradient. We give a detailed account of the current limitations and propose…
Continuous-time quantum walks provide an alternative method for quantum search problems. Most of the earlier studies confirmed that quadratic speedup exists in some synthetic Hamiltonians, but whether there is quadratic speedup in real…
We propose the physical implementation of a Grover-like search problem by means of Frenkel exciton trapping at a shallow isotopic impurity against a background of competing mechanisms. The search culminating at the impurity molecule,…
Fully coherent searches (over realistic ranges of parameter space and year-long observation times) for unknown sources of continuous gravitational waves are computationally prohibitive. Less expensive hierarchical searches divide the data…
We propose a quantum algorithm for closest pattern matching which allows us to search for as many distinct patterns as we wish in a given string (database), requiring a query function per symbol of the pattern alphabet. This represents a…
The electronic states of an electrostatically confined cylindrical graphene quantum dot and the electric transport through this device are studied theoretically within the continuum Dirac-equation approximation and compared with numerical…
This paper presented two general quantum search algorithms. We derived the iterated formulas and the simpler approximate formulas and the precise formula for the amplitude in the desired state. A mathematical proof of Grover's algorithm…
After the discovery of graphene and its many fascinating properties, there has been a growing interest for the study of "artificial graphenes". These are totally different and novel systems which bear exciting similarities with graphene.…
Gravitational wave searches rely on a combination of methods, including matched filtering, coherent analyses, and more recent machine learning based pipelines. For compact binary coalescences, where signals originate from the relativistic…
Search-based methods that use motion primitives can incorporate the system's dynamics into the planning and thus generate dynamically feasible MAV trajectories that are globally optimal. However, searching high-dimensional state lattices is…
Search-base algorithms have widespread applications in different scenarios. Grover's quantum search algorithms and its generalization, amplitude amplification, provide a quadratic speedup over classical search algorithms for unstructured…
Grover's algorithm accelerates unstructured database search quadratically compared to classical algorithms. In the NISQ era, distributed quantum computing can decrease circuit depth and reduce noise. In this paper, an algorithm for…
A scalable tight-binding model is applied for large-scale quantum transport calculations in clean graphene subject to electrostatic superlattice potentials, including two types of graphene superlattices: moir\'e patterns due to the stacking…
A discrete-time Quantum Walk (QW) is essentially an operator driving the evolution of a single particle on the lattice, through local unitaries. Some QWs admit a continuum limit, leading to well-known physics partial differential equations,…
Particle transport and localization phenomena in condensed-matter systems can be modeled using a tight-binding lattice Hamiltonian. The ideal experimental emulation of such a model utilizes simultaneous, high-fidelity control and readout of…
In the emerging domain of quantum algorithms, the Grover's quantum search is certainly one of the most significant. It is relatively simple, performs a useful task and more importantly, does it in an optimal way. However, due to the success…
Spatial search on graphs is one of the most important algorithmic applications of quantum walks. To show that a quantum-walk-based search is more efficient than a random-walk-based search is a difficult problem, which has been addressed in…
Quantum walk followed by some amplitude amplification technique has been successfully used to search for marked vertices on various graphs. Lackadaisical quantum walk can search for target vertices on graphs without the help of any…