193 citations · 2.1k across the 95 of their papers we have counts for
6 papers · 2 filters
On the hardness of classically simulating the one clean qubit model
Tomoyuki Morimae, Keisuke Fujii, Joseph F. Fitzsimons
Deterministic quantum computation with one quantum bit (DQC1) is a model of quantum computing where the input restricted to containing a single qubit in a pure state and with all o…
Quantum Commuting Circuits and Complexity of Ising Partition Functions
Keisuke Fujii, Tomoyuki Morimae
Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal in the sense of standard…
Minimum heat dissipation in measurement-based quantum computation
Tomoyuki Morimae
We show that at least 2kTln2 of heat dissipation per qubit occurs in measurement-based quantum computation according to Landauer's principle. This result is derived by using only t…
Efficient universal blind computation
Vittorio Giovannetti, Lorenzo Maccone, Tomoyuki Morimae +1
We give a cheat sensitive protocol for blind universal quantum computation that is efficient in terms of computational and communication resources: it allows one party to perform a…
Composable security of measuring-Alice blind quantum computation
Tomoyuki Morimae, Takeshi Koshiba
Blind quantum computing [A. Broadbent, J. Fitzsimons, and E. Kashefi, Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science 517 (2009)] is a secure cloud…
Secure entanglement distillation for double-server blind quantum computation
Tomoyuki Morimae, Keisuke Fujii
Blind quantum computation is a new secure quantum computing protocol where a client, who does not have enough quantum technologies at her disposal, can delegate her quantum computa…