Table of Contents
Fetching ...

Obfuscation of Unitary Quantum Programs

Mi-Ying Huang, Er-Cheng Tang

TL;DR

This work achieves the first quantum state obfuscation for unitary (or near-unitary) quantum programs that accept quantum inputs and outputs within the classical oracle model. The construction combines a projective LM (PLM) representation of quantum programs, a functional authentication scheme with simulation-based security, and a teleportation-based protocol to handle quantum inputs/outputs, enabling secure reusability. By compiling general quantum circuits into PLM programs and obfuscating them with authenticated states and a classical oracle, the authors prove an ideal obfuscation for approximately-unitary quantum programs under post-quantum cryptographic assumptions, with unconditional security in a truly random classical oracle. The results also link obfuscation to copy-protection and functional encryption for quantum functionalities, and outline open questions such as obfuscating isometries and achieving plain-model instantiations.

Abstract

Program obfuscation aims to hide the inner workings of a program while preserving its functionality. In the quantum setting, recent works have obtained obfuscation schemes for specialized classes of quantum circuits. For instance, Bartusek, Brakerski, and Vaikuntanathan (STOC 2024) constructed a quantum state obfuscation scheme, which supports the obfuscation of quantum programs represented as quantum states for pseudo-deterministic quantum programs with classical inputs and outputs in the classical oracle model. In this work, we improve upon existing results by constructing the first quantum state obfuscation scheme for unitary (or approximately unitary) quantum programs supporting quantum inputs and outputs in the classical oracle model. At the core of our obfuscation scheme are two novel ingredients: a functional quantum authentication scheme that allows key holders to learn specific functions of the authenticated quantum state with simulation-based security, and a compiler that represents an arbitrary quantum circuit as a projective linear-plus-measurement quantum program described by a sequence of non-adaptive Clifford gates interleaved with adaptive and compatible measurements.

Obfuscation of Unitary Quantum Programs

TL;DR

This work achieves the first quantum state obfuscation for unitary (or near-unitary) quantum programs that accept quantum inputs and outputs within the classical oracle model. The construction combines a projective LM (PLM) representation of quantum programs, a functional authentication scheme with simulation-based security, and a teleportation-based protocol to handle quantum inputs/outputs, enabling secure reusability. By compiling general quantum circuits into PLM programs and obfuscating them with authenticated states and a classical oracle, the authors prove an ideal obfuscation for approximately-unitary quantum programs under post-quantum cryptographic assumptions, with unconditional security in a truly random classical oracle. The results also link obfuscation to copy-protection and functional encryption for quantum functionalities, and outline open questions such as obfuscating isometries and achieving plain-model instantiations.

Abstract

Program obfuscation aims to hide the inner workings of a program while preserving its functionality. In the quantum setting, recent works have obtained obfuscation schemes for specialized classes of quantum circuits. For instance, Bartusek, Brakerski, and Vaikuntanathan (STOC 2024) constructed a quantum state obfuscation scheme, which supports the obfuscation of quantum programs represented as quantum states for pseudo-deterministic quantum programs with classical inputs and outputs in the classical oracle model. In this work, we improve upon existing results by constructing the first quantum state obfuscation scheme for unitary (or approximately unitary) quantum programs supporting quantum inputs and outputs in the classical oracle model. At the core of our obfuscation scheme are two novel ingredients: a functional quantum authentication scheme that allows key holders to learn specific functions of the authenticated quantum state with simulation-based security, and a compiler that represents an arbitrary quantum circuit as a projective linear-plus-measurement quantum program described by a sequence of non-adaptive Clifford gates interleaved with adaptive and compatible measurements.

Paper Structure

This paper contains 33 sections, 35 theorems, 104 equations, 1 figure, 1 table.

Key Result

Theorem 1.1

There exists a quantum state obfuscation scheme for the class of all approximatelyAs an improvement on the allowed approximation factor, our result can obfuscate programs with up to $\operatorname{negl}(\lambda)$ approximation error, whereas bartusek2024quantum only obfuscates programs that have $2^

Theorems & Definitions (75)

  • Theorem 1.1: Informal
  • Definition 3.1: Quantum Teleportation
  • Lemma 3.2
  • Lemma 3.3
  • proof
  • Definition 3.4
  • Theorem 3.5: ben2023quantum
  • Definition 3.6: Post-quantum PRF
  • Theorem 3.7: zhandry2021construct
  • Lemma 3.8: watrous2018theory
  • ...and 65 more