# Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation (Extended Abstract)

## TL;DR

This paper introduces an information-theoretic method for certifying the quantum advantage of a limited, intermediate quantum device that performs commuting gates, using minimal quantum memory and measurement-based techniques.

## Contribution

It presents a novel certification protocol for a sub-universal quantum server with commuting gates, enabling verification of quantum superiority with limited quantum resources.

## Key findings

- Provides a secure hypothesis test for quantum advantage
- Enables verification with minimal quantum memory and simple client operations
- Utilizes measurement-based blind quantum computing techniques

## Abstract

The efficient certification of classically intractable quantum devices has been a central research question for some time. However, to observe a "quantum advantage", it is believed that one does not need to build a large scale universal quantum computer, a task which has proven extremely challenging. Intermediate quantum models that are easier to implement, but which also exhibit this quantum advantage over classical computers, have been proposed. In this work, we present a certification technique for such a sub-universal quantum server which only performs commuting gates and requires very limited quantum memory. By allowing a verifying client to manipulate single qubits, we exploit properties of measurement based blind quantum computing to give them the tools to test the "quantum superiority" of the server.