Complete 3-Qubit Grover Search on a Programmable Quantum Computer

Abstract

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 04, 2017
Accession Number
AD1090296

Entities

People

  • C. Figgatt
  • Christopher Monroe
  • D. Maslov
  • K. A. Landsman
  • N. M. Linke
  • S. Debnath

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Air Platforms
  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Computer Science
  • Computers
  • Databases
  • Frequency Combs
  • Ion Traps
  • Lasers
  • Materials
  • Measurement
  • Quantum Algorithms
  • Quantum Bits
  • Quantum Circuits
  • Quantum Computers
  • Quantum Computing
  • Quantum Information
  • Quantum Information Science
  • Reliability

Fields of Study

  • Physics

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computer Engineering
  • Molecular Photonics/Laser Physics

Technology Areas

  • Quantum Computing