142 citations · 803 across the 51 of their papers we have counts for
Showing 2003Show all
2 papers · 1 filter
quant-ph2003★ 8 cited
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation
Harumichi Nishimura, Tomoyuki Yamakami
This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, g…
quant-ph2003★ 49 cited
Polynomial time quantum computation with advice
Harumichi Nishimura, Tomoyuki Yamakami
Advice is supplementary information that enhances the computational power of an underlying computation. This paper focuses on advice that is given in the form of a pure quantum sta…