Challenge 2: Hidden Stabilizers — Clifford Circuit Obfuscation

# Overview

From Provable Advantage to Structural Analysis

The first challenge on Subnet 63 — peaked circuits — asked a straightforward question: can you execute this quantum circuit faithfully? The hidden stabilizers challenge raises the bar by asking miners to do something fundamentally harder: can you understand the structure of a quantum circuit well enough to extract hidden information from it?

In the stabilizer formalism, certain quantum states can be compactly described by a set of N commuting Pauli operators (stabilizers) that jointly "fix" the state. The challenge hides these stabilizers inside an obfuscated Clifford circuit. Miners must analyze the circuit, reverse the obfuscation, and recover the original stabilizer group — a task that requires genuine insight into quantum circuit structure rather than brute-force execution.

How the Challenge Works

Validators generate a random set of N commuting Pauli stabilizers, then construct a Clifford circuit that prepares the corresponding stabilizer state. This circuit is then obfuscated by composing it with random Clifford gates, scrambling the circuit's structure while preserving its mathematical relationship to the hidden stabilizers. The resulting circuit is sent to miners as a QASM file.

Miners must analyze the obfuscated circuit and return the hidden stabilizer group. This isn't a matter of running the circuit and measuring — it requires algebraic analysis of the circuit's gate structure to peel back the obfuscation layers and identify the underlying stabilizers. The challenge tests a completely different skill set than peaked circuits: mathematical reasoning about quantum operations rather than raw computational horsepower.

Why Hidden Stabilizers Matter

Clifford circuits and stabilizer states are foundational to quantum error correction, one of the most important open problems in quantum computing. Understanding how to efficiently analyze and decompose Clifford circuits has direct applications to error correction code design, quantum compiler optimization, and circuit verification. By incentivizing miners to develop efficient techniques for this class of problems, the subnet is building expertise in an area that will be critical as quantum hardware scales.

The hidden stabilizers challenge also introduced an important design principle for the subnet: not all challenges need to be about execution speed. Some of the most valuable problems in quantum computing are analytical, requiring cleverness rather than compute power. This diversity of challenge types helps attract a broader range of talent to the network.

Read the Full Paper

The complete technical description covers the stabilizer formalism, Clifford group structure, the obfuscation protocol, verification mechanics, and the mathematical foundations that make this challenge both well-defined and computationally interesting.

[Download the paper (PDF)](/hidden-stabilizers.pdf)