Faster Together: Collective Quantum Search

Demosthenes Ellinas, Christos Konstandakis · Entropy · 2015

Joining independent quantum searches provides novel collective modes of quantum search (merging) by utilizing the algorithm’s underlying algebraic structure. If n quantum searches, each targeting a single item, join the domains of their classical oracle functions and sum their Hilbert spaces (merging), instead of acting independently (concatenation), then they achieve a reduction of the search complexity by factor O(√n).

Read the paper · More papers on PaperTik