6 citations · 8 across the 4 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2019★ 6 cited
A Quantum Algorithm for Finding -Minima
Kohei Miyamoto, Masakazu Iwamura, Koichi Kise
We propose a new finding -minima algorithm and prove that its query complexity is , where is the number of data indices. Though the complexity is equ…
quant-ph2019
Quantum Speedup for the Minimum Steiner Tree Problem
Masayuki Miyamoto, Masakazu Iwamura, Koichi Kise +1
A recent breakthrough by Ambainis, Balodis, Iraids, Kokainis, Prūsis and Vihrovs (SODA'19) showed how to construct faster quantum algorithms for the Traveling Salesman Problem and…