A Quantum-Memory-Free Quantum Secure Direct Communication Protocol Based on Privacy Amplification of Coded Sequences

We develop an information-theoretic analysis of Quantum-Memory-Free (QMF) Quantum Secure Direct Communication (QSDC) under collective attacks as an alternative to the conventional Quantum Key Distribution (QKD) protocol with one-time pads. Our main contributions are: 1) a QMF-QSDC protocol that only relies on universal hashing of coded sequences without wiretap coding; 2) a set of privacy amplification theorems for extracting secrecy from coded classical sequences against quantum side-information. These tools open the way to the design of robust QMF-QSDC protocols.

💡 Research Summary

The paper presents a novel quantum‑secure direct communication (QSDC) protocol that operates without the need for quantum memories, and it develops a set of privacy‑amplification theorems for extracting secret keys from coded classical sequences when an eavesdropper holds quantum side‑information. The authors begin by highlighting the inefficiencies of conventional quantum key distribution (QKD), which typically consumes quantum resources heavily (e.g., sifting phases) and relies on a one‑time‑pad encryption stage after key generation. They argue that QSDC can combine reliability and secrecy in a single transmission, but existing quantum‑memory‑free (QMF) QSDC schemes either depend on wiretap coding or require prior knowledge of the channel, limiting their universality.

The proposed protocol works in a block‑wise fashion over a round‑trip quantum channel assisted by an authenticated public classical channel. In each block, Bob prepares a random sequence of n + p qubits drawn uniformly from the four BB84 states and sends them to Alice (forward channel). Alice measures p of them as pilots to estimate the forward channel; the remaining n qubits are reserved for message encoding. After channel estimation, Alice and Bob decide on a coding rate R_code for the current block and construct a public codebook of encoders/decoders. Alice first applies a one‑time‑pad to the message using a key drawn from a previously generated key pool, then maps the encrypted bits onto the n qubits using a simple unitary (identity for “0”, Pauli‑X for “1”). The encoded qubits, together with interleaved pilots, travel back to Bob (backward channel) where Eve may launch a collective attack by attaching ancilla systems and later measuring them jointly with the backward‑channel output.

Bob receives the qubits, discards the pilots (whose positions are revealed by Alice), and decodes the codeword using the shared codebook and the one‑time‑pad key. Both parties then apply a universal hash function to the entire codeword to perform privacy amplification. The length of the freshly extracted key K_b is determined by the smooth min‑entropy H_min^ε (Xⁿ|Zⁿ) of the transmitted codeword Xⁿ conditioned on Eve’s quantum system Zⁿ. Because the codeword is not i.i.d., the authors adapt tools from entropy accumulation and the quantum asymptotic equipartition property (AEP) to obtain a universal lower bound on this min‑entropy.

The central technical result (Theorem 2) states that for n = B_sub·m channel uses, the smooth min‑entropy satisfies
H_min^ε (Xⁿ|Zⁿ) ≥ n (R_code − χ(N_X→Z)) − O(n^{3/4}),
where χ(N_X→Z) is the Holevo information of the quantum channel from Alice’s system X to Eve’s system Z. This bound shows that as long as the coding rate is below the channel’s Holevo capacity, a positive amount of secret key can be extracted per block, even under collective attacks. The analysis relies only on universal hashing (no wiretap code) and on the fact that channel estimation occurs after each block, making the coding scheme robust to arbitrary, possibly time‑varying channels.

Compared with prior QMF‑QSDC proposals, the new protocol eliminates wiretap coding, uses a single privacy‑amplification step, and handles non‑i.i.d. coded sequences. It also does not require quantum memories, instead employing retransmission strategies to replenish the key pool when channel conditions are unfavorable. The paper concludes that the protocol offers a practical pathway to high‑rate, memory‑free quantum secure communication, and suggests future work on multi‑user extensions, experimental validation, and optimization of the universal hash functions for finite‑size effects.