Quantum group codes for non-Clifford logic: enhanced decoding, addressability and parallelizability

• URL: http://arxiv.org/abs/2606.27211v1
• Date: Thu, 25 Jun 2026 16:03:59 GMT
• Title: Quantum group codes for non-Clifford logic: enhanced decoding, addressability and parallelizability
• Abstract summary: We introduce a framework based on classical quasi group codes to define a class of quantum CSS codes.<n>We use a lifting procedure of classical AG codes established from class field theory to construct good quantum group codes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a framework based on classical quasi group codes to define a class of quantum CSS codes, called quantum group codes, supporting transversal multi-control-$Z$ gates which are both addressable and parallelizable, thus allowing to efficiently implement circuits composed of non-Clifford gates at the logical level. Building on this, we use a lifting procedure of classical AG codes established from class field theory to construct good quantum group codes with improved decoding complexity and logical multi-control-$Z$ gate parallelizability. More precisely, on input a good quantum AG code over the alphabet $\mathbb F_q$ with transversal $\mathsf{C}^m\mathsf Z$ gate, we apply this lifting procedure to its underlying classical AG code and obtain a quantum group code over the alphabet $\mathbb F_{q^2}$ supporting a transversal $\mathsf{C}^m\mathsf Z$ gate as well as addressable and parallelizable $\mathsf{C}^{m-1}\mathsf Z$ gates. In addition, this quantum code admits a quasi-quadratic time decoder with a linear decoding radius. This is to be compared with the previous quantum AG codes which have a cubic-time decoder. Hence, our work implies a decrease of the time complexity of state-of-the-art magic-state distillation protocols by an almost linear factor.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• Poincaré Duality and Multiplicative Structures on Quantum Codes [11.11194917284133]
  We build circuits composed of $mathrmCmathrmCZ$ gates as well as for higher order controlled-$Z$ gates.<n>We conjecture that they generate nontrivial logical actions, pointing towards fault-tolerant non-Clifford gates on nearly optimal qLDPC sheaf codes.
  arXiv  Detail & Related papers  (2025-12-26T08:38:08Z)
• Good quantum codes with addressable and parallelizable non-Clifford gates [5.076419064097734]
  We revisit a family of good quantum error-correcting codes presented in He $textitet al.$ (2025)<n>We show that various sets of addressable and non-Clifford multi-control-$Z$ gates can be performed in parallel.
  arXiv  Detail & Related papers  (2025-10-22T17:47:03Z)
• Classifying Logical Gates in Quantum Codes via Cohomology Operations and Symmetry [0.0]
  We construct and classify fault-tolerant logical gates implemented by constant-depth circuits for quantum codes.<n>We present a formalism for addressable and parallel logical gates in LDPC codes viasymmetries.<n>As a byproduct, we find new topological responses of finite higher-form symmetries using higher Pontryagin powers.
  arXiv  Detail & Related papers  (2024-11-24T14:01:37Z)
• 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)
• Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates [23.22566380210149]
  We construct quantum codes that support $CCZ$ gates over qudits of arbitrary prime power dimension $q$. The only previously known construction with such linear dimension and distance required a growing alphabet size $q$.
  arXiv  Detail & Related papers  (2024-08-17T16:54:51Z)
• Non-Clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum LDPC codes via higher symmetries [1.643885885988614]
  We study fault-tolerant quantum computing for families of homological quantum low-density parity-check codes defined on 3-manifolds with constant or almost-constant encoding rate.<n>We have developed a generic formalism to compute the triple intersection invariants for 3-manifolds.
  arXiv  Detail & Related papers  (2023-10-25T20:33:59Z)
• Homological Quantum Rotor Codes: Logical Qubits from Torsion [47.52324012811181]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.<n>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)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.