Complete 3-Qubit Grover Search on a Programmable Quantum Computer
Journal Article - Open Access
University of Maryland, Joint Quantum Inst, Dept of Physics, Joint Center for Quantum Info and CompSci College Park United States
Pagination or Media Count:
The Grover quantum search algorithm is a hallmark application of a quantum computer with a well-known speedup over classical searches of an unsorted database. Here, we report results for a complete three-qubit Grover search algorithm using the scalable quantum computing technology of trapped atomic ions, with better-than-classical performance. Two methods of state marking are used for the oracles a phase-flip method employed by other experimental demonstrations, and a Boolean method requiring an ancilla qubit that is directly equivalent to the state marking scheme required to perform a classical search. We also report the deterministic implementation of a Toffoli-4 gate, which is used along with Toffoli-3 gates to construct the algorithms these gates have process fidelities of 70.5 and 89.6 , respectively.
- Quantum Theory and Relativity