Obfuscation of Arbitrary Quantum Circuits (via Subspace-Preserving Pseudorandom Unitary)

summary

The gist

Program obfuscation aims to conceal a program’s internal structure while preserving its functionality, and this work constructs the first quantum ideal obfuscation scheme for arbitrary quantum

In short

This work constructs a quantum ideal obfuscation scheme for arbitrary quantum circuits in the classical oracle model using postquantum one-way functions. It solves the challenge of obfuscating general maps by introducing a novel primitive called subspace-preserving strong pseudorandom unitary (spsPRU), which combines structure and randomness to hide the original computation while preserving its functionality.

Key concepts

Ideal Obfuscation: This is a security standard where an obfuscated circuit's behavior is computationally indistinguishable from interacting directly with an ideal, secure functionality that depends only on the problem being solved. It ensures that adversaries learn nothing more than they could from the ideal system.
Subspace-Preserving Strong Pseudorandom Unitary (spsPRU): This is a crucial new primitive defined as a set of unitaries that are perfectly random on one part of a space while fixing every vector in another linear subspace. It allows the scheme to simultaneously hide the input and generate pseudorandomness conditioned on specific ancilla states.
Classical Oracle Model: This is the computational setting where the obfuscation scheme operates. It means that while quantum circuits are involved, any queries or information an adversary gains about the circuit must be processed using classical computation, which is assumed to be computationally limited.

Terminology used across episodes

Reinforcement Learning (RL) — explained in 25 episodes
Retrieval-Augmented Generation (RAG) — explained in 16 episodes
Interpretability — explained in 15 episodes
Sample Complexity — explained in 15 episodes
Federated Learning — explained in 14 episodes
Generalization — explained in 13 episodes

This episode discusses

The paper

Obfuscation of Arbitrary Quantum Circuits (via Subspace-Preserving Pseudorandom Unitary) · Read on arXiv

Mi-Ying Huang, Er-Cheng Tang

University of Southern California · University of Washington

Program obfuscation aims to conceal a computer 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 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 computations, many important quantum tasks, such as state preparation, quantum sampling, and quantum error correction, go beyond unitaries and are described by general completely positive trace-preserving (CPTP) 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 open problem raised in Bartusek et al. (STOC 2023), Bartusek, Brakerski, and Vaikuntanathan (STOC 2024), and Huang and Tang (FOCS 2025). At the core of our construction lies a novel primitive that we introduce, called the subspace-preserving strong pseudorandom unitary (spsPRU). An spsPRU is a family of efficient unitaries that fix every vector in a given linear subspace S, while acting as a Haar random unitary on its orthogonal complement S under both forward and inverse oracle queries. Furthermore, by instantiating the classical oracle model with the ideal obfuscation scheme for classical circuits proposed by Jain et al. (CRYPTO 2023) and later enhanced by Bartusek et al. (CRYPTO 2026), our obfuscation scheme can also be realized in the quantumly accessible pseudorandom oracle model.

Transcript

Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.

Kai: I'm Kai, and with me are Mira and Lev, guest researcher.

Mira: Today's paper: "Obfuscation of Arbitrary Quantum Circuits (via Subspace-Preserving Pseudorandom Unitary)".

Kai: Program obfuscation aims to conceal a program’s internal structure while preserving its functionality,

Mira: First, who's behind it and why it matters.

Paper summary: Kai: So what the authors are claiming is that they've managed to construct a quantum ideal obfuscation scheme for arbitrary quantum circuits supporting both quantum inputs and outputs, operating within the classical oracle model and assuming post-quantum one-way functions <ref:2601.08969#pg0>. They essentially resolve an open problem posed in STOC two thousand twenty-three by showing a way to achieve the strong notion of ideal obfuscation for general circuits under these assumptions <ref:2601.08969#pg0,an open problem posed in>.

Mira: The core idea revolves around defining an ideal functionality, Idealλ,p,Φ, which captures exactly what an adversary learns from interacting with the circuit versus interacting with this ideal functionality that depends only on security parameters and the map itself <ref:2601.08969#pg1>.

Lev: From a researcher's viewpoint, achieving this means that if you were to run this on real hardware, the complexity would be tied to how efficiently you can implement those oracles they mentioned, specifically the S-preserving path-recording oracle Orecord and O'record which extend the path-recording oracle from MH25 to preserve subspace S = span x⟩ for x ∈ d <ref:2601.08969#pg3>.

Kai: And that construction they propose, Construction two uses this ideal obfuscation scheme along with a strong pseudorandom unitary PRU and the spsPRU to build the final obfuscated program Q′k,k' = (PRUk′ ⊗ In′) ◦ (ctrl1λ-UQ) ◦ spsPRU <ref:2601.08969#pg0>.

Mira: The security analysis shows that for any two circuits Q0 and Q1 with close mappings Φ0 and Φ1, the resulting obfuscations are indistinguishable against any polynomial query adversary D, showing a computational distance of negl(λ) <ref:2601.08969#pg4>.

Conclusion: Kai: Considering the title, "Obfuscation of Arbitrary Quantum Circuits (via Subspace-Preserving Pseudorandom Unitary)," it really signals that this work isn't just about a specific type of computation anymore but tackling any general quantum map <ref:2601.08969#pg0>. It’s about making the internal workings of a circuit hidden while still letting someone compute the intended function, which is a fundamental goal in quantum security.

Mira: I think what this really means for condensed matter theory and broader physics is that we can now consider much more complex quantum operations, like state preparation or error correction beyond simple unitaries, and still hide them effectively using these techniques <ref:2601.08969#pg1>.

Lev: If this scheme holds up to the security assumptions of post-quantum one-way functions, it suggests that we might have a path toward securing quantum computation in a way that doesn't rely on overly restrictive models like classical inputs and outputs or purely unitary transformations <ref:2601.08969#pg1>.

Kai: So, in simpler terms for the listeners, they’ve shown a concrete way to hide complex quantum processes—not just simple rotations—inside a program structure that maintains its original behavior even when viewed by an adversary who can query it polynomially <ref:2601.08969#pg4>.

Mira: The implication is that the barrier against building tools for tasks like quantum error-correction, which are not just unitaries, might be lower than previously thought because this paper provides a framework for achieving ideal obfuscation in this setting <ref:2601.08969#pg0>.

More episodes

← Home