Abstracts

A circuit-based quantum search algorithm driven by transverse fields

Presenting Author: Zhang Jiang, NASA Ames

We designed a quantum search algorithm, giving the same quadratic speedup achieved by Grover's original algorithm; we replace Grover's diffusion operator (hard to implement) with a product diffusion operator generated by transverse fields (easy to implement). In our algorithm, the problem Hamiltonian (oracle) and the transverse fields are applied to the system alternatively. We construct such a sequence that the corresponding unitary generates a closed transition between two states; one has a big overlap with the initial state (even superposition of all states), and the other has a big overlap with the target state. Let N = 2n be the size of the search space. The transition rate is of order O(N-1/2), yielding a O(N1/2) algorithm. Our algorithm belongs to a class of algorithms recently proposed by Farhi et al., namely the Quantum Approximate Optimization Algorithm (QAOA).

(Session 9c : Friday from 3:45pm - 4:15pm)

 

SQuInT Chief Organizer
Akimasa Miyake, Assistant Professor
amiyake@unm.edu

SQuInT Co-Organizer
Mark M. Wilde, Assistant Professor LSU
mwilde@phys.lsu.edu

SQuInT Administrator
Gloria Cordova
gjcordo1@unm.edu
505 277-1850

SQuInT Event Coordinator
Karen Jones, LSU
kjones@cct.lsu.edu

SQuInT Founder
Ivan Deutsch, Regents' Professor
ideutsch@unm.edu

Tweet About SQuInT 2017!