TY - JOUR
T1 - New summing algorithm using ensemble computing
AU - D'Helon, C.
AU - Protopopescu, V.
PY - 2002/10/25
Y1 - 2002/10/25
N2 - 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 as 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 subensembles. 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.
AB - 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 as 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 subensembles. 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.
UR - http://www.scopus.com/inward/record.url?scp=0037174942&partnerID=8YFLogxK
U2 - 10.1088/0305-4470/35/42/102
DO - 10.1088/0305-4470/35/42/102
M3 - Article
AN - SCOPUS:0037174942
SN - 0305-4470
VL - 35
SP - L597-L604
JO - Journal of Physics A: Mathematical and General
JF - Journal of Physics A: Mathematical and General
IS - 42
ER -