Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2505.18133 · Scientific Reports

Joint encryption and error correction for secure quantum communication

Nitin Jha, Abhishek Parakh, Mahadevan Subramaniam

Published Oct 19, 2024• 3 citations
arXivHTMLPDF

Abstract

Secure quantum networks are a bedrock requirement for developing a future quantum internet. However, quantum channels are susceptible to channel noise that introduce errors in the transmitted data. The traditional approach to providing error correction typically encapsulates the message in an error correction code after encryption. Such separate processes incur overhead that must be avoided when possible. We, consequently, provide a single integrated process that allows for encryption as well as error correction. This is a first attempt to do so for secure quantum communication and combines the Calderbank-Shor-Steane (CSS) code with the three-stage secure quantum communication protocol. Lastly, it allows for arbitrary qubits to be transmitted from sender to receiver making the proposed protocol general purpose.

DOI
10.1038/s41598-024-75212-8

Related papers

Quantum Secure Direct Communication Using Quantum Calderbank-Shor-Steane Error Correcting Codes

Xin LÜ

The notion of quantum secure direct communication (QSDC) has been introduced recently in quantum cryptography as a replacement for quantum key distribution, in which two communication entities exchange secure classical messages without establishing any shared keys previously. In this paper, a quantum secure direct communication scheme using quantum Calderbank-Shor-Steane (CSS) error correction codes is proposed. In the scheme, a secure message is first transformed into a binary error vector and then encrypted (decrypted) via quantum coding (decoding) procedures. An adversary Eve, who has controlled the communication channel, can't recover the secrete messages because she doesn't know the deciphering keys. Security of this scheme is based on the assumption

Journal of Software•Jan 1, 2006•17 citations

Secure Direct Communication Using Quantum Calderbank-Shor-Steane Codes.

Xin Lü, Zhi Ma, Dengguo Feng

The notion of quantum secure direct communication (QSDC) has been introduced recently in quantum cryptography as a replacement for quantum key distribution, in which two communication entities exchange secure classical messages without establishing any shared keys previously. In this paper, a quantum secure direct communication scheme using quantum Calderbank-Shor-Steane (CCS) error correction codes is proposed. In the scheme, a secure message is first transformed into a binary error vector and then encrypted(decrypted) via quantum coding(decoding) procedures. An adversary Eve, who has controlled the communication channel, can’t recover the secrete messages because she doesn’t know the deciphering keys. Security of this scheme is based on the assumption that decoding general linear codes is intractable even on quantum computers.

•Jan 1, 2004•0 citations

Quantum Steganography and Quantum Error-Correction

Bilal Shaw

In the current thesis we first talk about the six-qubit quantum error-correcting code and show its connections to entanglement-assisted error-correcting coding theory and then to subsystem codes. This code bridges the gap between the five-qubit (perfect) and Steane codes. We discuss two methods to encode one qubit into six physical qubits. Each of the two examples corrects an arbitrary single-qubit error. The first example is a degenerate six-qubit quantum error-correcting code. We prove that a six-qubit code without entanglement assistance cannot simultaneously possess a Calderbank-Shor-Steane (CSS) stabilizer and correct an arbitrary single-qubit error. A corollary of this result is that the Steane seven-qubit code is the smallest single-error correcting CSS code. Our second example is the construction of a non-degenerate six-qubit CSS entanglement-assisted code. This code uses one bit of entanglement (an ebit) shared between the sender (Alice) and the receiver (Bob) and corrects an arbitrary single-qubit error. In the second half of this thesis we explore the yet uncharted and relatively undiscovered area of quantum steganography. Steganography is the process of hiding secret information by embedding it in an innocent message. We present protocols for hiding quantum information in a codeword of a quantum error-correcting code passing through a channel. Using either a shared classical secret key or shared entanglement Alice disguises her information as errors in the channel. Bob can retrieve the hidden information, but an eavesdropper (Eve) with the power to monitor the channel, but without the secret key, cannot distinguish the message from channel noise. We analyze how difficult it is for Eve to detect the presence of secret messages, and estimate rates of steganographic communication and secret key consumption for certain protocols.

arXiv:1008.0425•Aug 2, 2010•1 citation

Impact of a CSS quantum error correction code in underwater quantum key distribution

Juliette Florin, Nicolas Le Josse, Arnaud Coatanhay +1 more

