activity
20042026
most citedVerifiable measurement-only blind quantum computing with stabilizer testing

193 citations · 2.1k across the 95 of their papers we have counts for

collaborators
Showing 2014Show all

6 papers · 1 filter

quant-ph2014★ 62 cited

Impossibility of Classically Simulating One-Clean-Qubit Computation

Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae +3

Deterministic quantum computation with one quantum bit (DQC1) is a restricted model of quantum computing where the input state is the completely mixed state except for a single cle…

quant-ph2014★ 1 cited

The process matrix framework for a single-party system

Tomoyuki Morimae

The process matrix framework [O. Oreshkov, F. Costa, and C. Brukner, Nature Communications {\bf3}, 1092 (2012)] can describe general physical theory where locally operations are de…

quant-ph2014

Impossibility of perfectly-secure one-round delegated quantum computing for classical client

Tomoyuki Morimae, Takeshi Koshiba

Blind quantum computing protocols enable a client, who can generate or measure single-qubit states, to delegate quantum computing to a remote quantum server protecting the client's…

quant-ph2014★ 2 cited

Classical simulatability of the one clean qubit model

Tomoyuki Morimae, Takeshi Koshiba

Deterministic quantum computation with one quantum bit (DQC1), or the one clean qubit model, [E. Knill and R. Laflamme, Phys. Rev. Lett. {\bf81}, 5672 (1998)] is a model of quantum…

quant-ph2014★ 18 cited

Acausal measurement-based quantum computing

Tomoyuki Morimae

In the measurement-based quantum computing, there is a natural "causal cone" among qubits of the resource state, since the measurement angle on a qubit has to depend on previous me…

quant-ph2014

Highly-mixed measurement-based quantum computing and the one clean qubit model

Tomoyuki Morimae

We show that a highly-mixed state in terms of a large min-entropy is useless as a resource state for measurement-based quantum computation in the sense that if a classically effici…