{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:25:02Z","timestamp":1760243102994,"version":"build-2065373602"},"reference-count":17,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2015,7,10]],"date-time":"2015-07-10T00:00:00Z","timestamp":1436486400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Joining independent quantum searches provides novel collective modes of quantum search (merging) by utilizing the algorithm\u2019s 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(\u221an).<\/jats:p>","DOI":"10.3390\/e17074838","type":"journal-article","created":{"date-parts":[[2015,7,13]],"date-time":"2015-07-13T03:49:22Z","timestamp":1436759362000},"page":"4838-4862","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Faster Together: Collective Quantum Search"],"prefix":"10.3390","volume":"17","author":[{"given":"Demosthenes","family":"Ellinas","sequence":"first","affiliation":[{"name":"Department of Electronic & Computer Engineering, QLab, Technical University of Crete, GR 731 00 Chania Crete, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Konstandakis","sequence":"additional","affiliation":[{"name":"Department of Electronic & Computer Engineering, QLab, Technical University of Crete, GR 731 00 Chania Crete, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2015,7,10]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","article-title":"Quantum Mechanics Helps in Searching for Needle in a Haystack","volume":"79","author":"Grover","year":"1997","journal-title":"Phys. Rev. Lett."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"4329","DOI":"10.1103\/PhysRevLett.80.4329","article-title":"Quantum Computers Can Search Rapidly by Using Almost any Transformation","volume":"80","author":"Grover","year":"1998","journal-title":"Phys. Rev. Lett."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1126\/science.275.5300.627","article-title":"Searching a Quantum Phone Book","volume":"275","author":"Brassard","year":"1997","journal-title":"Science"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"022331","DOI":"10.1103\/PhysRevA.87.022331","article-title":"Scale Invariance of Entanglement Dynamics in Grover\u2019s Quantum Search Algorithm","volume":"87","author":"Rossi","year":"2013","journal-title":"Phys. Rev. A"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Reitzner, D., and Ziman, M. (2014). Two Notes on Grover\u2019s Search: Programming and Discriminating, arXiv, 1406.6391.","DOI":"10.1140\/epjp\/i2014-14128-9"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"073033","DOI":"10.1088\/1367-2630\/16\/7\/073033","article-title":"Fault-Ignorant Quantum Search","volume":"16","author":"Vrana","year":"2014","journal-title":"New J. Phys."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"210501","DOI":"10.1103\/PhysRevLett.113.210501","article-title":"Fixed-Point Quantum Search with an Optimal Number of Queries","volume":"113","author":"Yoder","year":"2014","journal-title":"Phys. Rev. Lett."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Portugal, R. (2013). Quantum Walks and Search Algorithms, Springer.","DOI":"10.1007\/978-1-4614-6336-8"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"415303","DOI":"10.1088\/1751-8113\/46\/41\/415303","article-title":"Parametric Quantum Search Algorithm by CP Maps: Algebraic, Geometric and Complexity Aspects","volume":"46","author":"Ellinas","year":"2013","journal-title":"J. Phys. A"},{"key":"ref_10","unstructured":"Marshall, A.W., and Olkin, I. (1975). Inequalities: Theory of Majorization and Its Applications, Academic Press."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Macdonald, I.G. (1995). Symmetric functions and Hall polynomials, Oxford University Press. [2nd ed].","DOI":"10.1093\/oso\/9780198534891.001.0001"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/1008328.1008329","article-title":"Big Omicron and Big Omega and Big Theta","volume":"8","author":"Knuth","year":"1976","journal-title":"ACM Sigact News"},{"key":"ref_13","first-page":"2","article-title":"The Lattice of Threshold Graphs","volume":"6","author":"Merris","year":"2005","journal-title":"J. Inequal. Pure Appl. Math."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1080\/00029890.1993.11990484","article-title":"A Visual Explanation of Jensen\u2019s Inequality","volume":"100","author":"Needham","year":"1993","journal-title":"Am. Math. Mon."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Ellinas, D., and Konstandakis, C. (2010, January 19\u201323). Matrix Algebra for Quantum Search Algorithm: Non Unitary Symmetries and Entanglement, Queensland, Australia.","DOI":"10.1063\/1.3630150"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-031-01558-8","article-title":"Computational Aspects of Cooperative Game Theory","volume":"5","author":"Chalkiadakis","year":"2011","journal-title":"Synth. Lectures Artif. Intell. Mach. Learn."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Ellinas, D., and Konstandakis, C. (Parametric Quantum Search Algorithm as Quantum Walk: A Quantum Simulation, 2015). Parametric Quantum Search Algorithm as Quantum Walk: A Quantum Simulation, submitted.","DOI":"10.1016\/S0034-4877(16)30008-8"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/17\/7\/4838\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T20:49:02Z","timestamp":1760215742000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/17\/7\/4838"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,10]]},"references-count":17,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2015,7]]}},"alternative-id":["e17074838"],"URL":"https:\/\/doi.org\/10.3390\/e17074838","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2015,7,10]]}}}