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

International Journal of Theoretical Physics

Multi-Bits Transfer Based on the Quantum Three-Stage Protocol with Quantum Error Correction Codes

Duc Manh Nguyen, Sunghwan Kim

Published Apr 6, 2019• 17 citations
Publisher
DOI
10.1007/s10773-019-04098-4

Related papers

Multi-Stage Bit-Flipping Decoder Design for Quantum Error-Correcting Codes

Patrick J. Moxom, Mark F. Flanagan

This paper proposes the use of simple bit-flipping (BF) methods as a post processor for decoding quantum low-density parity check codes (qLDPC) with message passing (MP). Specifically, min-sum (MS) is used as the MP method for the first stage of the multi-stage decoder. Two methods are proposed that modify the low-complexity Gallager’s algorithm (GA). First, a weighted bit-flipping (WBF) method is developed using soft information from the MP stage. Secondly, GA is modified with a random bit-flipping (RBF) approach. Early stopping and loop detector stage switching methods are used to enhance the performance of the BF stage. These methods are shown to significantly reduce the error floor of the first stage while also being less complex than alternative multi-stage decoders.

Irish Signals and Systems Conference•Jun 9, 2025•0 citations

A Three-Stage Quantum Cryptography Protocol

Subhash C. Kak

arXiv:quant-ph/0503027•Foundations of Physics Letters•Apr 25, 2006•151 citations

Comparative Performance Analysis of Quantum Error Correction Codes under Simulated Depolarizing Noise using Qiskit

Gurpreet Kaur, Satveer Kour, Sandeep Kaur +1 more

