A Family of Finite Geometry LDPC Codes for Quantum Key Expansion

Kung-Chuan Hsu, Todd A. Brun

Published Mar 7, 2013• 0 citations

Abstract

• A quantum key distribution (QKD) protocol allows two parties Alice and Bob to establish secret key through one-way quantum communications and classical public communications. With the aid of an entanglement-assisted (EA) quantum error correcting (QEC) code, QKD can be made to expand a secret key, and the process is known as quantum key expansion (QKE). • Luo and Devetak[1] derived a QKE protocol by modifying the EA entanglement-distillation (EAED) protocol with the use of EA Calderbank-Shor-Steane (CSS) QEC codes. • Our initial goal is to search for QEC codes that guarantee high net key rates for QKE. The Original QKE Protocol • Let C1 and C2 be two classical [n, k1] and [n, k2] codes with parity-check matrices H1 and H2. and c = rank(M), ∃ nonsingu-• Let M = H1H T 2 lar matrices T1 and T2 s.t. • For i = 1, 2, let

Related papers

Family of finite geometry low-density parity-check codes for quantum key expansion

Kung-Chuan Hsu, Todd A. Brun

We consider a quantum key expansion (QKE) protocol based on entanglement-assisted quantum error-correcting codes (EAQECCs). In these protocols, a seed of a previously shared secret key is used in the postprocessing stage of a standard quantum key distribution protocol like the Bennett-Brassard 1984 protocol, in order to produce a larger secret key. This protocol was proposed by Luo and Devetak, but codes leading to good performance have not been investigated. We look into a family of EAQECCs generated by classical finite geometry (FG) low-density parity-check (LDPC) codes, for which very efficient iterative decoders exist. A critical observation is that almost all errors in the resulting secret key result from uncorrectable block errors that can be detected by an additional syndrome check and an additional sampling step. Bad blocks can then be discarded. We make some changes to the original protocol to avoid the consumption of the preshared key when the protocol fails. This allows us to greatly reduce the bit error rate of the key at the cost of a minor reduction in the key production rate, but without increasing the consumption rate of the preshared key. We present numerical simulations for the family of FG LDPC codes, and show that this improved QKE protocol has a good net key production rate even at relatively high error rates, for appropriate choices of these codes.

arXiv:1303.1760Physical Review AJun 24, 20135 citations

A quantum key distribution protocol based on LDPC error correcting codes

Wei Jia, Ying Zhang, Hao Cheng Yu +1 more

Quantum encryption guarantees the absolute security of key distribution from the physical mechanism. However, in the process of quantum key distribution (QKD), quantum channel noise will reduce the transmission efficiency. Quantum low-density parity check (quantum LDPC) code has become a hot research topic of quantum error correcting code due to its great flexibility in the choice of code length and code rate and its dependence on sparse graphs. In order to improve the transmission reliability, a QKD protocol based on BB84 and quantum LDPC code is designed. First, we construct a quantum LDCP error correcting code. Then we utilize the error correcting code and BB84 to construct our QKD protocol. Finally, we analyze the influence of the quantum LDPC code on the proposed protocol. The results show that the key transmission efficiency of the our protocol is improved, and the validity of the QKD protocol based on BB84 and quantum LDPC codes in noisy quantum channels is verified.

ACM Turing Celebration Conference - China (ACM TURC)May 17, 20193 citations

Quantum key expansion from non-orthogonal codes

Zhiguo Luo, Igor Devetak

The secure prepare-and-measure BB84 quantum key distribution (QKD) protocol implicit in the Shor-Preskill security proof is based on Calderbank-Shor-Steane (CSS) codes. The latter rely on the existence of pairs of good codes with mutually orthogonal parity check matices, which are hard to construct. Here we show that the orthogonality requirement can be lifted at a small price: instead of a QKD protocol we obtain a quantum key expansion (QKE) protocol, capable of increasing the size of a pre-shared key by a constant factor. Our construction is based on the recently discovered entanglement-assisted quantum codes of Brun, Devetak and Hsieh.

Aug 2, 20061 citation

Quantum key secure communication protocol via enhanced superdense coding

Mario Mastriani

In the last decades, Quantum Cryptography has become one of the most important branches of Quantum Communications with a particular projection over the future Quantum Internet. It is precisely in Quantum Cryptography where two techniques stand out above all others: Quantum Key Distribution (QKD), and Quantum Secure Direct Communication (QSDC). The first one has four loopholes relating to the exposure of the key at all points in the communication system, while the second has clear practical implementation problems in all its variants currently in use. Here, we present an alternative to QKD and QSDC techniques called quantum key secure communication (QKSC) protocol with a successful implementation on two free access quantum platforms.

arXiv:2011.05165Nov 4, 20200 citations

Quantum Key Distribution Protocols: A Survey ♠

Mohamed Elboukhari, Mostafa Azizi, Abdelmalek Azizi

Most cryptographic mechanisms, such as symmetric and asymmetric cryptography, often involve the use of cryptographic keys. However, all cryptographic techniques will be ineffective if th e key distribution mechanism is weak. The security of most modern cryptographic systems of key distribution mechanism is based on computational co mplexity and the extraordinary time needed to break the code. Quantum Key Distribution (QKD) or Quantum Cryptography is attracting much attention as a solution of the problem of key distribution; QKD of fers unconditionally secure communication based on quantum mechanics. In this article we survey the mo st popular QKD protocols. Also, we give a short state of the art of Quantum Cryptography.

Jan 1, 201019 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.0425Aug 2, 20101 citation