Phys. Rev. Lett. 87, 257901 (2001) [4 pages]Portfolios of Quantum Algorithms
See accompanying Physics Focus 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. © 2001 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevLett.87.257901
DOI:
10.1103/PhysRevLett.87.257901
PACS:
03.67.Lx, 02.70.Rr, 89.65.Gh
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.