Fault-tolerant quantum computation requires quantum error correction (QEC), and while the performance of various QEC codes has been well characterized under idealized noise conditions, it has not been sufficiently characterized by simulation under realistic noise conditions.In this paper, the performance of three basic QEC codes (3-qubit Bit-Flip, 3-qubit Phase-Flip and Shor's 9-qubit [[9,1,3]]) under simulated depolarizing noise, by using Qiskit Aer, is analyzed systematically in three stages.Stage 1 is a validation of all three implementations under ideal circumstances.Stage 2 tests for 6 different error rates of 0% to 5%, and runs 2048 shots per error rate.Stage 3 brings the analysis from stage 2 to 0% to 10%, but with an uncorrected baseline for comparison.Results verify that Shor's > Bit-Flip > Phase-Flip is consistent over practically relevant error rates.At 1% noise, within current IBM Quantum hardware range, all three codes achieve a logical fidelity of over 98.7%.An error rate of 7-8% is used to identify a cross-over threshold above which the simpler Bit-Flip code can match Shor's code in fidelity with only one-third the number of qubits.

IJARCCE•May 28, 2026•0 citations

Practical quantum bit commitment protocol

Ariel Danan, Lev Vaidman A

arXiv:1202.3331•Quantum Information Processing•Aug 31, 2011•24 citations

Advanced decoding techniques for quantum error correcting codes

Luca Menti

•Oct 1, 2024•0 citations

QUANTUM SECURE COMMUNICATION USING POLARIZATION HOPPING MULTI-STAGE PROTOCOLS

Mayssaa El Rifai

This dissertation presents a study of the security and performance of a quantum communication system using multi-stage multi-photon tolerant protocols. Multi-stage protocols are a generalization of the three-stage protocol proposed in 2006 by Subhash Kak. Multi-stage protocols use “Polarization Hopping,” which is the process of changing the polarization state at each stage of transmission. During the execution of a multi-stage protocol, the message transfer always starts by encoding a bit of information in a polarization state; for example, bit 0 is encoded using state |0⟩ and bit 1 is encoded using state|1⟩ whereas, on the channel, the state of polarization is given by α|├ 0⟩┤+β|├ 1⟩┤. In the following α and β are restricted to the real numbers i.e., the polarization stays on the equator of the Poincare sphere. A transformation applied by one communicating party at a given stage will result in new values of α and β. \nThis dissertation analyzes the security of multi-stage, multi-photon tolerant protocols and proposes an upper bound on the average number of photons per pulse in the cases where Fock states and the cases where coherent states are used in the implementation of the three-stage protocol. The derived average number of photons is the maximum limit at which the three-stage protocol can operate at a quantum secure level while operating in a multi-photon domain. In addition, this dissertation studies the vulnerability of the multi-stage protocol to the Trojan horse attack, Photon Number splitting attack (PNS), Amplification attack, as well as the man-in-the middle attack. Moreover, this dissertation proposes a modified version of the multi-stage protocol. This modified version uses an initialization vector and implements a chaining mode between consecutive implementations of the protocol. The modified version is proposed in the case of the three-stage protocol and named a key/message expansion four variables three-stage protocol. The proposed nomenclature is based on the fact that an additional variable is added to secure the three-stage protocol. The introduction of this additional variable has the potential to secure the multi-stage protocol in the multi-photon regime. It results in the eavesdropper having a set of simultaneous equations where the number of variables exceeds the number of equations. \nThe dissertation also addresses the performance of the multi-stage, multi-photon tolerant protocol. An average photon number of 1.5 photon/stage is used to calculate the maximum achievable distance and key transfer rates while using the single-stage protocol over fiber optic cables. We compute the increase in distance as well as data transfer rate while using the single-stage protocol. Channel losses as well as the detector losses are accounted for. \nFinally, an application of the multi-stage protocol in IEEE 802.11 is proposed. This application provides wireless networks with a quantum-level of security. It proposes the integration of multi-stage protocols into the four-way handshake of IEEE 802.11.

•Jan 1, 2016•8 citations
This paper proposes the use of simple bit-flipping (BF) methods as a post processor for decoding quantum low-density parity check codes (qLDPC) with message passing (MP). Specifically, min-sum (MS) is used as the MP method for the first stage of the multi-stage decoder. Two methods are proposed that modify the low-complexity Gallager’s algorithm (GA). First, a weighted bit-flipping (WBF) method is developed using soft information from the MP stage. Secondly, GA is modified with a random bit-flipping (RBF) approach. Early stopping and loop detector stage switching methods are used to enhance the performance of the BF stage. These methods are shown to significantly reduce the error floor of the first stage while also being less complex than alternative multi-stage decoders.
Fault-tolerant quantum computation requires quantum error correction (QEC), and while the performance of various QEC codes has been well characterized under idealized noise conditions, it has not been sufficiently characterized by simulation under realistic noise conditions.In this paper, the performance of three basic QEC codes (3-qubit Bit-Flip, 3-qubit Phase-Flip and Shor's 9-qubit [[9,1,3]]) under simulated depolarizing noise, by using Qiskit Aer, is analyzed systematically in three stages.Stage 1 is a validation of all three implementations under ideal circumstances.Stage 2 tests for 6 different error rates of 0% to 5%, and runs 2048 shots per error rate.Stage 3 brings the analysis from stage 2 to 0% to 10%, but with an uncorrected baseline for comparison.Results verify that Shor's > Bit-Flip > Phase-Flip is consistent over practically relevant error rates.At 1% noise, within current IBM Quantum hardware range, all three codes achieve a logical fidelity of over 98.7%.An error rate of 7-8% is used to identify a cross-over threshold above which the simpler Bit-Flip code can match Shor's code in fidelity with only one-third the number of qubits.
This dissertation presents a study of the security and performance of a quantum communication system using multi-stage multi-photon tolerant protocols. Multi-stage protocols are a generalization of the three-stage protocol proposed in 2006 by Subhash Kak. Multi-stage protocols use “Polarization Hopping,” which is the process of changing the polarization state at each stage of transmission. During the execution of a multi-stage protocol, the message transfer always starts by encoding a bit of information in a polarization state; for example, bit 0 is encoded using state |0⟩ and bit 1 is encoded using state|1⟩ whereas, on the channel, the state of polarization is given by α|├ 0⟩┤+β|├ 1⟩┤. In the following α and β are restricted to the real numbers i.e., the polarization stays on the equator of the Poincare sphere. A transformation applied by one communicating party at a given stage will result in new values of α and β. \nThis dissertation analyzes the security of multi-stage, multi-photon tolerant protocols and proposes an upper bound on the average number of photons per pulse in the cases where Fock states and the cases where coherent states are used in the implementation of the three-stage protocol. The derived average number of photons is the maximum limit at which the three-stage protocol can operate at a quantum secure level while operating in a multi-photon domain. In addition, this dissertation studies the vulnerability of the multi-stage protocol to the Trojan horse attack, Photon Number splitting attack (PNS), Amplification attack, as well as the man-in-the middle attack. Moreover, this dissertation proposes a modified version of the multi-stage protocol. This modified version uses an initialization vector and implements a chaining mode between consecutive implementations of the protocol. The modified version is proposed in the case of the three-stage protocol and named a key/message expansion four variables three-stage protocol. The proposed nomenclature is based on the fact that an additional variable is added to secure the three-stage protocol. The introduction of this additional variable has the potential to secure the multi-stage protocol in the multi-photon regime. It results in the eavesdropper having a set of simultaneous equations where the number of variables exceeds the number of equations. \nThe dissertation also addresses the performance of the multi-stage, multi-photon tolerant protocol. An average photon number of 1.5 photon/stage is used to calculate the maximum achievable distance and key transfer rates while using the single-stage protocol over fiber optic cables. We compute the increase in distance as well as data transfer rate while using the single-stage protocol. Channel losses as well as the detector losses are accounted for. \nFinally, an application of the multi-stage protocol in IEEE 802.11 is proposed. This application provides wireless networks with a quantum-level of security. It proposes the integration of multi-stage protocols into the four-way handshake of IEEE 802.11.