Free-Fermion Subsystem Codes
Adrian Chapman, Steven T. Flammia, Alicia J. Koll\'ar

TL;DR
This paper introduces a class of quantum error-correcting subsystem codes with exactly solvable free-fermion models, providing new methods for embedding frustration graphs and analyzing spectral gaps.
Contribution
It presents the first exactly solvable 2D spin model with free-fermion description and topological qubits, along with algorithms for determining model solvability.
Findings
Explicit construction of a free-fermionized 2D Bacon-Shor code
Efficient algorithm for checking translation-invariant spin model solvability
Identification of spectral gap properties related to graph-theoretic quantities
Abstract
We consider quantum error-correcting subsystem codes whose gauge generators realize a translation-invariant, free-fermion-solvable spin model. In this setting, errors are suppressed by a Hamiltonian whose terms are the gauge generators of the code and whose exact spectrum and eigenstates can be found via a generalized Jordan-Wigner transformation. Such solutions are characterized by the frustration graph of the Hamiltonian: the graph whose vertices are Hamiltonian terms, which are neighboring if the terms anticommute. We provide methods for embedding a given frustration graph in the anticommutation relations of a spin model and present the first known example of an exactly solvable spin model with a two-dimensional free-fermion description and exact topological qubits. This model can be viewed as a free-fermionized version of the two-dimensional Bacon-Shor code. Using graph-theoretic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
