arXiv:2610.38554
Coherent errors, syndrome extraction and the Robustness of Magic in stabiliser codes
Enrico Bozzetto, Jonte R. Hance
Abstract
Coherent errors leave stabiliser-code-encoded magic states in superpositions of syndrome sectors. We ask how much magic these coherent errors add, and whether syndrome extraction depletes logical magic. Using Robustness of Magic, we show that, for a unitary error U on a correctable region which supports no stabiliser, the encoded state has the same robustness as the logical state plus one copy of the Choi state of U , in every stabiliser code encoding. Syndrome extraction removes this copy, returning the logical robustness. The removed magic is positive for every non-Clifford error: adding a non-stabiliser state to any state multiplies one plus the robustness by a (tightly- bounded) factor above one. The magic capacity of two-qubit gates Clifford-equivalent to diagonal or single-qubit gates is equal to their Choi-state robustness. We give a linear-algebraic test for when a Clifford error makes syndrome extraction measure a logical operator, and give magic lifetimes of stored single-qubit magic states under Pauli noise. Choosing the plane of the stored state extends these lifetimes about 1.5x on rotated surface codes under low code-capacity depolarising noise. We identify states and channels in odd-prime dimension for which Wigner negativity and robustness show equal lifetimes.
AI Summary
The paper asks how coherent errors change the Robustness of Magic of encoded states, and whether syndrome extraction removes logical magic or only magic introduced by the error. For any stabiliser code, syndrome dephasing has robustness equal to the syndrome-weighted robustness of the decoded logical states. The main result concerns a unitary $U$ supported on an erasure-correctable region containing no nonidentity stabiliser: the noisy encoded state is Clifford-equivalent to the logical state tensored with the error’s Choi state $J_U$. Consequently, its robustness is $\mathcal R(J_U\otimes\rho_L)$, while syndrome extraction returns exactly $\mathcal R(\rho_L)$. A Bell-pair normal form establishes this factorisation. A separate linear-programming bound, $\mathcal R(\sigma\otimes\rho)+1\ge\mu(\sigma)[\mathcal R(\rho)+1]$, with $\mu(\sigma)>1$ for every non-stabiliser mixture, proves that every non-Clifford error removes a strictly positive excess. Further results establish equality between magic capacity and Choi-state robustness for all single-qubit unitaries and two-qubit unitaries Clifford-equivalent to diagonal or single-qubit gates. A binary-linear criterion detects when Clifford errors make syndrome extraction measure logical operators. Under low code-capacity depolarising noise, choosing the storage plane of a surface-code magic state gives an asymptotic lifetime ratio of approximately $1.47$. Odd-prime-dimensional results identify states and noise channels with coincident robustness and Wigner-negativity lifetimes. Syndrome extraction is assumed ideal. General errors on regions supporting logical operators are not covered by the factorisation theorem; several capacity equalities remain open, and the storage-plane gain has not been established under circuit-level noise.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.