Zongyuan Wang of Peking University has developed a method to enable fault-tolerant logical measurements in quantum codes by introducing “completion qubits.” The work addresses a key challenge in gauging, a technique for performing logical measurements, where non-commuting checks can introduce errors; adding a single completion qubit per conflicting pair preserves the code’s integrity and distance while maintaining Clifford checks. Researchers demonstrate the construction by gauging two toric codes into the D(D_4) quantum double and back, building a circuit where the error correction performance matches the original code. This framework offers a pathway to more efficient logical measurements and has applications in preparing magic states for lattice surgery.

Commuting-Check Gauging Enables Fault-Tolerant Logical Measurements

Adding a single completion qubit for each pair of noncommuting checks preserves the gauged code space and its distance while maintaining Clifford-level checks, a result that minimizes qubit overhead during logical measurements. This preservation of both code integrity and computational efficiency is detailed in work from Zongyuan Wang of the International Center for Quantum Materials, School of Physics, Peking University. This approach addresses a key challenge in fault-tolerant quantum computation, where maintaining code distance during measurement is critical for reliable operation.

The research demonstrates that gauging and ungauging a distance-d parent code implements a logical measurement with a circuit fault distance of Ω(d) in O(d) rounds, establishing a quantifiable relationship between code performance and measurement complexity. This means the error rate of the logical measurement scales favorably with the error correction capabilities of the underlying code, offering a benchmark for evaluating different quantum error correction schemes.

The notation indicates a potentially efficient scaling, suggesting that more powerful codes can be used to achieve higher-fidelity logical measurements without a prohibitive increase in computational cost. The framework was demonstrated by gauging into and back from the D(D_4) quantum double using two toric codes, with an explicit circuit exhibiting a circuit fault distance equal to the parent code distance.

This practical demonstration validates the theoretical framework and confirms that the error correction performance of the resulting circuit matches that of the original code. The work extends this completion strategy to qudits, establishing bounds on the Clifford-hierarchy level of the completed checks in prime dimensions, and provides reductions at gauging and ungauging for bounding individual circuit faults.

Completion Qubits Resolve Noncommuting Checks for Clifford Symmetries

Completion also maintains the low-density parity-check property, adding qubits with only a constant factor increase, further streamlining the process. Detailed derivations supporting these relations, involving Pauli operators, are available in Section S1. 3 of the Supplemental Material. Researchers coupled noncommuting check pairs to completion qubits, ensuring the resulting checks commute for Clifford $Z_{2}$ symmetries of qubit stabilizer codes. This approach allows for the creation of commuting checks that can be measured using gates at level three or below, simplifying the quantum circuit required for error correction.

The framework’s robustness is confirmed by its extension to non-Pauli qubit parents and non-Clifford Z_2 symmetries, provided raw checks satisfy a specific equation detailed in the source material. Demonstrations using the D(D_4) quantum double on a square lattice illustrate this principle, with face diamonds representing completion qubits and arrows denoting CNOT gates directing information flow.

In the common +1 sector of central checks with completion qubits in the | + ⟩ state, ideal measurements accurately reproduce original outcomes and conditional states. “Every completed check and pinning check is Clifford,” when raw checks are Clifford and central checks are Pauli, ensuring compatibility with existing quantum algorithms and architectures. The circuit fault analysis also incorporates potential errors on completion qubits, providing a comprehensive assessment of the system’s reliability.

Gauging Framework Connects Logical Measurement to Lattice Surgery

A new framework establishes a direct link between logical measurement and lattice surgery through the use of commuting checks, offering a pathway to more efficient quantum computations. The approach addresses a fundamental challenge in gauging protocols where checks, essential for verifying quantum states, do not inherently commute, potentially randomizing measurement outcomes. By introducing completion qubits, researchers have created a system where these checks reliably commute, enabling fault-tolerant logical measurements.

For Clifford symmetries of Pauli parent codes, one additional qubit per conflicting pair preserves the gauged code space and its distance while keeping the checks Clifford. With bounded-depth extraction circuits, a suitable gauging graph preserves the parent code’s LDPC property, with constant-depth rounds and constant-factor qubit overhead for completion.

“Our results provide a framework for fault-tolerant logical measurements using commuting checks, with applications to magic-state preparation by lattice surgery,” the authors state, highlighting the potential for advancements in complex quantum operations. The work’s implications extend to lattice surgery, a technique for measuring joint logical operators by merging and splitting code patches, and preparing magic states from stabilizer states.

Pauli Symmetries and Disjoint Blocks Facilitate Gauging Construction

Gauging, a technique to transform a logical operator into a series of local checks, benefits from a construction that adds qubits selectively to preserve code integrity. This approach minimizes qubit overhead, an important factor in scaling quantum computations, and allows for the measurement of Clifford $Z_{2}$ symmetries acting on disjoint blocks of bounded size. The strategy uses symmetries that factor into local operations on these blocks, adding qubits to equate the product of local checks with the symmetry.

Constant circuit depth per round further streamlines the process, as each circuit remains bounded, ensuring the entire round operates with constant depth. The construction relies on a chain complex and a rooted Clifford construction, preserving the original check factors for qubits outside active blocks. The researchers demonstrated the viability of this approach by constructing circuits that meet specific criteria.

