title: Portfolios of quantum algorithms.
abstract: Quantum computation holds promise for the solution of many intractable problems. However, since many quantum algorithms are stochastic in nature they can find the solution of hard problems only probabilistically. Thus the efficiency of the algorithms has to be characterized by both the expected time to completion and the associated variance. In order to minimize both the running time and its uncertainty, we show that portfolios of quantum algorithms analogous to those of finance can outperform single algorithms when applied to the NP-complete problems such as 3-satisfiability.
authors.affiliation: Physics Department, Stanford University, Stanford, California 94043, USA.
authors.forename: S M
authors.initials: SM
authors.lastname: Maurer
authors.forename: T
authors.initials: T
authors.lastname: Hogg
authors.forename: B A
authors.initials: BA
authors.lastname: Huberman