142 citations · 803 across the 51 of their papers we have counts for
4 papers · 1 filter
Impossibility of blind quantum sampling for classical client
Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi +1
Blind quantum computing enables a client, who can only generate or measure single-qubit states, to delegate quantum computing to a remote quantum server in such a way that the inpu…
Quantum Advantage for the LOCAL Model in Distributed Computing
François Le Gall, Harumichi Nishimura, Ansis Rosmanis
There are two central models considered in (fault-free synchronous) distributed computing: the CONGEST model, in which communication channels have limited bandwidth, and the LOCAL…
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups
François Le Gall, Tomoyuki Morimae, Harumichi Nishimura +1
In this paper we consider what can be computed by a user interacting with a potentially malicious server, when the server performs polynomial-time quantum computation but the user…
Rational proofs for quantum computing
Tomoyuki Morimae, Harumichi Nishimura
It is an open problem whether a classical client can delegate quantum computing to an efficient remote quantum server in such a way that the correctness of quantum computing is som…