Mixed-register Stabilizer Codes: A Coding-theoretic Perspective
- URL: http://arxiv.org/abs/2603.28459v1
- Date: Mon, 30 Mar 2026 14:01:22 GMT
- Title: Mixed-register Stabilizer Codes: A Coding-theoretic Perspective
- Abstract summary: This work considers coding-theoretic constraints on devices constructed from locations which may vary in their local structures.<n>We construct coding-theoretically optimal mixed-register stabilizer codes from sets of codes defined on coprime local-dimensions.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Protecting information in systems that have more than two basis states (qudits) not only offers a promising route for reducing the number of individual quantum locations that must be protected, while more accurately reflecting the structure of realistic quantum hardware, but also has some possibly enticing foundational strengths. While work in the past has largely focused on protecting information in quantum devices with locations that are some consistent local structure, this work considers coding-theoretic constraints on devices constructed from locations which may vary in their local structures -- these are mixed-register quantum devices. In this work we provide some general results for mixed-register Pauli operators, then identify some stabilizer encoded information forms that are forbidden. Building on these insights, we construct coding-theoretically optimal mixed-register stabilizer codes from sets of codes defined on coprime local-dimensions. The construction of such codes results in codes with logical subspaces that do not directly correspond to any of the constituent local-dimensions.
Related papers
- LEAD: A Local Ensemble-Assisted Parallel Decoding Framework for Quantum Tanner Codes [2.9323930362455974]
Quantum Tanner codes are a family of quantum error-correcting codes characterized by favorable performance characteristics.<n>This work introduces LEAD (Local Ensemble-Assisted Decoder), a iteration structure-aware decoding framework tailored for quantum Tanner codes.
arXiv Detail & Related papers (2026-05-18T03:20:14Z) - Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions [45.88028371034407]
Block encoding provides the standard method for accessing matrix data within quantum circuits.<n>We present a unified framework for efficiently block encoding finite-difference discretizations of the Laplacian.
arXiv Detail & Related papers (2026-03-12T19:35:16Z) - A Unitary Encoder for Surface Codes [0.0]
We propose a new non-local unitary circuit to encode a surface code state based on a code conversion between rotated and regular surface codes.<n>Our encoder provides practical advantage in platforms where non-local interactions are available such as neutral atoms and trapped ions.
arXiv Detail & Related papers (2025-06-04T15:45:03Z) - Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels [49.126395046088014]
This work shows that the existence of a DI code in the quantum setting follows from a suitable packing in a modified space of output quantum states.<n>This result enables us to tighten the capacity lower bound for DI over quantum channels beyond the simultaneous decoding approach.
arXiv Detail & Related papers (2025-04-29T17:57:36Z) - Device-independent secure correlations in sequential quantum scenarios [44.99833362998488]
Device-independent quantum information is attracting significant attention, particularly for its applications in information security.<n>We propose a systematic approach to designing sequential quantum protocols for device-independent security.<n>We analytically prove that, with this systematic construction, the resulting ideal correlations are secure in the sense that they cannot be reproduced as a statistical mixture of other correlations.
arXiv Detail & Related papers (2025-03-18T16:45:20Z) - Beyond Integral-Domain Stabilizer Codes [0.0]
Quantum error-correcting codes aim to protect information in quantum systems to enable fault-tolerant quantum computations.<n>This work lays out central methods for working with composite dimensional systems, enabling full use of the computational space of some systems.
arXiv Detail & Related papers (2025-01-08T23:58:13Z) - 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) - Efficient Verification of Stabilizer Code Subspaces with Local Measurements [14.494830101269677]
We present two efficient verification strategies for general stabilizer code subspaces.<n>New strategies require significantly fewer measurement settings and consume fewer state copies.<n>This work contributes to the first systematic study of efficient verification of stabilizer code subspaces with local measurements.
arXiv Detail & Related papers (2024-09-29T13:16:12Z) - Modular decoding: parallelizable real-time decoding for quantum
computers [55.41644538483948]
Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware.
We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy.
We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
arXiv Detail & Related papers (2023-03-08T19:26:10Z) - Degenerate Local-dimension-invariant Stabilizer Codes and an Alternative
Bound for the Distance Preservation Condition [0.0]
We show that degenerate stabilizer codes can have their distance promised upon sufficiently large local-dimension.
New bound on the local-dimension required to preserve the distance of local-dimension-invariant codes could be useful for error-corrected qudit quantum computers.
arXiv Detail & Related papers (2021-10-28T16:36:04Z) - Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs.
Super-Quantum Encoders [67.12391801199688]
We investigate dense coding by imposing various locality restrictions to our decoder.
In this task, the sender Alice and the receiver Bob share an entangled state.
arXiv Detail & Related papers (2021-09-26T07:29:54Z)
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.