pith. sign in

In the case of 2, which is the best case, such t is ob- tained by finding maximum algorithm [26]

t is selected so as to maximize g(t)

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

1 Pith paper citing it
browse 1 citing papers

fields

quant-ph 1

years

2019 1

verdicts

UNVERDICTED 1

representative citing papers

A Quantum Algorithm for Finding $k$-Minima

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • A Quantum Algorithm for Finding $k$-Minima quant-ph · 2019-07-07 · unverdicted · none · ref 10

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