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 2021 · quant-phShow all

5 papers · 2 filters

quant-ph2021★ 74 cited

Quantum commitments and signatures without one-way functions

Tomoyuki Morimae, Takashi Yamakawa

In the classical world, the existence of commitments is equivalent to the existence of one-way functions. In the quantum setting, on the other hand, commitments are not known to im…

quant-ph2021

Certified Everlasting Zero-Knowledge Proof for QMA

Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki +1

In known constructions of classical zero-knowledge protocols for NP, either of zero-knowledge or soundness holds only against computationally bounded adversaries. Indeed, achieving…

quant-ph2021★ 8 cited

Divide-and-conquer verification method for noisy intermediate-scale quantum computation

Yuki Takeuchi, Yasuhiro Takahashi, Tomoyuki Morimae +1

Several noisy intermediate-scale quantum computations can be regarded as logarithmic-depth quantum circuits on a sparse quantum computing chip, where two-qubit gates can be directl…

quant-ph2021★ 36 cited

Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication

Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki +1

Broadbent and Islam (TCC '20) proposed a quantum cryptographic primitive called quantum encryption with certified deletion. In this primitive, a receiver in possession of a quantum…

quant-ph2021

Classically Verifiable NIZK for QMA with Preprocessing

Tomoyuki Morimae, Takashi Yamakawa

We propose three constructions of classically verifiable non-interactive zero-knowledge proofs and arguments (CV-NIZK) for QMA in various preprocessing models. - We construct a CV-…