(英) |
Verification is a task to check wether a given quantum state is correct or not. If a verifier does not have enough ability to generate the correct state by oneself, verification is a highly non-trivial problem. In this presentation, we introduce a protocol for the verification of any polynomial-time-generated hypergraph state, which requires only sequential single-qubit measurements of Pauli operators. To this end, we propose an adaptive stabilizer test by combining the original stabilizer test and adaptive classical processing. Importantly, our protocol does not assume any i.i.d. property of samples. Accordingly, as applications, our protocol can be used for the verification of the quantum supremacy demonstration with the instantaneous quantum polynomial time (IQP) model and verifiable blind quantum computing. |