Won Joon Yun
← All projects

Fault-tolerant quantum architecture · The Baker Group · 2026

Chameleon

Calibration-aware optimization of per-qubit Clifford frames for spatially non-uniform biased noise.

Under review

The three-stage Chameleon pipeline: construct ambiguity operators, optimize binary Clifford frames, refine across the full frame space, and deploy the optimized frame.
Chameleon is a compile-time pass. Ambiguity operators are constructed once per code; frame selection is repeated online for each calibration map.
View full-size figure ↗

Overview

Superconducting devices exhibit qubit-dependent Pauli error rates and spatially non-uniform X/Z bias. Chameleon treats Clifford deformation as a compile-time selection of local Pauli frames, so a code can adapt to each calibration map without adding qubits, syndrome-extraction rounds, or code-distance cost.

A logical failure can arise from two same-syndrome error patterns with different logical effects. Their product is an ambiguity operator. Chameleon changes the per-qubit frame to reduce the probability mass of these decoder-unavoidable, Type-A failure mechanisms.

Design

  1. Reusable Ambiguity-Set Construction

    Collect low-weight ambiguity operators once per code and store the retained set in a lookup table that is reused across calibration maps.

  2. Binary-Frame Search with an Analytic Bound

    Replace exponential rare-event evaluation with a decoder-free Bhattacharyya upper bound, then minimize the surrogate U over the binary frame space {I, H}ⁿ.

  3. Refinement to the Full Frame Space

    Warm-start a cross-entropy search over all six rate-distinct Clifford frames and deploy the refined frame only when it improves the objective.

Key results

Across calibration-derived noise maps, Chameleon reduces average worst-axis Type-A logical error rates by 13%, 7%, and 4% for surface, color, and bivariate-bicycle codes relative to the best prior baseline.

13% / 7% / 4%average worst-axis Type-A LER reduction: surface / color / BB
9.4 s – 3.1 minonline frame selection, excluding one-time preprocessing

Frame-selection times exclude one-time ambiguity-set construction. The days-to-minutes comparison uses 75,000 candidates and an idealized 1 μs-per-shot decoder baseline (v1, Table III).

People

  • The University of Texas at Austin mark
    Won Joon Yun Ph.D. Student · The University of Texas at Austin
  • The University of Texas at Dallas mark
    Prof. Andrew Nemec CS Professor · The University of Texas at Dallas
  • The University of Texas at Austin mark
    Prof. Jonathan Baker ECE Professor · The University of Texas at Austin