Towards local testability for quantum coding

          @misc{ scivideos_PIRSA:19110133,
            doi = {10.48660/19110133},
            url = {https://pirsa.org/19110133},
            author = {Leverrier, Anthony},
            keywords = {Quantum Information},
            language = {en},
            title = {Towards local testability for quantum coding },
            publisher = {Perimeter Institute for Theoretical Physics},
            year = {2019},
            month = {nov},
            note = {PIRSA:19110133 see, \url{https://scivideos.org/pirsa/19110133}}
          }
          

Abstract

We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the p-faces of the n-cube (for n>p) and stabilizer constraints with faces of dimension (p±1). The quantum code obtained by identifying antipodal faces of the resulting complex encodes one logical qubit into N=2n−p−1(np) physical qubits and displays local testability with a soundness of Ω(log−2(N)) beating the current state-of-the-art of log−3(N) due to Hastings. We exploit this local testability to devise an efficient decoding algorithm that corrects arbitrary errors of size less than the minimum distance, up to polylog factors. We then extend this code family by considering the quotient of the n-cube by arbitrary linear classical codes of length n. We establish the parameters of these generalized hemicubic codes. Interestingly, if the soundness of the hemicubic code could be shown to be 1/log(N), similarly to the ordinary n-cube, then the generalized hemicubic codes could yield quantum locally testable codes of length not exceeding an exponential or even polynomial function of the code dimension. (joint work with Vivien Londe and Gilles Zémor)