Authorized quantum computation

TL;DR

This paper introduces a secure quantum computation scheme where only users with a non-cloneable quantum key can perform specific operations, relying on quantum complexity to prevent forgery.

Contribution

It proposes a novel authorized quantum computation method based on quantum complexity, establishing security through the hardness of forging quantum keys from obfuscated gate sequences.

Findings

Security relies on quantum computational complexity assumptions.

The problem is shown to be NQP-hard via reduction to a known NQP-Complete problem.

Provides a framework for secure quantum authorization mechanisms.

Abstract

We present authorized quantum computation, where only a user with a non-cloneable quantum authorization key can perform a unitary operation created by an authenticated programmer. The security of our authorized quantum computation is based on the quantum computational complexity problem of forging the keys from an obfuscated quantum gate sequence. Under the assumption of the existence of a \textit{sufficiently-random gate shuffling algorithm}, the problem is shown to be in the NQP (Non-deterministic Quantum Polynomial)-hard class by reducing it to a NQP-Complete problem, the exact non-identity check problem. Therefore, our authorized quantum computation can be computationally secure against attacks using quantum computers.