Session D29: Quantum Computing and Simulation I
2:30 PM–5:30 PM, Monday, March 21, 2011
Room: C148
Sponsoring Unit:
GQI
Chair: Ivan Deutsch, University of New Mexico
Abstract ID: BAPS.2011.MAR.D29.6
Abstract: D29.00006 : Optimal Trajectories for Quantum Adiabatic Factoring
3:30 PM–3:42 PM
Preview Abstract
MathJax On | Off 
Abstract 
Authors:
Jordan Kyriakidis
Robert Archibald
(Dalhousie Univeristy)
William Macready
(D-Wave Systems, Inc.)
We show how a classical multiplication circuit can be expressed as an optimization problem. The circuit can then be effectively run backwards by fixing the output states in the optimization problem and determining the corresponding input states, thereby factoring the output state. This can in turn be expressed as a problem in adiabatic quantum computing. We show by solving a coupled set of Euler-Lagrange equations how (locally) optimal trajectories from initial to final Hamiltonians can be found whose efficacy vastly exceeds that of the usual linear scaling trajectory. Explicit examples will be given for factoring 6-bit integers.
To cite this abstract, use the following reference: http://meetings.aps.org/link/BAPS.2011.MAR.D29.6