Faster Together: Collective Quantum Search
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 (mergin...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2015-07-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | http://www.mdpi.com/1099-4300/17/7/4838 |
| _version_ | 1811185237063892992 |
|---|---|
| author | Demosthenes Ellinas Christos Konstandakis |
| author_facet | Demosthenes Ellinas Christos Konstandakis |
| author_sort | Demosthenes Ellinas |
| collection | DOAJ |
| description | 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). |
| first_indexed | 2024-04-11T13:27:06Z |
| format | Article |
| id | doaj.art-c0230b1cfb1c4cd49dc5ac9aced55725 |
| institution | Directory Open Access Journal |
| issn | 1099-4300 |
| language | English |
| last_indexed | 2024-04-11T13:27:06Z |
| publishDate | 2015-07-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Entropy |
| spelling | doaj.art-c0230b1cfb1c4cd49dc5ac9aced557252022-12-22T04:22:03ZengMDPI AGEntropy1099-43002015-07-011774838486210.3390/e17074838e17074838Faster Together: Collective Quantum SearchDemosthenes Ellinas0Christos Konstandakis1Department of Electronic & Computer Engineering, QLab, Technical University of Crete, GR 731 00 Chania Crete, GreeceDepartment of Electronic & Computer Engineering, QLab, Technical University of Crete, GR 731 00 Chania Crete, GreeceJoining 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).http://www.mdpi.com/1099-4300/17/7/4838quantum search algorithmsearch complexityYoung diagramcompletely positive trace preserving mapsquantum channels. |
| spellingShingle | Demosthenes Ellinas Christos Konstandakis Faster Together: Collective Quantum Search Entropy quantum search algorithm search complexity Young diagram completely positive trace preserving maps quantum channels. |
| title | Faster Together: Collective Quantum Search |
| title_full | Faster Together: Collective Quantum Search |
| title_fullStr | Faster Together: Collective Quantum Search |
| title_full_unstemmed | Faster Together: Collective Quantum Search |
| title_short | Faster Together: Collective Quantum Search |
| title_sort | faster together collective quantum search |
| topic | quantum search algorithm search complexity Young diagram completely positive trace preserving maps quantum channels. |
| url | http://www.mdpi.com/1099-4300/17/7/4838 |
| work_keys_str_mv | AT demosthenesellinas fastertogethercollectivequantumsearch AT christoskonstandakis fastertogethercollectivequantumsearch |