Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes

• URL: http://arxiv.org/abs/2410.11942v2
• Date: Sun, 17 Nov 2024 05:48:33 GMT
• Title: Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes
• Authors: Zijian Liang, Bowen Yang, Joseph T. Iosue, Yu-An Chen,
• Abstract summary: We present a computational algorithm for constructing all boundaries and defects of topological generalized Pauli stabilizer codes in two dimensions. We have applied the algorithm and explicitly demonstrated the lattice constructions of 2 boundaries and 6 defects in the $Z$ toric code, 3 boundaries and 22 defects in the $Z_4$ toric code, 6 boundaries and 270 defects in the color code, and 6 defects in the anomalous three-fermion code.
• Score: 10.89369561264161
• License:
• Abstract: In this paper, we present a computational algorithm for constructing all boundaries and defects of topological generalized Pauli stabilizer codes in two spatial dimensions. Utilizing the operator algebra formalism, we establish a one-to-one correspondence between the topological data-such as anyon types, fusion rules, topological spins, and braiding statistics-of (2+1)D bulk stabilizer codes and (1+1)D boundary anomalous subsystem codes. To make the operator algebra computationally accessible, we adapt Laurent polynomials and convert the tasks into matrix operations, e.g., the Hermite normal form for obtaining boundary anyons and the Smith normal form for determining fusion rules. This approach enables computers to automatically generate all possible gapped boundaries and defects for topological Pauli stabilizer codes through boundary anyon condensation and topological order completion. This streamlines the analysis of surface codes and associated logical operations for fault-tolerant quantum computation. Our algorithm applies to $Z_d$ qudits, including both prime and nonprime $d$, thus enabling the exploration of topological quantum codes beyond toric codes. We have applied the algorithm and explicitly demonstrated the lattice constructions of 2 boundaries and 6 defects in the $Z_2$ toric code, 3 boundaries and 22 defects in the $Z_4$ toric code, 1 boundary and 2 defects in the double semion code, 1 boundary and 22 defects in the six-semion code, 6 boundaries and 270 defects in the color code, and 6 defects in the anomalous three-fermion code. In addition, we investigate the boundaries of two specific bivariate bicycle codes within a family of low-density parity-check (LDPC) codes. We demonstrate that their topological orders are equivalent to 8 and 10 copies of $Z_2$ toric codes, with anyons restricted to move by 12 and 1023 lattice sites in the square lattice, respectively.

Related papers

• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• Genons, Double Covers and Fault-tolerant Clifford Gates [2.5866180357107242]
  We show a construction that produces symplectic double code with naturally occurring fault-tolerant logical Clifford gates. We demonstrate this experimentally on Quantinuum's H1-1 trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2024-06-14T11:57:51Z)
• Extracting topological orders of generalized Pauli stabilizer codes in two dimensions [5.593891873998947]
  We introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems. The algorithm applies to $mathbbZ_d$ qudits, including instances where $d$ is a nonprime number.
  arXiv  Detail & Related papers  (2023-12-18T13:18:19Z)
• Layer Codes [0.0]
  In three dimensions an analogous simple yet optimal code was not previously known. The output codes have the special structure of being topological defect networks formed by layers of surface code joined along one-dimensional junctions.
  arXiv  Detail & Related papers  (2023-09-28T15:11:37Z)
• Pauli topological subsystem codes from Abelian anyon theories [2.410842777583321]
  We construct Pauli topological subsystem codes characterized by arbitrary two-dimensional Abelian anyon theories. Our work both extends the classification of two-dimensional Pauli topological subsystem codes to systems of composite-dimensional qudits.
  arXiv  Detail & Related papers  (2022-11-07T19:00:01Z)
• Error-correcting codes for fermionic quantum simulation [4.199246521960609]
  We present methodologies for fermions via qubit systems on a two-dimensional lattice algorithm. We identify a family of stabilizer codes suitable for fermion simulation. Our method can increase the code distances without decreasing the (fermionic) code rate.
  arXiv  Detail & Related papers  (2022-10-16T01:43:07Z)
• Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies [68.93512627479197]
  We study quantum Ordered Binary Decision Diagrams($OBDD$) model. We prove lower bounds and upper bounds for OBDD with arbitrary order of input variables. We extend hierarchy for read$k$-times Ordered Binary Decision Diagrams ($k$-OBDD$) of width.
  arXiv  Detail & Related papers  (2022-04-22T12:37:56Z)
• Quantum Error Correction with Gauge Symmetries [69.02115180674885]
  Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors. We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
  arXiv  Detail & Related papers  (2021-12-09T19:29:34Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• Radiative topological biphoton states in modulated qubit arrays [105.54048699217668]
  We study topological properties of bound pairs of photons in spatially-modulated qubit arrays coupled to a waveguide. For open boundary condition, we find exotic topological bound-pair edge states with radiative losses. By joining two structures with different spatial modulations, we find long-lived interface states which may have applications in storage and quantum information processing.
  arXiv  Detail & Related papers  (2020-02-24T04:44:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.