Graded Quantum Codes: From Weighted Algebraic Geometry to Homological Chain Complexes

• URL: http://arxiv.org/abs/2508.07542v1
• Date: Mon, 11 Aug 2025 01:44:51 GMT
• Title: Graded Quantum Codes: From Weighted Algebraic Geometry to Homological Chain Complexes
• Authors: Tony Shaska,
• Abstract summary: We introduce graded quantum codes, unifying two classes of quantum error-correcting codes.<n> Applications include post-quantum cryptography, fault-tolerant quantum computing, and optimization via graded neural networks.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce graded quantum codes, unifying two classes of quantum error-correcting codes. The first, quantum weighted algebraic geometry (AG) codes, derives from rational points on hypersurfaces in weighted projective spaces over finite fields. This extends classical AG codes by adding weighted degrees and singularities, enabling self-orthogonal codes via the CSS method with improved distances using algebraic structures and invariants like weighted heights.The second class arises from chain complexes of graded vector spaces, generalizing homological quantum codes to include torsion and multiple gradings. This produces low-density parity-check codes with parameters based on homology ranks, including examples from knot invariants and quantum rotors. A shared grading leads to a refined Singleton bound: $d \leq \frac{n - k + 2}{2} - \frac{\epsilon}{2}$, where $\epsilon > 0$ reflects entropy adjustments from geometric singularities and defects. The bound holds partially for simple orbifolds and is supported by examples over small fields. Applications include post-quantum cryptography, fault-tolerant quantum computing, and optimization via graded neural networks, linking algebraic geometry, homological algebra, and quantum information.

Related papers

• The Structure and Interpretation of Quantum Programs I: Foundations [0.0]
  Qubits are a great way to build a quantum computer, but a limited way to program one.<n>We replace the usual "states and gates" formalism with a "props and ops" (propositions and operators) model.<n>We show how measurement modifies state, proving an operator-algebraic version of the Knill-Laflamme conditions.
  arXiv  Detail & Related papers  (2025-09-03T18:00:23Z)
• Homology, Hopf Algebras and Quantum Code Surgery [55.2480439325792]
  We study quantum error-correction codes from an algebraic perspective.<n>We derive new methods of performing fault-tolerant quantum computation.<n>At its core, this thesis asks: what is lattice surgery?
  arXiv  Detail & Related papers  (2025-08-02T21:38:33Z)
• Lie groups for quantum complexity and barren plateau theory [0.0]
  We introduce the theory of Lie groups and their algebras to analyze two fundamental problems in quantum computing.<n> Firstly, we describe the geometric formulation of quantum computational complexity.<n> Secondly, we deal with the barren plateau phenomenon in Variational Quantum Algorithms.
  arXiv  Detail & Related papers  (2025-07-30T11:46:09Z)
• Two-Dimensional Bialgebras and Quantum Groups: Algebraic Structures and Tensor Network Realizations [0.0]
  We introduce a framework to define coalgebra and bialgebra structures on two-dimensional (2D) square lattices.<n>We show how tensor network states, particularly PEPS, naturally induce 2D coalgebra structures when supplemented with appropriate boundary conditions.<n>Our results establish a local and algebraically consistent method to embed quantum group symmetries into higher-dimensional lattice systems.
  arXiv  Detail & Related papers  (2025-07-30T10:13:11Z)
• Preparing Code States via Seed-Entangler-Enriched Sequential Quantum Circuits: Application to Tetra-Digit Topological Error-Correcting Codes [10.829837447593139]
  We introduce a unified and efficient quantum circuit framework to prepare quantum states in code space of topological error-correcting codes.<n>We apply SEESQC to prepare code states of Tetra-Digit models -- a broad class of long-range entangled stabilizer codes.<n>Central to this framework is the emphseed-entangler acting on a small number of qubits termed textitseeds, enabling a systematic scheme to achieve arbitrary code states.
  arXiv  Detail & Related papers  (2025-03-07T12:32:13Z)
• From Entanglement to Universality: A Multiparticle Spacetime Algebra Approach to Quantum Computational Gates Revisited [0.0]
  We focus on testing the usefulness of geometric algebras (GAs) techniques in two applications to quantum computing. First, we offer an explicit algebraic characterization of one- and two-qubit quantum states together with a MSTA description of one- and two-qubit quantum computational gates. In this first application, we devote special attention to the concept of entanglement, focusing on entangled quantum states and two-qubit entangling quantum gates.
  arXiv  Detail & Related papers  (2024-05-13T19:51:26Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• Holographic Codes from Hyperinvariant Tensor Networks [70.31754291849292]
  We show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states.
  arXiv  Detail & Related papers  (2023-04-05T20:28:04Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Quantum double aspects of surface code models [77.34726150561087]
  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry. We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
  arXiv  Detail & Related papers  (2021-06-25T17:03:38Z)
• A refinement of Reznick's Positivstellensatz with applications to quantum information theory [72.8349503901712]
  In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares. Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
  arXiv  Detail & Related papers  (2019-09-04T11:46: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.