Quantum Lego and XP Stabilizer Codes
Open Access
- 6 October 2025
- journal article
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1876
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 Pauli stabilizer code with a fault-tolerant 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.
Keywords
All Related Versions
Funding Information
- Airforce Office of Scientific Research (FA9550-19-1-0360)
- National Science Foundation (PHY-1733907)
This publication has 40 references indexed in Scilit:
- Non-trivial area operators require non-local magicJournal of High Energy Physics, 2024
- Optimization of tensor network codes with reinforcement learningNew Journal of Physics, 2024
- Local tensor-network codesNew Journal of Physics, 2022
- A non-commuting stabilizer formalismJournal of Mathematical Physics, 2015
- Standard form of qudit stabilizer groupsPhysics Letters A, 2014
- Interacting quantum observables: categorical algebra and diagrammaticsNew Journal of Physics, 2011
- Fault-tolerant quantum computation by anyonsAnnals of Physics, 2003
- Fast Algorithms for Linear Algebra Modulo N1998
- Completely positive linear maps on complex matricesLinear Algebra and its Applications, 1975
- Linear transformations which preserve trace and positive semidefiniteness of operatorsReports on Mathematical Physics, 1972