Measurement-and-Feedforward Quantum Circuits as Code Design: Detectability, Branch Counting, and the Location of Nonstabilizerness

In the paper's words

Shallow quantum circuits augmented by mid-circuit measurements and classical feedforward can deterministically prepare long-range entangled states and implement global unitaries that no comparable-depth unitary circuit can reach. Recent work established a general correspondence between all such protocols and quantum error-correcting codes (QECCs): the unitary circuit preceding the measurements acts as an encoder, and unitary feedforward eliminates post-selection if and only if the measurement projectors are detectable errors on the codespace. We develop the quantitative consequences of this correspondence.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. A worked post-selection comparison on the Steane code shows a depth-reduction factor of $80/17 \approx 4.71$ for an encoder of depth $d=10$.

   from Abstract

2. We quantify this with the stabilizer Rényi entropy $M_2$, computing $M_2(|T\rangle) = \log_2(4/3) \approx 0.415037$ bits per injection and the linear scaling $M_2^{(m)} = m\,M_2(|T\rangle)$ (Section 4.3).

   from 1. Introduction

3. Since the encoder is the sole magic source [1], the protocol's magic budget is a line item: each injected $T$-type resource contributes $\log_2(4/3) \approx 0.415037$ bits, and a designer targeting a state with known $M_2^{\text{target}}$ needs at least $$m_{\min} = \left\lceil \frac{M_2^{\text{target}}}{\log_2(4/3)} \right\rceil$$ single-qubit injections under assumption (A3).

   from 4.3 Magic accounting for Pauli-measurement protocols

4. At $n = 49$ with $k = 1$, $R = 1/49 \approx 0.020408$: $$N_{\text{br}} = 2^{49 \times (1 - 0.020408)} = 2^{48} = 281{,}474{,}976{,}710{,}656 \approx 2.81 \times 10^{14}.$$ This is a projection of the counting identity under the stated assumptions (fixed $n$, no exploitation of structured feedforward); it bounds worst-case classical control breadth, not realized circuit cost.

   from 4.5 Rate penalty on branch count (labeled projection)

5. For the three-$X$-stabilizer measurement on Steane: $N_{\text{out}} = 8$, $p_{\text{succ}} = 1$, $R_{\text{exp}}^{\text{post}} = 8$, $\Delta G = 7$; depth-reduction factor $80/17 \approx 4.71$ under the stated assumption $d = 10$ (Section 4.4).

   from 5. Results

6. The $n = 49$ projection in R6 is a worst-case bound and should not be read as an implementation cost; structured feedforward (syndrome-keyed lookup tables, or Pauli-frame tracking in the sense of [8]) typically compresses the control map dramatically, and quantifying that compression is open.

   from 6. Discussion

How it is done

1. We derive the branch-count identity $N_{\text{br}} = 2^{n-k}$ for an $[[n,k]]$ stabilizer code, the detectability fraction $p_{\text{det}} = 1 - 2^{2-n-k}$ (evaluated for the $[[5,1,3]]$ and $[[7,1,3]]$ codes as $0.9375$ and $0.984375$), and the magic accounting $M_2(|T\rangle) = \log_2(4/3) \approx 0.415037$ bits per injected $T$ state, with linear scaling $M_2^{(m)} = m\,M_2(|T\rangle)$.

   from Abstract

2. The structural reason for this enhancement was recently made precise: every measurement-and-feedforward protocol corresponds to a quantum error-correcting code, with the pre-measurement circuit playing the role of the encoder, and feedforward can remove the need for post-selection if and only if the measurement projectors act as detectable errors on the codespace [1],[2].

   from 1. Introduction

3. That work establishes two structural facts: (i) the circuit preceding the measurements in any measurement-and-feedforward protocol acts as an encoder for a quantum code, and (ii) unitary feedforward can eliminate post-selection if and only if the measurement projectors are detectable errors on the codespace.

   from 2. Background and Related Work

4. Fix a stabilizer code with Pauli group $\mathcal{P}_n$ on $n$ physical qubits, stabilizer group $\mathcal{S} = \langle g_1, \dots, g_{n-k} \rangle$, and codespace $\mathcal{C}$.

   from 3.1 The correspondence as a design interface

What would falsify it

1. In the language of [1], verification is a post-selection surrogate; the correspondence predicts exactly when unitary feedforward can replace it, a design question [7] does not itself answer.

   from 2. Background and Related Work

2. A single counterexample protocol of either kind would falsify the framework and with it our counting identities.

   from 6. Discussion

3. R6 would be falsified as a practical claim (not as a bound) by a demonstration that structured feedforward reduces realized control cost to $\mathrm{poly}(n)$ on a vanishing-rate code while preserving determinism.

   from 6. Discussion

Where the claim stops

1. Our quantitative results live entirely inside assumptions (A1)–(A3).

   from 6. Discussion

2. The branch-count identity assumes Pauli measurements refining the stabilizer; non-Pauli measurements — one of [1]'s escape routes to long-range nonstabilizerness — have non-binary outcome structures, and the identity generalizes to $N_{\text{br}} = \prod_j r_j$ for outcome ranks $r_j$, which we have not computed for any specific non-Pauli measurement.

   from 6. Discussion

3. The magic accounting assumes independent single-qubit injections; correlated injections (e.g., multi-qubit magic states with subadditive $M_2$) would change $m_{\min}$.

   from 6. Discussion

Where to read

1. Abstract180 words · 1 min
2. 1. Introduction426 words · 2 min
3. 2. Background and Related Work620 words · 3 min
4. 3. Methods310 words · 1 min
5. 4. Analysis850 words · 4 min
6. 5. Results258 words · 1 min
7. 6. Discussion640 words · 3 min
8. 7. Conclusion96 words · 1 min