Next Article in Journal
Entropy, Information and Complexity or Which Aims the Arrow of Time?
Next Article in Special Issue
The Critical Point Entanglement and Chaos in the Dicke Model
Previous Article in Journal
Power-Type Functions of Prediction Error of Sea Level Time Series
Previous Article in Special Issue
Non-Abelian Topological Approach to Non-Locality of a Hypergraph State
Article Menu

Export Article

Open AccessArticle
Entropy 2015, 17(7), 4838-4862; doi:10.3390/e17074838

Faster Together: Collective Quantum Search

Department of Electronic & Computer Engineering, QLab, Technical University of Crete, GR 731 00 Chania Crete, Greece
*
Author to whom correspondence should be addressed.
Academic Editor: Kevin H. Knuth
Received: 8 May 2015 / Revised: 9 May 2015 / Accepted: 30 June 2015 / Published: 10 July 2015
(This article belongs to the Special Issue Quantum Computation and Information: Multi-Particle Aspects)
View Full-Text   |   Download PDF [268 KB, uploaded 10 July 2015]   |  

Abstract

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). View Full-Text
Keywords: quantum search algorithm; search complexity; Young diagram; completely positive trace preserving maps; quantum channels. quantum search algorithm; search complexity; Young diagram; completely positive trace preserving maps; quantum channels.
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Ellinas, D.; Konstandakis, C. Faster Together: Collective Quantum Search. Entropy 2015, 17, 4838-4862.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top