69 citations · 261 across the 33 of their papers we have counts for
Showing 2007Show all
3 papers · 1 filter
quant-ph2007★ 2 cited
Exact Quantum Algorithms for the Leader Election Problem
Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto
This paper gives the first separation of quantum and classical pure (i.e., non-cryptographic) computing abilities with no restriction on the amount of available computing resources…
quant-ph2007★ 5 cited
Experimental demonstration of quantum leader election in linear optics
Yuta Okubo, Xiang-Bin Wang, Yun-Kun Jiang +2
Linear optics is a promising candidate to enable the construction of quantum computers. A number of quantum protocols gates based on linear optics have been demonstrated. However,…
quant-ph2007★ 69 cited
Claw Finding Algorithms Using Quantum Walk
Seiichiro Tani
The claw finding problem has been studied in terms of query complexity as one of the problems closely connected to cryptography. For given two functions, f and g, as an oracle whic…