Appendix A: Complexity of Searching All Marked k-Indices Algorithm The problem to search all marked k-indices from D and its query complexity are brieﬂy discussed in [7– 11]

Though this process is not described in [2], we add this because we think it is required for conversion

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

quant-ph · 2019-07-07 · unverdicted · novelty 4.0

Quantum algorithm for k-minima with O(sqrt(k N)) query complexity via threshold search and generalized amplitude amplification.

Showing 1 of 1 citing paper.

A Quantum Algorithm for Finding $k$-Minima quant-ph · 2019-07-07 · unverdicted · none · ref 44
Quantum algorithm for k-minima with O(sqrt(k N)) query complexity via threshold search and generalized amplitude amplification.