Computing with qLDPC Codes by Climbing the Chain Map Hierarchy
- URL: http://arxiv.org/abs/2609.02999v1
- Date: Wed, 02 Sep 2026 18:00:00 GMT
- Title: Computing with qLDPC Codes by Climbing the Chain Map Hierarchy
- Abstract summary: We develop a framework for logical computation with qLDPC codes that places logical Pauli, Clifford, and non-Clifford operations on the same footing.<n>This brings the simple homological description of Pauli logicals to the patchwork landscape of logical Clifford and non-Clifford operations.
- Score: 0.0029410438275861584
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We develop a framework for logical computation with qLDPC codes that places logical Pauli, Clifford, and non-Clifford operations on the same footing. This brings the simple homological description of Pauli logicals to the patchwork landscape of logical Clifford and non-Clifford operations, providing a tool for the discovery of new logical gates. In particular, we define the chain map hierarchy: a family of chain complexes whose homology classes encode logical unitary and code surgery operations at any level of the Clifford hierarchy, precisely analogous to the chain complex description of Pauli logicals. Consequently, intuition for Pauli logicals can be leveraged to discover new logical operations on qLDPC codes. For instance, the familiar ability to deform Pauli logicals with stabilizers---i.e. boundaries of the chain complex---becomes a way to search for constant-depth unitary implementations of (non-)Clifford logical gates. Using this strategy, we discover constant-depth unitary implementations of the full logical Clifford group on any number of blocks of the 2D toric code, including within a single block, and addressable logical CCZ gates on any triple of logical qubits on any number of blocks of the 3D toric code. Beyond manifold codes, we find addressable non-Clifford gates on codes with many encoded qubits. The chain map hierarchy naturally encompasses and extends other constructions of logical gadgets, for instance providing a universal parameterization of cup products. As such, our work provides a unified, useful, and intuitive language for computing with qLDPC codes.
Related papers
- Logical computation with canonical lifted product codes [3.653555716265332]
Code-agnostic techniques such as code surgery and gate teleportation apply broadly, but are difficult to make modular, low-overhead, and fully certifiable on complex high-rate codes.<n>Here we overcome these obstacles by co-designing the code together with its logical instruction set for a broad family of emphcanonical lifted-product (LP) codes.<n>We show that these codes admit a emphcanonical logical basis, in which conjugate logical operators are organized into rows and columns of cyclic orbits inherited directly from the underlying classical codes.
arXiv Detail & Related papers (2026-07-30T17:55:34Z) - Automated logical Clifford gadgets for heterogeneous architectures via chain maps [0.0]
We introduce an automated framework for synthesising inter-code CNOT circuits.<n>We benchmark this method on a range of heterogeneous CSS code pairs.<n>We show how our framework straightforwardly extends to targeted logical CZ gates.
arXiv Detail & Related papers (2026-07-02T17:49:54Z) - No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits [0.0]
We study classes of fault-tolerant gadget constructions consisting of Clifford gates acting on the physical qubits.<n>While stabilizer codes encoding a single logical qubit are known to admit implementations of the full logical Clifford group, no analogous examples are known for codes encoding multiple logical qubits.<n>Since the Clifford group is a core component of universal gate sets, our findings imply that quantum computing with codes encoding multiple logical qubits within a single code block necessarily entails more complex constructions for fault tolerance.
arXiv Detail & Related papers (2026-02-13T19:00:44Z) - Non-Abelian qLDPC: TQFT Formalism, Addressable Gauging Measurement and Application to Magic State Fountain on 2D Product Codes [1.1087735229999818]
We show that native non-Clifford logical gates can be realized using constant-rate 2D hypergraph-product codes and their Clifford-stabilizer variants.<n>This is achieved by a spacetime path integral effectively implementing the addressable gauging measurement of a new type of 0-form subcomplex symmetries.
arXiv Detail & Related papers (2026-01-11T01:20:36Z) - Targeted Clifford logical gates for hypergraph product codes [54.57204856880369]
We first derive symplectic matrices for CNOT, CZ, Phase, and Hadamard operators, which together generate the Clifford group.<n>This enables us to design explicit transformations that result in targeted logical gates for arbitrary codes in this family.
arXiv Detail & Related papers (2024-11-26T02:32:44Z) - 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) - When Do Program-of-Thoughts Work for Reasoning? [51.2699797837818]
We propose complexity-impacted reasoning score (CIRS) to measure correlation between code and reasoning abilities.
Specifically, we use the abstract syntax tree to encode the structural information and calculate logical complexity.
Code will be integrated into the EasyInstruct framework at https://github.com/zjunlp/EasyInstruct.
arXiv Detail & Related papers (2023-08-29T17:22:39Z) - Transversal Diagonal Logical Operators for Stabiliser Codes [0.0]
Pauli group operators can be implemented on quantum error correction codes.
We identify logical operators composed of single and multi-qubit diagonal Clifford hierarchy gates.
We show a method for constructing CSS codes that have a desired diagonal logical Clifford hierarchy operator implemented using single qubit phase gates.
arXiv Detail & Related papers (2023-03-27T21:49:37Z) - Discourse-Aware Graph Networks for Textual Logical Reasoning [142.0097357999134]
Passage-level logical relations represent entailment or contradiction between propositional units (e.g., a concluding sentence)
We propose logic structural-constraint modeling to solve the logical reasoning QA and introduce discourse-aware graph networks (DAGNs)
The networks first construct logic graphs leveraging in-line discourse connectives and generic logic theories, then learn logic representations by end-to-end evolving the logic relations with an edge-reasoning mechanism and updating the graph features.
arXiv Detail & Related papers (2022-07-04T14:38:49Z) - Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions.
We explore novel schemes for universal logic that improve resource overheads.
Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
arXiv Detail & Related papers (2021-12-22T19:00:03Z) - 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)
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.