193 citations · 2.1k across the 95 of their papers we have counts for
6 papers · 2 filters
Post hoc verification of quantum computation
Joseph F. Fitzsimons, Michal Hajdušek
With recent progress on experimental quantum information processing, an important question has arisen as to whether it is possible to verify arbitrary computation performed on a qu…
Quantum proofs can be verified using only single qubit measurements
Tomoyuki Morimae, Daniel Nagaj, Norbert Schuch
QMA (Quantum Merlin Arthur) is the class of problems which, though potentially hard to solve, have a quantum solution which can be verified efficiently using a quantum computer. It…
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…
Verifiable measurement-only blind quantum computing with stabilizer testing
Masahito Hayashi, Tomoyuki Morimae
We introduce a simple protocol for verifiable measurement-only blind quantum computing. Alice, a client, can perform only single-qubit measurements, whereas Bob, a server, can gene…
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…