Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1512.05588 · Journal of Physics B Atomic Molecular and Optical Physics

Grover search algorithm with Rydberg-blockaded atoms: quantum Monte Carlo simulations

David Petrosyan, Mark E. Saffman, Klaus Mølmer

Published Apr 14, 2016• 15 citations
arXivHTMLPDF

Abstract

Abstract We consider the Grover search algorithm implementation for a quantum register of size N = 2 k using k (or k + 1 ) microwave- and laser-driven Rydberg-blockaded atoms, following the proposal by Mølmer et al (2011 J. Phys. B 44 184016 ). We suggest some simplifications for the microwave and laser couplings, and analyze the performance of the algorithm for up to k = 4 multilevel atoms under realistic experimental conditions using quantum stochastic (Monte Carlo) wavefunction simulations.

DOI
10.1088/0953-4075/49/9/094004

Related papers

Efficient Grover search with Rydberg blockade

Klaus Mølmer, Larry Isenhower, Mark E. Saffman

We present efficient methods to implement the quantum computing Grover search algorithm using the Rydberg blockade interaction. We show that simple π-pulse excitation sequences between ground and Rydberg excited states readily produce the key conditional phase shift and inversion-about-the-mean unitary operations for the Grover search. Multi-qubit implementation schemes suitable for different properties of the atomic interactions are identified and the error scaling of the protocols with system size is found to be promising for experimental investigation.

arXiv:1102.3573•Journal of Physics B Atomic Molecular and Optical Physics•Sep 14, 2011•54 citations

Implementation of three-qubit Grover search in cavity quantum electrodynamics

Wan Li Yang, C. Y. Chen, Mang Feng

Using resonant interaction of three Rydberg atoms with a single-mode microwave cavity, we consider a realization of the three-qubit Grover search algorithm in the presence of weak cavity decay, based on a previous idea for a three-qubit quantum gate [Chen et al., Phys. Rev. A 73, 064304 (2006)]. We simulate the searching process under the influence of the cavity decay and show that our scheme could be achieved efficiently to find a marked state with high fidelity. The required operations are very close to the capabilities of current cavity QED techniques.

arXiv:0707.0334•Physical Review A•Nov 1, 2007•37 citations

Stark-tuned Förster resonance and dipole blockade for two to five cold Rydberg atoms: Monte Carlo simulations for various spatial configurations

I. I. Ryabtsev, Denis B. Tretyakov, Ilya I. Beterov +2 more

Results of numerical Monte Carlo simulations for the Stark-tuned $\mathrm{F}\stackrel{\mathrm{\ifmmode\cdot\else\textperiodcentered\fi{}\ifmmode\cdot\else\textperiodcentered\fi{}}}{\mathrm{o}}$rster resonance and dipole blockade between two to five cold rubidium Rydberg atoms in various spatial configurations are presented. The effects of the atoms' spatial uncertainties on the resonance amplitude and spectra are investigated. The feasibility of observing coherent Rabi-like population oscillations at a $\mathrm{F}\stackrel{\mathrm{\ifmmode\cdot\else\textperiodcentered\fi{}\ifmmode\cdot\else\textperiodcentered\fi{}}}{\mathrm{o}}$rster resonance between two cold Rydberg atoms is analyzed. Spectra and the fidelity of the Rydberg dipole blockade are calculated for various experimental conditions, including nonzero detuning from the $\mathrm{F}\stackrel{\mathrm{\ifmmode\cdot\else\textperiodcentered\fi{}\ifmmode\cdot\else\textperiodcentered\fi{}}}{\mathrm{o}}$rster resonance and finite laser linewidth. The results are discussed in the context of quantum-information processing with Rydberg atoms.

arXiv:1009.0095•Physical Review A•Nov 9, 2010•33 citations

Stochastic series expansion quantum Monte Carlo for Rydberg arrays

Ejaaz Merali, Isaac J. S. De Vlugt, Roger G. Melko

Arrays of Rydberg atoms are a powerful platform to realize strongly-interacting quantum many-body systems. A common Rydberg Hamiltonian is free of the sign problem, meaning that its equilibrium properties are amenable to efficient simulation by quantum Monte Carlo (QMC). In this paper, we develop a Stochastic Series Expansion QMC algorithm for Rydberg atoms interacting on arbitrary lattices. We describe a cluster update that allows for the efficient sampling and calculation of physical observables for typical experimental parameters, and show that the algorithm can reproduce experimental results on large Rydberg arrays in one and two dimensions.

arXiv:2107.00766•SciPost Physics Core•Apr 5, 2024•9 citations

Effect of qubit losses on Grover's quantum search algorithm

D. D. Bhaktavatsala Rao, Klaus Mølmer

We investigate the performance of Grover's quantum search algorithm on a register that is subject to a loss of particles that carry qubit information. Under the assumption that the basic steps of the algorithm are applied correctly on the correspondingly shrinking register, we show that the algorithm converges to mixed states with 50% overlap with the target state in the bit positions still present. As an alternative to error correction, we present a procedure that combines the outcome of different trials of the algorithm to determine the solution to the full search problem. The procedure may be relevant for experiments where the algorithm is adapted as the loss of particles is registered and for experiments with Rydberg blockade interactions among neutral atoms, where monitoring of atom losses is not even necessary.

arXiv:1209.0637•Physical Review A•Oct 18, 2012•11 citations

