Obfuscation of Arbitrary Quantum Circuits
Miryam Mi-Ying Huang, Er-Cheng Tang

TL;DR
This paper presents the first quantum obfuscation scheme for arbitrary quantum circuits with quantum inputs and outputs, using novel primitives and assuming post-quantum one-way functions, solving a longstanding open problem.
Contribution
It introduces a new primitive called subspace-preserving strong pseudorandom unitary and constructs a quantum ideal obfuscation scheme for general quantum circuits.
Findings
First quantum obfuscation scheme for arbitrary quantum circuits.
Introduction of subspace-preserving strong pseudorandom unitaries.
Scheme can be realized in the quantumly accessible pseudorandom oracle model.
Abstract
Program obfuscation aims to conceal a program's internal structure while preserving its functionality. A central open problem is whether an obfuscation scheme for arbitrary quantum circuits exists. Despite several efforts having been made toward this goal, prior works have succeeded only in obfuscating quantum circuits that implement either pseudo-deterministic functions or unitary transformations. Although unitary transformations already include a broad class of quantum computation, many important quantum tasks, such as state preparation and quantum error-correction, go beyond unitaries and fall within general completely positive trace-preserving maps. In this work, we construct the first quantum ideal obfuscation scheme for arbitrary quantum circuits that support quantum inputs and outputs in the classical oracle model assuming post-quantum one-way functions, thereby resolving an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Complexity and Algorithms in Graphs · Cryptography and Data Security
