Repetition Code Revisited


Fisher, M. (2024). Repetition Code Revisited. Perimeter Institute. https://pirsa.org/24050027


Fisher, Matthew. Repetition Code Revisited. Perimeter Institute, May. 27, 2024, https://pirsa.org/24050027


          @misc{ pirsa_PIRSA:24050027,
            doi = {10.48660/24050027},
            url = {https://pirsa.org/24050027},
            author = {Fisher, Matthew},
            keywords = {Quantum Information},
            language = {en},
            title = {Repetition Code Revisited},
            publisher = {Perimeter Institute},
            year = {2024},
            month = {may},
            note = {PIRSA:24050027 see, \url{https://pirsa.org}}

Matthew Fisher University of California, Santa Barbara


"Optimal fault tolerant error correction thresholds for CCS codes are traditionally obtained via mappings to classical statistical mechanics models, for example the 2d random bond Ising model for the 1d repetition code subject to bit-flip noise and faulty measurements. Here, we revisit the 1d repetition code, and develop an exact “stabilizer expansion” of the full time evolving density matrix under repeated rounds of (incoherent and coherent) noise and faulty stabilizer measurements. This expansion enables computation of the coherent information, indicating whether encoded information is retained under the noisy dynamics, and generates a dual representation of the (replicated) 2d random bond Ising model. However, in the fully generic case with both coherent noise and weak measurements, the stabilizer expansion breaks down (as does the canonical 2d random bond Ising model mapping). If the measurement results are thrown away all encoded information is lost at long times, but the evolution towards the trivial steady state reveals a signature of a quantum transition between an over and under damped regime. Implications for generic noisy dynamics in other CCS codes will be mentioned, including open issues."