#floquetcodes

Bravyi-König Theorem

Theoretical breakthrough for quantum computing: QuSoft and CWI researchers proved that a fundamental “no-go” theory applies to Floquet codes, a potential new family of quantum error-correcting protocols. In their study, Jelena Mackeprang and Jonas Helsen show that the Bravyi-König theorem, which previously limited topological stabilizer codes, also applies to Floquet codes constructed by locally conjugate instantaneous stabilizer groups.

Developing Quantum Error Correction

Quantum hardware is fragile, therefore fault-tolerant computing and Quantum Error Correction (QEC) are essential for ubiquitous quantum computers. Traditionally, the industry has used the Pauli stabilizer formalism, which defines a codespace as the joint eigenspace of an abelian subgroup of the Pauli group. These systems are bottlenecked by high-weight measurements, which require sophisticated, entangling procedures over multiple qubits.

Floquet codes (dynamical codes) help scientists avoid this. Code in these systems transitions across instantaneous stabilizer groups instead of a static codespace. This transition is achieved by measuring Pauli operators that anti-commute with a subset of the current stabilizers, so “decomposing” high-weight measurements. Because the measured operators anti-commute with at least one stabilizer group element, they measure the "destabilizer," assuring no logical information is gained or lost.

Bravyi-König Limit Extension

The Bravyi-König theorem underpins quantum information theory. A D-dimensional topological stabilizer code restricts any logical operation that may be implemented by a short-depth, short-range circuit to the D-th Clifford hierarchy level. In a two-dimensional code, this limits such circuits to the Clifford group, preventing the direct implementation of universal computation features like the T-gate.

Mackeprang and Helsen investigated if dynamic Floquet codes may overcome this constraint. Their analysis focused on locally conjugate stabilizer group codes, which cover most topological dynamical codes introduced so far. Reversible pairings of stabilizer groups (A↔B) and “conjugate bases” provide a smooth transition, preserving logical information despite the destructive nature of projective measurements.

“Generalised Logical Unitary” Innovation

The research focuses on generalized logical unitarizes, a new class of operations. At every step, classical QEC logical operations preserve codespace. Mackeprang and Helsen found Floquet codes more flexible. They defined unitarizes that momentarily deviate from the codespace if they meet four strict conditions: error detectability, self-correction, logical preservation, and equivalence.

These generalized unitarizes are possible because some Pauli operations relocate state out of the current codespace without committing an error. They are “absorbed” by the next Floquet sequence measurement. The researchers created a canonical form for these unitarizes to show that they may be broken down into a product of elements from the subsequent measurement basis and a codespace-maintaining operator.

Locality and Data Integrity

Geometric locality is essential for fault tolerance, according to the study. Using locally conjugate stabilizer groups, researchers prevented errors from spreading. This locality ensures that a projective measurement's local errors are mapped to each other.

The researchers also found that a constant-depth, finite-range circuit may implement the Floquet transition operator, which expresses the projective measurements' influence. This allowed the researchers to combine unitarizes and transitions into one procedure. Their final proof shows that the Bravyi-König theorem still binds the logical action of generalized unitarizes, even with additional freedom. If the number of time steps in the Floquet sequence is constant, the combined operation stays in the Clifford hierarchy's D-th level.

Looking Ahead

The findings set a computational limit for current Floquet code designs. While revealing a fundamental constraint, the research also illuminates the working principles of information preservation in dynamical codes, which had been relatively implied in past investigations.