← all papers · overview

Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation

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.

Related papers

Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).