193 citations · 2.1k across the 95 of their papers we have counts for
6 papers · 1 filter
Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy
Tomoyuki Morimae, Yuki Takeuchi, Harumichi Nishimura
We introduce a simple sub-universal quantum computing model, which we call the Hadamard-classical circuit with one-qubit (HC1Q) model. It consists of a classical reversible circuit…
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…
Verification of Many-Qubit States
Yuki Takeuchi, Tomoyuki Morimae
Verification is a task to check whether a given quantum state is close to an ideal state or not. In this paper, we show that a variety of many-qubit quantum states can be verified…
Hardness of classically sampling one clean qubit model with constant total variation distance error
Tomoyuki Morimae
The one clean qubit model (or the DQC1 model) is a restricted model of quantum computing where only a single input qubit is pure and all other input qubits are maximally mixed. In…
Merlinization of complexity classes above BQP
Tomoyuki Morimae, Harumichi Nishimura
We study how complexity classes above BQP, such as postBQP, , and SBQP, change if we "Merlinize" them, i.e., if we allow an extra input quantum state (or cl…
Verified measurement-based quantum computing with hypergraph states
Tomoyuki Morimae, Yuki Takeuchi, Masahito Hayashi
Hypergraph states are generalizations of graph states where controlled- gates on edges are replaced with generalized controlled- gates on hyperedges. Hypergraph states have s…