79 citations · 157 across the 15 of their papers we have counts for
12 papers · 1 filter
Guesswork of a quantum ensemble
Michele Dall'Arno, Francesco Buscemi, Takeshi Koshiba
The guesswork of a quantum ensemble quantifies the minimum number of guesses needed in average to correctly guess the state of the ensemble, when only one state can be queried at a…
Verifiable Quantum Secure Modulo Summation
Masahito Hayashi, Takeshi Koshiba
We propose a new cryptographic task, which we call verifiable quantum secure modulo summation. Secure modulo summation is a calculation of modulo summation when $…
Arbitrable Blind Quantum Computation
Go Sato, Takeshi Koshiba, Tomoyuki Morimae
Blind quantum computation is a two-party protocol which involves a server Bob who has rich quantum computational resource and provides quantum computation service and a client Alic…
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…
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…
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…