arXiv:2611.00404
Early Fault-Tolerant Magic State Synthesis and Spacetime Efficient Analog Rotations with Color Code on a Superconducting Quantum Processor
Sean Garner, Aaron Hoyt, Shuwen Kan, Samuel Stein, Chenxu Liu, Ang Li
Abstract
With recent improvements to syndrome extraction scheduling and decoding, and the availability of complete transversal Clifford operations and lattice surgery, color code is an especially promising platform for quantum processors with local connectivity. The key ingredient for universal computation is thus generating useful magic states with limited resources. Space-Time Efficient Analog Rotations (STAR) and Fault-tolerant magic state synthesis (MSS) are two such methods for magic state generation, targeted for near-term and long-term quantum computing, respectively. In this work, we perform the first implementations of both magic state paradigms on a superconducting quantum processor. We present a STAR-type injection protocol on the color code, with favorable error rate and spacetime costs versus prior protocols on both the color and surface codes. We then implement a MSS factory by performing multi-patch magic state cultivations, interleaved with transversal Clifford operations, and lattice-surgery magic state teleportation. Under post-selection, we achieve a kickback tomography correct sign probability of $99.9859\%$ on cultivated $T_L$ states, $96\%$ tomographic fidelity on logical analog rotation states, and $91\%$ fidelity on synthesized logical magic states consuming 3 cultivated $T_L$ states, 3 transversal Hadamard operations, and real-time feed-forward $S_L$ corrections during magic state teleportation. We compare the efficacy of post-selection, Most-Likely-Error (MLE) decoding, and concatenated-matching decoding throughout, highlighting the potential of end-to-end color code computation.
AI Summary
The paper investigates two routes to non-Clifford operations on locally connected color-code hardware: direct analog-state injection for partially fault-tolerant computation, and synthesis using cultivated $T$ states, transversal Clifford gates, and lattice-surgery teleportation. It develops a local $R_{ZZ}(\theta)$ injection protocol using an intermediate $[[4,1,1,2]]$ subsystem code, color-code projection, and flagging. Fault analysis gives conditional preparation error $P_L=p/15+O(p^2)$ under uniform circuit-level depolarizing noise, with the sole harmful first-order fault being $ZZ$ at the injection gate. Simulations compare injection error and resource costs with previous color- and surface-code protocols. Experiments on a superconducting processor use distance-three color-code patches. Across an angle sweep, flagged analog injection achieves 4.98% mean tomographic infidelity at 62.0% acceptance; unitary injection achieves 4.80% at 69.7%. Cultivation followed by repeated, postselected kickback analysis yields 10 wrong signs among 71,060 accepted shots: error $1.41\times10^{-4}$ at 14.21% acceptance. Consuming a cultivated resource through teleportation with real-time corrections gives 1.93% kickback error at 1.33% acceptance. Three cultivated resources and intervening Hadamards produce $THTHT|+\rangle_L$ with 90.98% tomographic fidelity and 0.93% acceptance using real-time corrections. Calibration-based simulations and logical process tomography assess noise contributions and offline decoding. The experiments do not demonstrate distance scaling or real-time decoding. Kickback characterization includes additional selection and weight-two analyzer failure mechanisms; its conservative interpretation is supported by tested noise models, not a model-independent guarantee. The baseline stochastic model omits leakage and coherent errors, and larger factories require code growth and potentially further distillation.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.