Free-Fermion Subsystem Codes
arXiv:2201.07254 · doi:10.1103/PRXQuantum.3.030321
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 tools to study the unit cell, we give an efficient algorithm for deciding if a given translation-invariant spin model is solvable, and explicitly construct the solution. Further, we examine the energetics of these exactly solvable models from the graph-theoretic perspective and show that the relevant gaps of the spin model correspond to known graph-theoretic quantities: the skew energy and the median eigenvalue of an oriented graph. Finally, we numerically search for models which have large spectral gaps above the ground state spin configuration and thus exhibit particularly robust thermal suppression of errors. These results suggest that optimal models will have low dimensionality and odd coordination numbers, and that the primary limit to energetic error suppression is the skew energy difference between different symmetry sectors rather than single-particle excitations of the free fermions.
arXiv comment20 pages, 9 figures
References in corpus (30)
- Fault-tolerant quantum computation by anyons
- Anyons in an exactly solved model and beyond
- Unpaired Majorana fermions in quantum wires
- Fermionic quantum computation
- The Bravyi-Kitaev transformation for quantum computation of electronic structure
- Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
- Quantum orders in an exact soluble model
- The Flux-Phase of the Half-Filled Band
- Stabilizer Formalism for Operator Quantum Error Correction
- Classical simulation of noninteracting-fermion quantum circuits
- Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State
- Ultrahigh Error Threshold for Surface Codes with Biased Noise
- Matchgates and classical simulation of quantum circuits
- Mapping local Hamiltonians of fermions to local Hamiltonians of spins
- Tailoring surface codes for highly biased noise
- Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
- Topological Subsystem Codes
- A Compact Fermion to Qubit Mapping
- Lowering qubit requirements for quantum simulations of fermionic systems
- Commuting Pauli Hamiltonians as maps between free modules
- Majorana Fermion Codes
- Exact bosonization in two spatial dimensions and a new class of lattice gauge theories
- Majorana loop stabilizer codes for error correction of fermionic quantum simulations
- Constructions and Noise Threshold of Topological Subsystem Codes
- Free fermions behind the disguise
- Characterization of solvable spin models via graph invariants
- The Power of Noisy Fermionic Quantum Computation
- Geometric Criterion for Solvability of Lattice Spin Systems
- Scalable Fermionic Error Correction in Majorana Surface Codes
- Median eigenvalues of bipartite subcubic graphs