Construction of Quantum Rank-Metric Codes Using Hermitian Orthogonality

• URL: http://arxiv.org/abs/2605.02571v1
• Date: Mon, 04 May 2026 13:24:02 GMT
• Title: Construction of Quantum Rank-Metric Codes Using Hermitian Orthogonality
• Abstract summary: We propose a framework for constructing quantum rank-metric codes from classical linear codes with symplectic self-orthogonality.<n>The proposed method succeeds in approximately doubling the ratio of the minimum rank distance to the number of physical qubits while maintaining the code rate.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Stacked quantum memory is an architecture in which multiple layers of qubits are stacked. Quantum rank-metric codes are effective for error correction in stacked quantum memories. However, the previously proposed quantum Gabidulin codes based on the CSS construction had a problem: due to algebraic constraints, the applicable memory layouts were strictly limited to square shapes of odd length. In this paper, we first propose a framework for constructing quantum rank-metric codes from classical linear codes with symplectic self-orthogonality. Building upon this, we propose a new construction method for quantum Gabidulin codes by combining the Hermitian self-orthogonality of classical Gabidulin codes--utilizing the self-dual basis that exists when the extension degree of the finite field is even--with the quantum code construction method using Hermitian orthogonality by Matsumoto and Uyematsu. The proposed method succeeds in approximately doubling the ratio of the minimum rank distance to the number of physical qubits while maintaining the code rate. Furthermore, it eliminates the restriction of the conventional method that requires the number of cells and layers of the stacked memory to be odd, realizing the construction of quantum rank-metric codes applicable to memories with an even number of cells and layers. This construction improves the relative error correction capability of the stacked quantum memory architecture and increases the degree of freedom in design while preserving the code rate.

Related papers

• Efficient Complex-Valued State Preparation on Bucket Brigade QRAM [47.72095699729477]
  Efficient quantum state preparation is a critical component in quantum algorithms that process large classical data.<n>We present two improvements within the same architecture-aware framework.
  arXiv  Detail & Related papers  (2026-04-28T13:43:29Z)
• 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)
• Quantum Cubature Codes [0.43483238221567877]
  We introduce Quantum Cubature Codes (QCCs), a framework for constructing bosonic codes based on superpositions of coherent states.<n>We show that QCCs can outperform their single-shell counterparts by maximizing geometric separation with optimal energy at fixed pure-loss rate.
  arXiv  Detail & Related papers  (2025-11-28T16:14:54Z)
• Efficient Quantum State Preparation with Bucket Brigade QRAM [47.72095699729477]
  Preparation of data in quantum states is a critical component in the design of quantum algorithms.<n>One of the main approaches to achieve efficient state preparation is through the use of Quantum Random Access Memory (QRAM)<n>We present a framework that integrates the physical model of the Bucket Brigade QRAM (BBQRAM) with the classical data structure of the Segment Tree to achieve efficient state preparation.
  arXiv  Detail & Related papers  (2025-10-17T18:50:07Z)
• 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)
• Order-of-magnitude extension of qubit lifetimes with a decoherence-free subspace quantum error correction code [0.0]
  We report on a robust quantum memory design using a decoherence-free subspace quantum error correction code.<n>The resulting encoding scheme is characterized for long probe times, and shown to extend the memory time by over an order of magnitude compared to physical qubits.
  arXiv  Detail & Related papers  (2025-03-28T02:58:34Z)
• Correction of circuit faults in a stacked quantum memory using rank-metric codes [13.996171129586733]
  We introduce a model for a stacked quantum memory made with multi-qubit cells. We design quantum error correction codes for this model by generalizing rank-metric codes to the quantum setting.
  arXiv  Detail & Related papers  (2024-11-14T04:19:40Z)
• Engineering Bosonic Codes with Quantum Lattice Gates [1.1982127665424678]
  Bosonic codes offer a hardware-efficient approach to encoding and protecting quantum information with a single continuous-variable bosonic system.<n>We introduce a new universal quantum gate set composed of only one type of gate element, which we call the quantum lattice gate, to engineer bosonic code states for fault-tolerant quantum computing.
  arXiv  Detail & Related papers  (2024-10-22T14:47:44Z)
• Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes [16.55015892533456]
  The construction utilizes nearly self-orthogonal codes to design quantum stabilizer codes. A refined lower bound on the minimum distance of the resulting quantum codes is established. We report numerous record breaking quantum codes from our randomized search for inclusion in the updated online database.
  arXiv  Detail & Related papers  (2024-05-23T21:10:23Z)
• Quantum spherical codes [55.33545082776197]
  We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat codes that can outperform previous constructions.
  arXiv  Detail & Related papers  (2023-02-22T19:00:11Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Constructing quantum codes from any classical code and their embedding in ground space of local Hamiltonians [7.092674229752723]
  We introduce a framework that takes it any classical code and explicitly constructs the corresponding QEC code. A concrete advantage is that the desirable properties of a classical code are automatically incorporated in the design of the resulting quantum code.
  arXiv  Detail & Related papers  (2020-12-02T19:00:19Z)

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.