Faster Together: Collective Quantum Search

Ellinas, Demosthenes; Konstandakis, Christos

doi:10.3390/e17074838

Cited by 3 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several questions can be put forward for future investigations: is the studied phenomenon of the entanglement periodicity robust under e.g., tri-partition or even successive partitions of database total state vector space; how is the periodic oscillation of entanglement could be re-configured in the case of collective quantum search [16], where multiple searchers are combining their algorithms by merging and/or concatenating their oracle algebra representations to achieve additional search complexity reductions? Can the accelerated period of entanglement is valid for other measures of correlation like the ones mentioned previously?…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Entanglement in Quantum Search Database: Periodicity Variations and Counting

Ellinas

Konstandakis

2022

Quantum Reports

Self Cite

View full text Add to dashboard Cite

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 O(sqrt(N)). 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.

show abstract

Section: Discussionmentioning

confidence: 99%

“…], N = 2 n } → {0, 1}, c.f. [14][15][16][17]. The work proceeds by treating a set S of cardinality N as a search-able database with no additional structure.…”

Section: Introductionmentioning

confidence: 99%

Entanglement in Quantum Search Database: Periodicity Variations and Counting

Ellinas

Konstandakis

2022

Quantum Reports

Self Cite

View full text Add to dashboard Cite

show abstract

“…Gauging oscillations, corresponding to the above string, are with a period T r . This period is de¯ned from (5,4,1)-shape complexity 26 of the gauging,…”

Section: Gaugingmentioning

confidence: 99%

A Biologically-Inspired Smart Grid Replication

Stefanov¹,

Wang

2017

New Math. and Nat. Computation

View full text Add to dashboard Cite

The characteristics of the replication is investigated in this paper. By invoking the Potts model versus holographic superconductors for \gauge" versus \string", the pair forms as a duality in natural manner. It can be shown that resulted characteristics of replication hence deserves to be called as an Autopoietic Smart Grid. Furthermore, we are able to trace the factors contributed to these characteristics; the autopoiesis is contributed via gauge self-energy; the surveillance is due to Maxwell's demon; the organizational adaptivity is due to the communication capacity of the string and the oscillations of the gauge. Finally, it can also be shown that such a Smart Grid replication exists as long as the string is stable and gauge is synchronized.

show abstract

“…The contribution by Ellinas and Konstandakis [11] demonstrates how the Grover search algorithm is extended to be a collective search algorithm among many agents. For n collaborative agents, the search complexity is proved to be reduced by order O( √ n).…”

mentioning

confidence: 99%

Quantum Computation and Information: Multi-Particle Aspects

Ellinas

Kaniadakis

Pachos

et al. 2016

Entropy

Self Cite

View full text Add to dashboard Cite

This editorial explains the scope of the special issue and provides a thematic introduction to the contributed papers.Keywords: quantum computation; quantum information; multi-particle models; quantum walks; topological quantum computing; multi-particle entanglement; quantum potential; quantum statistical mechanicsThe scope of this special issue is to emphasize an aspect of the broad research area of Quantum Computation and Information which involves multi-particle models, and their associated concepts and mathematical or computational techniques. Such multi-particle models constitute a common feature of almost all genders of quantum computation and quantum information processing. The articles presented in the issue, sixteen in number, can be thematically categorized into seven titles which span an extended part of the multi-particle research discipline and are the following, with the number of papers in each given in parenthesis: remote actions on states and operators (3), quantum games (2), topological quantum computation (2), dissipative quantum systems (2), entropy (1), quantum algorithms (1), multi-particle quantum entanglement (5).The first thematic title concerns the implementation of various remote actions on states and operators [1][2][3]. These actions are mediated by the help of shared quantum entanglement among agents within the framework of communication protocols such as LOCC. Special emphasis is put on the minimization of classical and quantum resources as well as on the security and feasibility of the algorithms. The first contribution in this topic is by Xie Chuanmei, Liu Yimin, Xing Hang, and Zhang Zhanjun [1], who suggest an algorithm for a probabilistic three-party sharing of an operation on a remote qubit states. The second paper is by Wang Dong, Hoehn Ross D., Ye Liu, and Kais Sabre [2], who investigate an algorithm for the generalized remote preparation of arbitrary m-qubit entangled states via genuine entanglement. Finally, Li Jian, Pan Zeshi, Sun Fengqi, Chen Yanhua, Wang Zheng, and Shi Zuozhi [3] present a paper that analyzes a cryptographic algorithm for quantum secure direct communication based on dense coding and detecting eavesdropping with four-particle genuine entangled states.Next we have two contributions from the area of quantum games [4,5]. First, the paper by Makowski Marcin, Piotrowski Edward W., and Sładkowski Jan [4], which addresses the question of transitive/intransitive preferences in the classical context of rational choice theory, as well as in a quantum game theoretic context, and in which evidence is provided for the rationality of intransitive strategies in a one-qubit strategy game. Next, the paper by Dajka Jerzy, Łobejko Marcin,

show abstract

Faster Together: Collective Quantum Search

Cited by 3 publications

References 18 publications

Entanglement in Quantum Search Database: Periodicity Variations and Counting

Entanglement in Quantum Search Database: Periodicity Variations and Counting

A Biologically-Inspired Smart Grid Replication

Quantum Computation and Information: Multi-Particle Aspects

Contact Info

Product

Resources

About