Quantum key distribution (QKD) enables secure underwater communications essential for maritime infrastructure. Underwater optical channels introduce substantial photon loss (erasures) and ambient noise that degrade QKD performance. This paper investigates whether two four-qubit Calderbank-Shor-Steane (CSS) quantum error correction codes (QECC) mitigate these impairments in vertical underwater communication BB84 QKD protocol. After developing a comprehensive stochastic channel model incorporating photon loss, geometric spreading, and solar noise, we assess the viability of QECC through the analytical study of the quantum bit error rate (QBER) and the secure key rate (SKR) with and without security depending on the signal-to-noise ratio (SNR) validated against Monte Carlo simulations. The standard four-qubit CSS code achieves a 3 dB SNR gain at the QBER 11% security threshold; the discard code variant achieves 4.5 dB. However, QECC includes an encoding overhead that reduces the SKR. We demonstrate a crucial relationship between the SKR and the probability of arrival of the sent photon. Analysis shows that QECC is beneficial exclusively in marginal SNR regimes; at high SNR, raw BB84 dominates. For an ocean Type III Jerlov water scenario with sunlight coming from the sun located at the top of the atmosphere, we identify operational depth-range windows where QECC enables communication otherwise infeasible. This analysis establishes that error correction deployment must be scenario-dependent: extend operational range at the cost of throughput when SNR is marginal, or prioritize key generation rates at high SNR.

quant-pharXiv:2609.18666•Sep 17, 2026•0 citations

Quantum error correction

E. Desurvire

This chapter deals with the subject of quantum error correction and the related codes (QECC), which can be applied to noisy quantum channels and quantum memories with the purpose of preserving or protecting the information integrity. I first describe the basics of quantum repetition codes , as applicable to bit-flip and phase-flip quantum channels. Then I consider the 9-qubit Shor code , which has the capability of diagnosing and correcting any combination of bit-flip and phase-flip errors, up to one error of each type. Furthermore, it is shown that the Shor code is, in fact, capable of fully restoring qubit integrity under a continuum of bit or phase errors, a property that has no counterpart in the classical world of error-correction codes. But the exploration of QECC does not stop here! We shall discover the elegant Calderbank–Shor–Steane (CSS) codes, which have the capability of correcting any number of errors t , both bit-flip and phase-flip. As an application of the CSS code, I then describe the 7-qubit Hadamard–Steane code , which can correct up to one error on single qubits. A corresponding quantum circuit, based on an original generator-matrix example, is presented. Quantum repetition code In Chapter 11, we saw that the simplest form of error-correction code (ECC) is the repetition code , based on the principle of majority logic . The background assumption is that in a given message sequence, or bit string, the probability of a bit error is sufficiently small for the majority of bits to be correctly transmitted through the channel.

Cambridge University Press eBooks•Feb 19, 2009•0 citations

Cai–Li Communication Protocol in Noisy Quantum Channel

Hua Lu, Yan Xu-Dong, Xianzhou Zhang

Since the original Cai–Li protocol [Chin. Phys. Lett. 21 (2004) 601] can be used only in an ideal quantum communication, we present the modified Cai–Li protocol that can be used in the a noisy quantum channel by using Calderbank–Shor–Steane (CSS) codes to correct errors. We also give a tight bound on the connection between information Eve eavesdropped with a measurement attack in line B → A and detection probability, which shows that the Cai–Li protocol can be used as a quasisecure direct quantum communication.

