PIRSA:12030109

Demonstration of Self-correcting Quantum Memory in Three Dimensions

APA

Haah, J. (2012). Demonstration of Self-correcting Quantum Memory in Three Dimensions. Perimeter Institute. https://pirsa.org/12030109

MLA

Haah, Jeongwan. Demonstration of Self-correcting Quantum Memory in Three Dimensions. Perimeter Institute, Mar. 07, 2012, https://pirsa.org/12030109

BibTex

          @misc{ pirsa_PIRSA:12030109,
            doi = {10.48660/12030109},
            url = {https://pirsa.org/12030109},
            author = {Haah, Jeongwan},
            keywords = {Quantum Information},
            language = {en},
            title = {Demonstration of Self-correcting Quantum Memory in Three Dimensions},
            publisher = {Perimeter Institute},
            year = {2012},
            month = {mar},
            note = {PIRSA:12030109 see, \url{https://pirsa.org}}
          }
          

Jeongwan Haah Massachusetts Institute of Technology (MIT) - Department of Physics

Abstract

Based on the joint work with Sergey Bravyi, IBM Watson.   We show that any topologically ordered local stabilizer model of spins in three dimensional lattices that lacks string logical operators can be used as a reliable quantum memory against thermal noise. It is shown that any local process creating a topologically charged particle separated from other particles by distance $R$, must cross an energy barrier of height $c \log R$. This property makes the model glassy. We devise an efficient decoding algorithm that should be used at the final read-out, and prove a lower bound on the memory time until which the fidelity between the outcome of the decoder and the initial state is close to 1. The memory time increases as $L^{\beta}$ where $L$ is the system size and $\beta$ the inverse temperature, as long as $L < L^\star \sim e^\beta$. Hence, the optimal memory time scales as $e^{\beta^2}$. Our bound applies when the system interacts with thermal bath via a Markovian master equation. We give an example of 3D local stabilizer codes that satisfies all of our assumptions. We numerically verify for this example that our bound is tight up to constants.