Related papers: Efficient Grover search with Rydberg blockade
Rydberg atom arrays offer flexible geometries of strongly-interacting neutral atoms, which are useful for many quantum applications such as quantum simulation and quantum computation. Here we consider a gate-based quantum computing scheme…
Hosting giant Rydberg excitons with principal quantum numbers up to n = 30, cuprous oxide (Cu2O) provides a rare solid-state setting for exploring Rydberg physics, as exemplified by the blockade effect. Here we access the strongly…
We review Grover's algorithm by means of a detailed geometrical interpretation and a worked out example. Some basic concepts of Quantum Mechanics and quantum circuits are also reviewed. This work is intended for non-specialists which have…
Grover's algorithm is a cornerstone of quantum search algorithm, offering quadratic speedup for unstructured problems. However, limited qubit counts and noise in today's noisy intermediate-scale quantum (NISQ) devices hinder large-scale…
The Rydberg excitation blockade has been at the heart of an impressive array of recent achievements; however, state-mixing interactions can compromise its efficiency. When ultracold atoms are excited to Rydberg states near F\"orster…
Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum…
Arrays of optically trapped atoms excited to Rydberg states have recently emerged as a competitive physical platform for quantum simulation and computing, where high-fidelity state preparation and readout, quantum logic gates and controlled…
With a resonant amplitude-modulation field on two Rydberg atoms, we propose a Rydberg antiblockade (RAB) regime, where the Rabi oscillation between collective ground and excited states is induced. A controlled-Z gate can be yielded through…
Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover's search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high…
Grover's algorithm is a fundamental quantum algorithm that offers a quadratic speedup for the unstructured search problem by alternately applying physically implementable oracle and diffusion operators. In this paper, we reformulate the…
The resonant dipole-dipole interaction between highly excited Rydberg levels dominates the interaction of neutral atoms at short distances scaling as $1/r^3$. Here we take advantage of the combined effects of strong dipole-dipole…
Rydberg atoms provide a highly promising platform for quantum computation, leveraging their strong tunable interactions to encode and manipulate information in the electronic states of individual atoms. Key advantages of Rydberg atoms…
Given a parameterized quantum circuit such that a certain setting of these real-valued parameters corresponds to Grover's celebrated search algorithm, can a variational algorithm recover these settings and hence learn Grover's algorithm? We…
In order to understand the bounds of utilization of the Grover's search algorithm for the large unstructured data in presence of the quantum computer noise, we undertake a series of simulations by inflicting various types of noise, modelled…
We calculate the amount of entanglement of the multiqubit quantum states employed in the Grover algorithm, by following its dynamics at each step of the computation. We show that genuine multipartite entanglement is always present.…
We propose a novel scheme for high fidelity photonic controlled phase gates using Rydberg blockade in an ensemble of atoms in an optical cavity. The gate operation is obtained by first storing a photonic pulse in the ensemble and then…
We propose an ion trap implementation of Grover's quantum search algorithm for an unstructured database of arbitrary length N. The experimental implementation is appealingly simple because the linear ion trap allows for a straightforward…
High-fidelity entangling quantum gates based on Rydberg interactions are required for scalable quantum computing with neutral atoms. Their realization, however, meets a major stumbling block -- the motion-induced dephasing of the transition…
In this brief comment on `Grover search with pairs of trapped Ions' [Phys. Rev. A 63, 052308, (2001)], we show that Grover's algorithm may be performed exactly using the gate set given provided that small changes are made to the gate…
Grover search is a well-known quantum algorithm that outperforms any classical search algorithm. It is known that quantum correlations such as entanglement are necessary for the power of quantum computation. But entanglement is not the only…