RSS icon
Twitter icon
Facebook icon
Vimeo icon
YouTube icon

Complete 3-Qubit Grover search on a programmable quantum computer

TitleComplete 3-Qubit Grover search on a programmable quantum computer
Publication TypeJournal Article
Year of Publication2017
AuthorsC.. Figgatt, D.. Maslov, K.. A. Landsman, N.. M. Linke, S.. Debnath, and C.. Monroe
Date PublishedDEC 4
Type of ArticleArticle

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.}, %%Address = {MACMILLAN BUILDING, 4 CRINAN ST, LONDON N1 9XW, ENGLAND