Quantum Portfolios

Details Quantum Portfolios Quantum Portfolios

2001-05-15

arxiv.org/abs/quant-ph/0105071v2

Physical Review Letters 87, 257901 (2001)

Physics

Quantum Physics

revision includes additional data and corrects minor typos

Scientific paper

10.1103/PhysRevLett.87.257901

Quantum computation holds promise for the solution of many intractable problems. However, since many quantum algorithms are stochastic in nature they can only find the solution of hard problems probabilistically. Thus the efficiency of the algorithms has to be characterized both by the expected time to completion {\it 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-SAT.

Affiliated with

Also associated with

No associations

Rating

Quantum Portfolios does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Portfolios, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Portfolios will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-61833