Extracting topological orders of generalized Pauli stabilizer codes in two dimensions

• URL: http://arxiv.org/abs/2312.11170v3
• Date: Sat, 24 Aug 2024 15:34:20 GMT
• Title: Extracting topological orders of generalized Pauli stabilizer codes in two dimensions
• Authors: Zijian Liang, Yijia Xu, Joseph T. Iosue, Yu-An Chen,
• Abstract summary: 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.
• Score: 5.593891873998947
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems, focusing on the analysis of anyon excitations and string operators. The algorithm applies to $\mathbb{Z}_d$ qudits, including instances where $d$ is a nonprime number. This capability allows the identification of topological orders that differ from the $\mathbb{Z}_d$ toric codes. It extends our understanding beyond the established theorem that Pauli stabilizer codes for $\mathbb{Z}_p$ qudits (with $p$ being a prime) are equivalent to finite copies of $\mathbb{Z}_p$ toric codes and trivial stabilizers. The algorithm is designed to determine all anyons and their string operators, enabling the computation of their fusion rules, topological spins, and braiding statistics. The method converts the identification of topological orders into computational tasks, including Gaussian elimination, the Hermite normal form, and the Smith normal form of truncated Laurent polynomials. Furthermore, the algorithm provides a systematic approach for studying quantum error-correcting codes. We apply it to various codes, such as self-dual CSS quantum codes modified from the 2d honeycomb color code and non-CSS quantum codes that contain the double semion topological order or the six-semion topological order.

Related papers

• Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes [10.89369561264161]
  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.
  arXiv  Detail & Related papers  (2024-10-15T18:00:00Z)
• 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)
• Qudit-based quantum error-correcting codes from irreducible representations of SU(d) [0.0]
  Qudits naturally correspond to multi-level quantum systems, but their reliability is contingent upon quantum error correction capabilities. We present a general procedure for constructing error-correcting qudit codes through the irreducible representations of $mathrmSU(d)$ for any odd integer $d geq 3.$ We use our procedure to construct an infinite class of error-correcting codes encoding a logical qudit into $(d-1)2$ physical qudits.
  arXiv  Detail & Related papers  (2024-10-03T11:35:57Z)
• Homological Quantum Rotor Codes: Logical Qubits from Torsion [51.9157257936691]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code. We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
  arXiv  Detail & Related papers  (2023-03-24T00:29:15Z)
• 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)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• 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)
• Designing the Quantum Channels Induced by Diagonal Gates [0.5735035463793007]
  Diagonal gates play an important role in implementing a universal set of quantum operations. This paper describes the process of preparing a code state, applying a diagonal physical gate, measuring a code syndrome, and applying a Pauli correction.
  arXiv  Detail & Related papers  (2021-09-28T04:39:15Z)
• 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)
• Log-domain decoding of quantum LDPC codes over binary finite fields [4.340338299803562]
  We study the decoding of quantum low-density parity-check (LDPC) codes over binary finite fields GF$(q=2l)$ by the sum-product algorithm, also known as belief propagation (BP) We show that scalar messages suffice for BP decoding of nonbinary quantum codes, rather than vector messages necessary for the conventional BP.
  arXiv  Detail & Related papers  (2021-04-01T07:15:41Z)
• Quantum algorithms for spectral sums [50.045011844765185]
  We propose new quantum algorithms for estimating spectral sums of positive semi-definite (PSD) matrices. We show how the algorithms and techniques used in this work can be applied to three problems in spectral graph theory.
  arXiv  Detail & Related papers  (2020-11-12T16:29:45Z)

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.