2010/09/11 by Gregory M. Crosswhite, Dave Bacon
Computer Science · Physics and Astronomy · #Computer science #Physics #Programming language #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum mechanics #quant-ph
paper · pdf · doi:10.1103/physreva.83.022307
38 pages, 15 figure, 10 tables. The algorithm described in this paper is available as both library and a command line program (including full source code) that can be downloaded from http://github.com/gcross/CodeQuest/downloads. The source code used to apply the algorithm to scan the lattices is available upon request. Please feel free to contact the authors with questions
arxiv created 2010/09/11 · openalex publication_date 2011/02/10 · arxiv updated 2013/05/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Quantum error correction allows for faulty quantum systems to behave in an effectively error-free manner. One important class of techniques for quantum error correction is the class of quantum subsystem codes, which are relevant both to active quantum error-correcting schemes as well as to the design of self-correcting quantum memories. Previous approaches for investigating these codes have focused on applying theoretical analysis to look for interesting codes and to investigate their properties. In this paper we present an alternative approach that uses computational analysis to accomplish the same goals. Specifically, we present an algorithm that computes the optimal quantum subsystem code that can be implemented given an arbitrary set of measurement operators that are tensor products of Pauli operators. We then demonstrate the utility of this algorithm by performing a systematic investigation of the quantum subsystem codes that exist in the setting where the interactions are limited to two-body interactions between neighbors on lattices derived from the convex uniform tilings of the plane.