Search Algorithms for Engineering Optimization 2013
DOI: 10.5772/53187
|View full text |Cite
|
Sign up to set email alerts
|

Geometry and Dynamics of a Quantum Search Algorithm for an Ordered Tuple of Multi-Qubits

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
5
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 27 publications
(59 reference statements)
0
5
0
Order By: Relevance
“…A geometric study analogous to [7] about the projection of the Grover-type search on the QSS was however deferred to [5] because of another new interest in the gradient system on the QSS associated with the negative von-Neumann entropy. It is shown in [3] that the gradient system of interest is understood to be a very natural extension of the gradient system associated with the negative Shannon entropy on a classical statistical manifold which is studied by Nakamura [9].…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…A geometric study analogous to [7] about the projection of the Grover-type search on the QSS was however deferred to [5] because of another new interest in the gradient system on the QSS associated with the negative von-Neumann entropy. It is shown in [3] that the gradient system of interest is understood to be a very natural extension of the gradient system associated with the negative Shannon entropy on a classical statistical manifold which is studied by Nakamura [9].…”
Section: Introductionmentioning
confidence: 99%
“…In order to describe the motive of this paper, a brief history of the series of the author's works [1,3,4,5] is given below. As a departure point of the series of the author's works, Grover's quantum search algorithm [6] is worth touched on, which is well-known to be one of the milestones on the road of quantum computation [2]: For a large number, say N = 2 n , of randomly sorted data, the complexity of Grover's algorithm is of O( √ N ), which is lower than the theoretical boundary, O(N ), of any non-quantum searches.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations