Scalable quantum search using trapped ions

TL;DR

This paper presents a scalable method for implementing Grover's quantum search algorithm using trapped ions, leveraging physical symmetries to simplify operations and improve fidelity.

Contribution

The authors introduce a simplified, scalable implementation of quantum search in trapped ions using off-resonant laser pulses and symmetry exploitation, reducing complexity and increasing fidelity.

Findings

Implementation requires only two physical steps per logical iteration.

The approach simplifies previous methods by avoiding concatenated gates.

Enhanced fidelity due to reduced operational complexity.

Abstract

We propose a scalable implementation of Grover's quantum search algorithm in a trapped-ion quantum information processor. The system is initialized in an entangled Dicke state by using simple adiabatic techniques. The inversion-about-average and the oracle operators take the form of single off-resonant laser pulses, addressing, respectively, all and half of the ions in the trap. This is made possible by utilizing the physical symmetrie of the trapped-ion linear crystal. The physical realization of the algorithm represents a dramatic simplification: each logical iteration (oracle and inversion about average) requires only two physical interaction steps, in contrast to the large number of concatenated gates required by previous approaches. This does not only facilitate the implementation, but also increases the overall fidelity of the algorithm.