Abstracts
Poster Abstracts | Talk Abstracts
Speeding up number partitioning with Grover's algorithm
Presenting Author: Galit Anikeeva, Stanford University
Contributing Author(s): Emily Davis, Tori Borish, Ognjen Marković, Monika Scheier-Smith
A number of conceptually important quantum algorithms rely on the use of a black-box device known as an oracle, which is typically difficult to construct without knowing the answer to the problem that the quantum computer is intended to solve. A notable example is Grover's algorithm, which theoretically can offer a quadratic speed-up in search problems. Here we show how Grover's algorithm can be applied to a class of NP-complete decision problems---the subset sum problem and, as a special case, the number partitioning problem---in realistic experiments. Each instance of the problem is encoded in the strengths of couplings of a set of qubits to a central spin or boson, which mediates a collective phase gate constituting the quantum oracle. We propose and analyze implementations in cavity-QED and Rydberg-atom systems.
- Home
- Registration
- SQuInT
- Program
- Lodging and Transportation
- Conference Center Map (.pdf)
- Instructions for Presenters
- Bulletin Board
- Past SQuInT Meetings
SQuInT Chief Organizer
Akimasa Miyake, Associate Professor
amiyake@unm.edu
SQuInT Co-Organizer
Brian Smith, Associate Professor UO
bjsmith@uoregon.edu
SQuInT Program Committee
Postdoctoral Fellows:
Markus Allgaier (UO OMQ)
Sayonee Ray (UNM CQuIC)
Pablo Poggi (UNM CQuIC)
Valerian Thiel (UO OMQ)
SQuInT Event Co-Organizers (Oregon)
Jorjie Arden
jarden@uoregon.edu
Holly Lynn
hollylyn@uoregon.edu
Brandy Todd
SQuInT Administrator (CQuIC)
Gloria Cordova
gjcordo1@unm.edu
505 277-1850
SQuInT Founder
Ivan Deutsch, Regents' Professor, CQuIC Director
ideutsch@unm.edu