Chinese Physics Letters•Dec 1, 2004•5 citations
Secure quantum networks are a bedrock requirement for developing a future quantum internet. However, quantum channels are susceptible to channel noise that introduce errors in the transmitted data. The traditional approach to providing error correction typically encapsulates the message in an error correction code after encryption. Such separate processes incur overhead that must be avoided when possible. We, consequently, provide a single integrated process that allows for encryption as well as error correction. This is a first attempt to do so for secure quantum communication and combines the Calderbank-Shor-Steane (CSS) code with the three-stage secure quantum communication protocol. Lastly, it allows for arbitrary qubits to be transmitted from sender to receiver making the proposed protocol general purpose.
The notion of quantum secure direct communication (QSDC) has been introduced recently in quantum cryptography as a replacement for quantum key distribution, in which two communication entities exchange secure classical messages without establishing any shared keys previously. In this paper, a quantum secure direct communication scheme using quantum Calderbank-Shor-Steane (CSS) error correction codes is proposed. In the scheme, a secure message is first transformed into a binary error vector and then encrypted (decrypted) via quantum coding (decoding) procedures. An adversary Eve, who has controlled the communication channel, can't recover the secrete messages because she doesn't know the deciphering keys. Security of this scheme is based on the assumption
The notion of quantum secure direct communication (QSDC) has been introduced recently in quantum cryptography as a replacement for quantum key distribution, in which two communication entities exchange secure classical messages without establishing any shared keys previously. In this paper, a quantum secure direct communication scheme using quantum Calderbank-Shor-Steane (CCS) error correction codes is proposed. In the scheme, a secure message is first transformed into a binary error vector and then encrypted(decrypted) via quantum coding(decoding) procedures. An adversary Eve, who has controlled the communication channel, can’t recover the secrete messages because she doesn’t know the deciphering keys. Security of this scheme is based on the assumption that decoding general linear codes is intractable even on quantum computers.
In the current thesis we first talk about the six-qubit quantum error-correcting code and show its connections to entanglement-assisted error-correcting coding theory and then to subsystem codes. This code bridges the gap between the five-qubit (perfect) and Steane codes. We discuss two methods to encode one qubit into six physical qubits. Each of the two examples corrects an arbitrary single-qubit error. The first example is a degenerate six-qubit quantum error-correcting code. We prove that a six-qubit code without entanglement assistance cannot simultaneously possess a Calderbank-Shor-Steane (CSS) stabilizer and correct an arbitrary single-qubit error. A corollary of this result is that the Steane seven-qubit code is the smallest single-error correcting CSS code. Our second example is the construction of a non-degenerate six-qubit CSS entanglement-assisted code. This code uses one bit of entanglement (an ebit) shared between the sender (Alice) and the receiver (Bob) and corrects an arbitrary single-qubit error. In the second half of this thesis we explore the yet uncharted and relatively undiscovered area of quantum steganography. Steganography is the process of hiding secret information by embedding it in an innocent message. We present protocols for hiding quantum information in a codeword of a quantum error-correcting code passing through a channel. Using either a shared classical secret key or shared entanglement Alice disguises her information as errors in the channel. Bob can retrieve the hidden information, but an eavesdropper (Eve) with the power to monitor the channel, but without the secret key, cannot distinguish the message from channel noise. We analyze how difficult it is for Eve to detect the presence of secret messages, and estimate rates of steganographic communication and secret key consumption for certain protocols.
Quantum key distribution (QKD) enables secure underwater communications essential for maritime infrastructure. Underwater optical channels introduce substantial photon loss (erasures) and ambient noise that degrade QKD performance. This paper investigates whether two four-qubit Calderbank-Shor-Steane (CSS) quantum error correction codes (QECC) mitigate these impairments in vertical underwater communication BB84 QKD protocol. After developing a comprehensive stochastic channel model incorporating photon loss, geometric spreading, and solar noise, we assess the viability of QECC through the analytical study of the quantum bit error rate (QBER) and the secure key rate (SKR) with and without security depending on the signal-to-noise ratio (SNR) validated against Monte Carlo simulations. The standard four-qubit CSS code achieves a 3 dB SNR gain at the QBER 11% security threshold; the discard code variant achieves 4.5 dB. However, QECC includes an encoding overhead that reduces the SKR. We demonstrate a crucial relationship between the SKR and the probability of arrival of the sent photon. Analysis shows that QECC is beneficial exclusively in marginal SNR regimes; at high SNR, raw BB84 dominates. For an ocean Type III Jerlov water scenario with sunlight coming from the sun located at the top of the atmosphere, we identify operational depth-range windows where QECC enables communication otherwise infeasible. This analysis establishes that error correction deployment must be scenario-dependent: extend operational range at the cost of throughput when SNR is marginal, or prioritize key generation rates at high SNR.
This chapter deals with the subject of quantum error correction and the related codes (QECC), which can be applied to noisy quantum channels and quantum memories with the purpose of preserving or protecting the information integrity. I first describe the basics of quantum repetition codes , as applicable to bit-flip and phase-flip quantum channels. Then I consider the 9-qubit Shor code , which has the capability of diagnosing and correcting any combination of bit-flip and phase-flip errors, up to one error of each type. Furthermore, it is shown that the Shor code is, in fact, capable of fully restoring qubit integrity under a continuum of bit or phase errors, a property that has no counterpart in the classical world of error-correction codes. But the exploration of QECC does not stop here! We shall discover the elegant Calderbank–Shor–Steane (CSS) codes, which have the capability of correcting any number of errors t , both bit-flip and phase-flip. As an application of the CSS code, I then describe the 7-qubit Hadamard–Steane code , which can correct up to one error on single qubits. A corresponding quantum circuit, based on an original generator-matrix example, is presented. Quantum repetition code In Chapter 11, we saw that the simplest form of error-correction code (ECC) is the repetition code , based on the principle of majority logic . The background assumption is that in a given message sequence, or bit string, the probability of a bit error is sufficiently small for the majority of bits to be correctly transmitted through the channel.
Since the original Cai–Li protocol [Chin. Phys. Lett. 21 (2004) 601] can be used only in an ideal quantum communication, we present the modified Cai–Li protocol that can be used in the a noisy quantum channel by using Calderbank–Shor–Steane (CSS) codes to correct errors. We also give a tight bound on the connection between information Eve eavesdropped with a measurement attack in line B → A and detection probability, which shows that the Cai–Li protocol can be used as a quasisecure direct quantum communication.