Homomorphic Quantum Error Correction

• URL: http://arxiv.org/abs/2605.25692v1
• Date: Mon, 25 May 2026 10:48:08 GMT
• Title: Homomorphic Quantum Error Correction
• Abstract summary: Homomorphic quantum error correction aims to protect quantum data against both unauthorized access and environmental noise during server-based processing.<n>We investigate the compatibility between quantum homomorphic encryption and quantum error correction, determining which encoded states remain inside the relevant code space during storage and computation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Homomorphic quantum error correction aims to protect quantum data against both unauthorized access and environmental noise during server-based processing. We investigate the algebraic compatibility between quantum homomorphic encryption and quantum error correction, determining precise conditions under which encrypted encoded states remain inside the relevant code space during storage and computation. Our work establishes a necessary and sufficient criterion for an $[[n,1,d]]$ stabilizer code to remain compatible with the restricted transversal block-Pauli masking $U_{\rm enc}(a,b)=(X^aZ^b)^{\otimes n}$, stated explicitly for $[[n,1,d]]$ codes and extending directly to code-space preservation for $[[n,k,d]]$ codes. We verify this condition for standard examples (bit-flip and Shor codes, with the phase-flip repetition code following analogously), derive a practical criterion for Calderbank-Shor-Steane codes, and extend the analysis to three-dimensional color codes. A critical challenge emerges for non-Clifford gate implementation: the Shor code lacks a naive transversal $T$-gate implementation of the desired logical operation on encrypted encoded data. We present two routes around this obstruction. First, suitable triorthogonal codes admit transversal $T$-type logical implementations, up to Clifford corrections. Second, logical-gate masking gives code-space compatibility for arbitrary stabilizer codes, provided that suitable unitary representatives of the required logical gates are available. These results separate code-space compatibility from a full cryptographic security proof and provide explicit criteria for combining error correction with homomorphic processing in cloud quantum computing.

Related papers

• Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes [45.91504150103373]
  We study a quantum error mitigation method known as probabilistic error cancellation in the context of the Gottesman-Kitaev-Preskill code.<n>We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations.
  arXiv  Detail & Related papers  (2026-09-15T12:29:45Z)
• Verified Pythagorean Composition for Adaptive Cryptographic Games: Noise Flooding in Homomorphic Encryption [45.00791460144501]
  Noise flooding is a standard defense against decryption attacks on approximate homomorphic encryption.<n>Our proof constructs a new relational program logic over SSProve semantics.
  arXiv  Detail & Related papers  (2026-08-14T00:40:29Z)
• High-threshold decoding of non-Pauli codes for 2D universality [0.15999407512883507]
  Topological codes have many desirable properties that allow fault-tolerant quantum computation with relatively low overhead.<n>A core challenge for these codes is to achieve a low-overhead universal gate set with limited connectivity.<n>We explore a non-Pauli stabilizer code that can be used to complete a universal gate set on topological toric and surface codes in strictly two dimensions.
  arXiv  Detail & Related papers  (2026-04-02T13:39:46Z)
• Universal Weakly Fault-Tolerant Quantum Computation via Code Switching in the [[8,3,2]] Code [1.5024443617567174]
  We present a fault-tolerant code-switching protocol between two versions of the $[[8, 3, 2]]$ code.<n>One version supports weakly fault-tolerant single-qubit Clifford gates, while the other supports a logical $overlinemathrmCCZ$ gate.
  arXiv  Detail & Related papers  (2026-03-16T17:57:54Z)
• Stairway Codes: Floquetifying Bivariate Bicycle Codes and Beyond [41.99844472131922]
  Floquet codes define fault-tolerant protocols through periodic measurement sequences.<n>We introduce Stairway codes, a family of high-rate Floquet protocols.<n>We demonstrate logical error rates surpassing those of other Floquet codes at comparable encoding rates.
  arXiv  Detail & Related papers  (2026-02-27T19:00:00Z)
• Qudit stabiliser codes for $\mathbb{Z}_N$ lattice gauge theories with matter [42.418429168532406]
  We show that a $mathbbZ_N$ gauge theory with prime dimension $N$ coupled to dynamical matter can be expressed as a qudit stabilizer code.<n>Using the stabilizer formalism we show how to formulate an exact mapping of the encoded $mathbbZ_N$ gauge theory onto two different bosonic models.
  arXiv  Detail & Related papers  (2026-02-24T08:07:05Z)
• Logical gates on Floquet codes via folds and twists [45.88028371034407]
  We show how two techniques from static quantum error-correcting codes can be implemented on Floquet codes.<n>First, we present a way of implementing fold-transversal operations on Floquet codes in order to yield logical Hadamard and S gates.<n>Second, we present a way of implementing logical CNOT gates on Floquet codes via Dehn twists.
  arXiv  Detail & Related papers  (2025-12-19T19:00:06Z)
• Accessible Quantum Gates on Classical Stabilizer Codes [0.0]
  We consider $[n,k,d]$-classical stabilizer codes addressing bit-flip errors where $n$, $k$ and $d$ are the numbers of physical and logical qubits, and the code distance respectively.<n>We prove that operations essential for achieving a universal logical gate set necessarily require complex unitary circuits to be implemented.<n>Similar constraints apply not only to classical codes designed to correct phase-flip errors, but also to quantum stabilizer codes tailored to biased noise.
  arXiv  Detail & Related papers  (2025-07-07T18:47:58Z)
• 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)
• Qudit-based quantum error-correcting codes from irreducible representations of SU(d) [0.0]
  Qudits naturally correspond to multi-level quantum systems, but their reliability is contingent upon quantum error correction capabilities. We present a general procedure for constructing error-correcting qudit codes through the irreducible representations of $mathrmSU(d)$ for any odd integer $d geq 3.$ We use our procedure to construct an infinite class of error-correcting codes encoding a logical qudit into $(d-1)2$ physical qudits.
  arXiv  Detail & Related papers  (2024-10-03T11:35:57Z)
• Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
  We simulate the logical Hadamard gate in the surface code under a circuit-level noise model. Our paper is the first to do this for a unitary gate on a quantum error-correction code.
  arXiv  Detail & Related papers  (2023-12-18T19:00:00Z)
• Designing the Quantum Channels Induced by Diagonal Gates [0.5735035463793007]
  Diagonal gates play an important role in implementing a universal set of quantum operations. This paper describes the process of preparing a code state, applying a diagonal physical gate, measuring a code syndrome, and applying a Pauli correction.
  arXiv  Detail & Related papers  (2021-09-28T04:39: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)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)

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.