Quantum computational supremacy arguments, which describe a way for a quantum
computer to perform a task that cannot also be done by a classical computer, typically …

We investigate the problem of evaluating the output probabilities of Clifford circuits with
nonstabilizer product input states. First, we consider the case when the input state is mixed …

While the circuit model of quantum computation defines its logical depth or “computational
time” in terms of temporal gate sequences, the measurement-based model could allow …

The instantaneous quantum polynomial time (IQP) model is one of promising models to
demonstrate a quantum computational advantage over classical computers. If the IQP model …

Verification of quantum computation is a task to efficiently check whether an output given
from a quantum computer is correct. Existing verification protocols conducted between a …

Output probability distributions of several sub-universal quantum computing models cannot
be classically efficiently sampled unless some unlikely consequences occur in classical …

We define rewinding operators that invert quantum measurements. Then, we define
complexity classes ${\sf RwBQP} $, ${\sf CBQP} $, and ${\sf AdPostBQP} $ as sets of …

It is known that several sub-universal quantum computing models, such as the IQP model,
the Boson sampling model, the one-clean qubit model, and the random circuit model, cannot …

Delegated quantum computing enables a client with weak computational power to delegate
quantum computing to a remote quantum server in such a way that the integrity of the server …

Blind quantum computing enables a client, who can only generate or measure single-qubit
states, to delegate quantum computing to a remote quantum server in such a way that the …