Quantum computers promise to efficiently solve not only problems believed to be intractable
for classical computers, but also problems for which verifying the solution is also considered …

The precise control of complex quantum systems promises numerous technological
applications including digital quantum computing. The complexity of such devices renders …

In this perspective we discuss verification of quantum devices in the context of specific
examples formulated as proposed experiments. Our first example is verification of analog …

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 with only …

We propose a set of protocols for verifying quantum computing at any time after the
computation itself has been performed. We provide two constructions: one requires five …

Hypergraph states are generalizations of graph states where controlled-Z gates on edges
are replaced with generalized controlled-Z gates on hyperedges. Hypergraph states have …

There are two types of universality in measurement-based quantum computation (MBQC):
strict and computational. It is well known that the former is stronger than the latter. We …

Prior work has established that all problems in NP admit classical zero-knowledge proof
systems, and under reasonable hardness assumptions for quantum computations, these …

We show that every language in QMA admits a classical-verifier, quantum-prover zero-
knowledge argument system which is sound against quantum polynomial-time provers and …

Verifiable blind quantum computing is a secure delegated quantum computing where a
client with a limited quantum technology delegates her quantum computing to a server who …