D(D_4) Quantum Double Demonstration via Toric Code Gauging

Fault propagation during quantum error correction can be bounded independently of the number of measurement rounds, a new demonstration reveals, offering a path to more reliable computations. This achievement confirms the viability of a method that uses completion qubits to ensure checks commute, even when acting on symmetries within qubit stabilizer codes. The construction preserves the low-density parity-check property of the original code with only a constant-factor qubit overhead, a significant advantage in scaling quantum systems.

For a symmetry acting on all parent qubits, the approach retains an existing qubit bound of O(n log n). The process involves raw checks formed from Gauss operators, flux operators and modified parent stabilizers, which can fail to commute outside the code space, potentially randomizing measurement outcomes. To address this, completion qubits are added, ensuring that these checks commute for Clifford symmetries.

This approach extends beyond qubit systems. The team proved that no globally commuting finite-hierarchy checks can preserve a code projector after adjoining fixed product-state completion qubits and qutrits.

Raw Checks and Symmetry Enrichment Initiate Logical Gauging

Gauging procedures now incorporate a method for measuring collective symmetry with bounded check weight and incidence within low-density parity-check (LDPC) parent codes, distinguishing active blocks by their non-trivial symmetry factors. The process begins with symmetry enrichment, then proceeds to gauging, establishing a framework where physical qubits of the parent code are designated as matter qubits, while additional qubits on graph edges function as gauge qubits.

This distinction is borrowed from lattice gauge theory and allows for a clear interpretation of the measurements performed during the gauging process. The construction uses raw checks, which are initially designed to measure collective symmetry, and then refined to ensure bounded weight and incidence, critical properties for maintaining the efficiency of the code. Each edge in this construction carries both a matter qutrit and a gauge qubit, facilitating the measurement and subsequent return to the parent code.

However, the researchers found that achieving finite-hierarchy checks with fixed product-state auxiliaries is not always possible in this encoding. The team’s work also explores completion techniques for the gross code and qudit completion for finite-order central commutators, establishing explicit hierarchy bounds, alongside a separate construction that omits completion qudits altogether.

Measuring a Clifford symmetry, they report, can prepare a magic state from a stabilizer state, directly linking logical measurements to twisted quantum doubles. The ability to measure several logical Pauli operators in parallel and reduce the number of auxiliary qubits needed for a measurement further enhances the efficiency of the process, while the resulting joint parity operator preserves the code space and acts nontrivially on the encoded information.

Completion Qubits Ensure Global Commutation of Gauged Checks

Pinning checks, introduced alongside completion qubits, actively preserve the gauged code space during measurement by fixing the completion qubit’s state within the code space itself. These checks, denoted as T(K_(ij),t_(ij)), function as the identity operator in the -1 eigenspace of the raw check $K_{i j}$ and as $X_{t_(ij)}$ in the +1 eigenspace, ensuring consistent outcomes without weakening error correction. The full commuting-check family, F, incorporates completed checks, central checks and these pinning checks, establishing a robust system for fault-tolerant operations.

The projectors $P_{g}$ and $P_{g}$ , representing the common +1 eigenspace of the raw and full commuting-check families respectively, maintain equivalent code distances; d(P_g) = d(P_g), even with the added qubits. This preservation of distance, alongside the low-density parity-check property maintained with a constant-factor qubit overhead, signifies a minimal resource impact for enhanced measurement fidelity.

The process allows for a projective measurement of a logical operator, U, encoding the selected eigenspace within the gauged code itself. Initializing gauge qubits to |0⟩ and completion qubits to | + ⟩, the system measures outcomes $a_{v}$ = ± 1 from completed Gauss checks, denoted as $A_{v}$ , and applies the corresponding gauging operator $G_{a}$ .

Error propagation, represented as v( $M_{}$ ± ) + | $η_{}$ ± |, remains bounded by κ $f_{}$ ±, where $f_{–}$ + $f_{}$ + ≤ f, demonstrating controlled fault propagation independent of the number of measurement rounds. Running S parent rounds, preparing the necessary qubits, and then R rounds in the gauged code, followed by another S parent rounds, allows for a complete measurement cycle.

Circuit Fault Distance Ω(d) Achieved in O(d) Rounds for Gauging

This scaling suggests a potentially efficient pathway for building more robust quantum computers. This preservation of the LDPC property, alongside bounded-depth extraction circuits, allows for efficient implementation without sacrificing code integrity.

“We show that the complete logical measurement has circuit fault distance Ω(d) in O(d) rounds, where d is the parent code distance,” the paper states, outlining the formal proof in the supporting material. The measurement outcomes are considered valid when every parent check registers a positive result in each round, gauged checks (excluding Gauss operators) also return positive values, and the final gauge readout conforms to a specific form.

👉 More information
🗞 Commuting-check gauging for fault-tolerant logical measurements
✍️ Zongyuan Wang (International Center for Quantum Materials, School of Physics, Peking University, Beijing 100871, China)
🧠 ArXiv: https://arxiv.org/abs/2611.12236v1

More like this