New summing algorithm using ensemble computing

Details New summing algorithm using ensemble computing New summing algorithm using ensemble computing

2002-02-25

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

Journal of Physics A, 35(42), L597, 2002

Physics

Quantum Physics

13 pages, 0 figures, VIth International Conference on Quantum Communication, Measurement and Computing (Boston, 2002)

Scientific paper

10.1088/0305-4470/35/42/102

We propose an ensemble algorithm, which provides a new approach for evaluating and summing up a set of function samples. The proposed algorithm is not a quantum algorithm, insofar it does not involve quantum entanglement. The query complexity of the algorithm depends only on the scaling of the measurement sensitivity with the number of distinct spin sub-ensembles. From a practical point of view, the proposed algorithm may result in an exponential speedup, compared to known quantum and classical summing algorithms. However in general, this advantage exists only if the total number of function samples is below a threshold value which depends on the measurement sensitivity.

Affiliated with

Also associated with

No associations

Rating

New summing algorithm using ensemble computing 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 New summing algorithm using ensemble computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New summing algorithm using ensemble computing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-359004