142 citations · 803 across the 51 of their papers we have counts for
3 papers · 1 filter
Power of Quantum Computation with Few Clean Qubits
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae +3
This paper investigates the power of polynomial-time quantum computation in which only a very limited number of qubits are initially clean in the |0> state, and all the remaining q…
Quantum Merlin-Arthur with Clifford Arthur
Tomoyuki Morimae, Masahito Hayashi, Harumichi Nishimura +1
We show that the class QMA does not change even if we restrict Arthur's computing ability to only Clifford gate operations (plus classical XOR gate). The idea is to use the fact th…
Quantum interpretations of AWPP and APP
Tomoyuki Morimae, Harumichi Nishimura
AWPP is a complexity class introduced by Fenner, Fortnow, Kurtz, and Li, which is defined using GapP functions. Although it is an important class as the best upperbound of BQP, its…