Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/8DE9069C-E11B-475F-A55B-B14051656B70 | ||
| Year | 2022 | ||
| Type of Item | Peer-Reviewed Journal Publication | ||
| License |
|
||
| Bibliographic Citation | D. Ellinas, and C. Konstandakis, “Entanglement in quantum search database: periodicity variations and counting,” Quantum Rep., vol. 4, no. 3, pp. 221-237, July 2022, doi: 10.3390/quantum4030015. https://doi.org/10.3390/quantum4030015 | ||
| Appears in Collections |
Employing the single item search algorithm of N dimensional database it is shown that: First, the entanglement developed between two any-size parts of database space varies periodically during the course of searching. The periodic entanglement of the associated reduced density matrix quantified by several entanglement measures (linear entropy, von Neumann, Renyi), is found to vanish with period 𝒪(𝑠𝑞𝑟𝑡(𝑁)). Second, functions of equal entanglement are shown to vary also with equal period. Both those phenomena, based on size-independent database bi-partition, manifest a general scale invariant property of entanglement in quantum search. Third, measuring the entanglement periodicity via the number of searching steps between successive canceling out, determines N, the database set cardinality, quadratically faster than ordinary counting. An operational setting that includes an Entropy observable and its quantum circuits realization is also provided for implementing fast counting. Rigging the marked item initial probability, either by initial advice or by guessing, improves hyper-quadratically the performance of those phenomena.
Copyright © DIAS 2013
