# Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation

## TL;DR

This paper introduces a secure protocol enabling clients with limited quantum capabilities to verify that a server performs quantum sampling from a restricted class of quantum machines, ensuring security through information-theoretic principles.

## Contribution

It presents a novel, composable, information-theoretically secure verification protocol for non-universal quantum sampling using measurement-based blind quantum computing.

## Key findings

- Protocol achieves security against malicious servers
- Enables certification of quantum supremacy without universal quantum computers
- Utilizes properties of measurement-based blind quantum computing

## Abstract

We propose a new composable and information-theoretically secure protocol to verify that a server has the power to sample from a sub-universal quantum machine implementing only commuting gates. By allowing the client to manipulate single qubits, we exploit properties of Measurement based Blind Quantum Computing to prove security against a malicious Server and therefore certify quantum supremacy without the need for a universal quantum computer.