Quantum Lego and XP Stabilizer Codes

Abstract

We apply the recent graphical framework of "Quantum Lego" to XP stabilizer codes where the stabilizer group is generally non-Abelian. We show that the idea of operator matching continues to hold for such codes and is sufficient for generating all their XP symmetries provided the resulting code is XP. We provide an efficient classical algorithm for tracking these symmetries under tensor contraction or conjoining. This constitutes a partial extension of the algorithm implied by the Gottesman-Knill theorem beyond Pauli stabilizer states and Clifford operations. Because conjoining transformations generate quantum operations that are universal, the XP symmetries obtained from these algorithms do not uniquely identify the resulting tensors in general. Using this extended framework, we provide examples of novel XP stabilizer codes with a higher distance than existing non-trivial XP regular codes and a $[[8,1,2]]$ Pauli stabilizer code with a fault-tolerant $T$ gate. For XP regular codes, we also construct a tensor-network-based maximum likelihood decoder for any independently and identically distributed single qubit error channel using weight enumerators.

26 pages, 10 figures

References in corpus (24)

• Improved Simulation of Stabilizer Circuits
• String-net condensation: A physical mechanism for topological phases
• Instantaneous non-local computation of low T-depth quantum circuits
• Interacting Quantum Observables: Categorical Algebra and Diagrammatics
• Tensor-entanglement renormalization group approach to 2D quantum systems
• Quantum memories at finite temperature
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Explicit tensor network representation for the ground states of string-net models
• Hierarchy of topological order from finite-depth unitaries, measurement and feedforward
• Codeword Stabilized Quantum Codes
• Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates
• Standard Form of Qudit Stabilizer Groups
• Calderbank-Steane-Shor Holographic Quantum Error Correcting Codes
• Decoding non-Abelian topological quantum memories
• Programmable networks for quantum algorithms
• Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks
• A Non-Commuting Stabilizer Formalism
• Tensor-network codes
• General tensor network decoding of 2D Pauli codes
• Graphical Structures for Design and Verification of Quantum Error Correction
• Classification of Small Triorthogonal Codes
• Local tensor-network codes
• Discovery of Optimal Quantum Error Correcting Codes via Reinforcement Learning
• The Smallest Code with Transversal T

Cited by in corpus (1)

• Biased-Noise Thresholds of Zero-Rate Holographic Codes with Tensor-Network Decoding