Quantum search simulation with Wolfram Mathematica

Alexander N. Prokopenya

We consider Grover's algorithm of quantum search for one or several integers out of N = 2n, where n is a number of quantum bits in the memory register. There is a black-box or subroutine containing information about hidden integers and it can easily recognize these integers but we do not know which ones out of N they are. To find the hidden items we can do no better with a classical computer than to apply the subroutine repeatedly to all possible integers until we hit on the special one and in the worst case we have to repeat this procedure N times. We have analyzed the Grover algorithm carefully and showed that it enables to speed up this search quadratically, although its realization requires to know a number of hidden items. The lower bound for the probability of successful solving the search problem has been obtained. The validity of the results was demonstrated by simulation of the Grover search algorithm using the package QuantumCircuit written in the Wolfram Mathematica language.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Sep 28, 2016•0 citations
Abstract We consider the Grover search algorithm implementation for a quantum register of size N = 2 k using k (or k + 1 ) microwave- and laser-driven Rydberg-blockaded atoms, following the proposal by Mølmer et al (2011 J. Phys. B 44 184016 ). We suggest some simplifications for the microwave and laser couplings, and analyze the performance of the algorithm for up to k = 4 multilevel atoms under realistic experimental conditions using quantum stochastic (Monte Carlo) wavefunction simulations.
We present efficient methods to implement the quantum computing Grover search algorithm using the Rydberg blockade interaction. We show that simple π-pulse excitation sequences between ground and Rydberg excited states readily produce the key conditional phase shift and inversion-about-the-mean unitary operations for the Grover search. Multi-qubit implementation schemes suitable for different properties of the atomic interactions are identified and the error scaling of the protocols with system size is found to be promising for experimental investigation.
Using resonant interaction of three Rydberg atoms with a single-mode microwave cavity, we consider a realization of the three-qubit Grover search algorithm in the presence of weak cavity decay, based on a previous idea for a three-qubit quantum gate [Chen et al., Phys. Rev. A 73, 064304 (2006)]. We simulate the searching process under the influence of the cavity decay and show that our scheme could be achieved efficiently to find a marked state with high fidelity. The required operations are very close to the capabilities of current cavity QED techniques.
Results of numerical Monte Carlo simulations for the Stark-tuned $\mathrm{F}\stackrel{\mathrm{\ifmmode\cdot\else\textperiodcentered\fi{}\ifmmode\cdot\else\textperiodcentered\fi{}}}{\mathrm{o}}$rster resonance and dipole blockade between two to five cold rubidium Rydberg atoms in various spatial configurations are presented. The effects of the atoms' spatial uncertainties on the resonance amplitude and spectra are investigated. The feasibility of observing coherent Rabi-like population oscillations at a $\mathrm{F}\stackrel{\mathrm{\ifmmode\cdot\else\textperiodcentered\fi{}\ifmmode\cdot\else\textperiodcentered\fi{}}}{\mathrm{o}}$rster resonance between two cold Rydberg atoms is analyzed. Spectra and the fidelity of the Rydberg dipole blockade are calculated for various experimental conditions, including nonzero detuning from the $\mathrm{F}\stackrel{\mathrm{\ifmmode\cdot\else\textperiodcentered\fi{}\ifmmode\cdot\else\textperiodcentered\fi{}}}{\mathrm{o}}$rster resonance and finite laser linewidth. The results are discussed in the context of quantum-information processing with Rydberg atoms.
Arrays of Rydberg atoms are a powerful platform to realize strongly-interacting quantum many-body systems. A common Rydberg Hamiltonian is free of the sign problem, meaning that its equilibrium properties are amenable to efficient simulation by quantum Monte Carlo (QMC). In this paper, we develop a Stochastic Series Expansion QMC algorithm for Rydberg atoms interacting on arbitrary lattices. We describe a cluster update that allows for the efficient sampling and calculation of physical observables for typical experimental parameters, and show that the algorithm can reproduce experimental results on large Rydberg arrays in one and two dimensions.
We investigate the performance of Grover's quantum search algorithm on a register that is subject to a loss of particles that carry qubit information. Under the assumption that the basic steps of the algorithm are applied correctly on the correspondingly shrinking register, we show that the algorithm converges to mixed states with 50% overlap with the target state in the bit positions still present. As an alternative to error correction, we present a procedure that combines the outcome of different trials of the algorithm to determine the solution to the full search problem. The procedure may be relevant for experiments where the algorithm is adapted as the loss of particles is registered and for experiments with Rydberg blockade interactions among neutral atoms, where monitoring of atom losses is not even necessary.
We consider Grover's algorithm of quantum search for one or several integers out of N = 2n, where n is a number of quantum bits in the memory register. There is a black-box or subroutine containing information about hidden integers and it can easily recognize these integers but we do not know which ones out of N they are. To find the hidden items we can do no better with a classical computer than to apply the subroutine repeatedly to all possible integers until we hit on the special one and in the worst case we have to repeat this procedure N times. We have analyzed the Grover algorithm carefully and showed that it enables to speed up this search quadratically, although its realization requires to know a number of hidden items. The lower bound for the probability of successful solving the search problem has been obtained. The validity of the results was demonstrated by simulation of the Grover search algorithm using the package QuantumCircuit written in the Wolfram Mathematica language.