Neutrosophic Quantum Error Correction

Saeid Jafari

Published Oct 9, 2026• 0 citations

Abstract

Quantum error correction is a fundamental ingredient in the protection of quantum information against decoherence and operational noise. Classical quantum error-correcting codes are normally formulated using completely positive trace-preserving quantum channels, density operators, and binary or finite-alphabet error models. In this paper we introduce a mathematical framework for neutrosophic quantum error correction (NQEC), in which the action of a quantum noise process is accompanied by three-valued degrees describing the available evidence for an error, the indeterminacy of the error description, and the degree of non-error or reliable behavior. The proposed framework does not replace the standard Hilbert-space formalism. Instead, it associates a neutrosophic descriptor (T, I, F) with quantum error events or families of error operators. We formulate neutrosophic quantum channels, neutrosophic error operators, neutrosophic code spaces, and a generalized Knill– Laflamme-type condition. A neutrosophic recovery map is then defined as a completely positive recovery operation supplemented by a consistent neutrosophic error classification. We prove several basic properties, including reduction to ordinary quantum error correction when the indeterminacy component vanishes and the error information becomes classical. Examples based on the bit-flip, phase-flip, depolarizing, and three-qubit repetition codes are given. We also formulate a neutrosophic syndrome formalism and discuss approximate correction, uncertain error probabilities, and possible extensions to stabilizer codes and fault-tolerant quantum computation.

DOI: 10.20944/preprints202610.0704.v1

Related papers

Theory of approximate quantum error correction and the error-set model

Dor Elimelech, Victor V. Albert, Alexander Barg

We develop a theory of approximate quantum error correction (QEC) based on the error-set model, complemented by general methods for code construction. Exact QEC has a powerful error-set structure: by the Knill-Laflamme conditions, a code correcting a given error set automatically protects against every channel whose Kraus operators lie in their linear span. This linearity gives rise to code distance, the equivalence between erasures and general errors, and a theory of asymptotically good codes. A longstanding view has been that these features do not extend to AQEC, leaving the theory essentially channel-by-channel. We show instead that, although full Knill--Laflamme linearity fails, a restricted form survives and suffices to extend all three structural features to the approximate setting. Specifically, a common error-set criterion governs families of channels whose Kraus operators are linear combinations of a given error set and whose coefficient matrices satisfy a spectral constraint. Using the Bény-Oreshkov worst-case and Petz average-case frameworks, we derive uniform fidelity guarantees for these families in terms of two new code parameters--the \emph{environment-leakage distance}, controlling worst-case performance, and the \emph{Knill-Laflamme Hellinger distance}, characterizing the average-case performance of Petz recovery. To demonstrate the scope of this model, we develop partition-based constructions across diverse quantum systems and geometries, placing exact and approximate correction on equal footing. These constructions lead to a metric--error alignment hierarchy for Hilbert spaces, metrics, and error families, which in turn characterizes the resulting recovery guarantees. They yield the first known asymptotically good code families for fermionic systems, one-dimensional Rydberg-blockaded systems, and deletion errors, and extend to other physical platforms.

quant-pharXiv:2607.22995Jul 28, 20260 citations

Towards a unified framework for approximate quantum error correction

Prabha Mandayam, Hui Khoon Ng

Recent work on approximate quantum error correction (QEC) has opened up the possibility of constructing subspace codes that protect information with high fidelity in scenarios where perfect error correction is impossible. Motivated by this, we investigate the problem of approximate subsystem codes. Subsystem codes extend the standard formalism of subspace QEC to codes in which only a subsystem within a subspace of states is used to store information in a noise-resilient fashion. Here, we demonstrate easily checkable sufficient conditions for the existence of approximate subsystem codes. Furthermore, for certain classes of subsystem codes and noise processes, we prove the efficacy of the transpose channel as a simple-to-construct recovery map that works nearly as well as the optimal recovery channel. This work generalizes our earlier approach [H. K. Ng and P. Mandayam, Phys. Rev. A 81, 062342 (2010)] of using the transpose channel for the approximate correction of subspace codes to the case of subsystem codes, and brings us closer to a unifying framework for approximate QEC.

arXiv:1202.5139Physical Review AJul 27, 201238 citations

Theory of quantum error-correcting codes

Emanuel H. Knill, Raymond Laflamme

Quantum error correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery-operator-independent definition of error-correcting codes. We relate this definition to four others: the existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state, and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct e errors and a formal proof that the classical bounds on the probability of error of e-error-correcting codes applies to e-error-correcting quantum codes, provided that the interaction is dominated by an identity component.

Physical Review AFeb 1, 19971,593 citations

Quantum Error Correction

Quantum error correction is a set of methods to protect quantum information--that is, quantum states--from unwanted environmental interactions (decoherence) and other forms of noise. The information is stored in a quantum error-correcting code, which is a subspace in a larger Hilbert space. This code is designed so that the most common errors move the state into an error space orthogonal to the original code space while preserving the information in the state. It is possible to determine whether an error has occurred by a suitable measurement and to apply a unitary correction that returns the state to the code space, without measuring (and hence disturbing) the protected state itself. In general, codewords of a quantum code are entangled states. No code that stores information can protect against all possible errors; instead, codes are designed to correct a specific error set, which should be chosen to match the most likely types of noise. An error set is represented by a set of operators that can multiply the codeword state. Quantum error correction is used to protect information in quantum communication (where quantum states pass through noisy channels) and quantum computation (where quantum states are transformed through a sequence of imperfect computational steps in the presence of environmental decoherence to solve a computational problem). In quantum computation, error correction is just one component of fault-tolerant design.

WORLD SCIENTIFIC eBooksFeb 20, 20183 citations

Quantum error correction

WORLD SCIENTIFIC eBooksDec 1, 20180 citations

QGEC : Quantum Golay Code Error Correction

Hideo Mukai, Hoshitaro Ohnishi

Quantum computers have the possibility of a much reduced calculation load compared with classical computers in specific problems. Quantum error correction (QEC) is vital for handling qubits, which are vulnerable to external noise. In QEC, actual errors are predicted from the results of syndrome measurements by stabilizer generators, in place of making direct measurements of the data qubits. Here, we propose Quantum Golay code Error Correction (QGEC), a QEC method using Golay code, which is an efficient coding method in classical information theory. We investigated our method's ability in decoding calculations with the Transformer. We evaluated the accuracy of the decoder in a code space defined by the generative polynomials with three different weights sets and three noise models with different correlations of bit-flip error and phase-flip error. Furthermore, under a noise model following a discrete uniform distribution, we compared the decoding performance of Transformer decoders with identical architectures trained respectively on Golay and toric codes. The results showed that the noise model with the smaller correlation gave better accuracy, while the weights of the generative polynomials had little effect on the accuracy of the decoder. In addition, they showed that Golay code requiring 23 data qubits and having a code distance of 7 achieved higher decoding accuracy than toric code which requiring 50 data qubits and having a code distance of 5. This suggests that implementing quantum error correction using a Transformer may enable the Golay code to realize fault-tolerant quantum computation more efficiently.

cs.LGCross-listedarXiv:2512.11307Dec 15, 20250 citations