New summing algorithm using ensemble computing

DOI10.1088/0305-4470/35/42/102MaRDI QIDQ4450113zbMATH OpenOpenAlexFDO

Authors C. D'Helon, V. Protopopescu

Publication date 15 February 2004

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0202142

Mathematics Subject Classification ID

Quantum computation (81P68)

Abstract: 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.

Recommendations

• Quantum adder for superposition states
• Realization of Deutsch-like algorithm using ensemble computing
• Estimating the efficiency of ensemble quantum computing
• Quantum linear system algorithm applied to communication systems
• Comparing two quantum oracles using the Deutsch-Jozsa algorithm

Cited in

(2)

• Realization of Deutsch-like algorithm using ensemble computing
• GMG -- a guaranteed global optimization algorithm: application to remote sensing

This page was built for publication: New summing algorithm using ensemble computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450113)