[论文解读] A Quantum-Memory-Free Quantum Secure Direct Communication Protocol Based on Privacy Amplification of Coded Sequences

Shang-Jen Su, Shi-Yuan Wang+1 more|arXiv (Cornell University)|Jan 29, 2026

Quantum Information and Cryptography被引用 0

一句话总结

This paper proposes a Quantum Memory-Free QSDC protocol that uses universal hashing-based privacy amplification on coded sequences to extract secrecy without wiretap coding, under collective attacks.

ABSTRACT

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.

研究动机与目标

• Motivate robust QMF-QSDC as an alternative to QKD with one-time pads.
• Develop a QMF-QSDC protocol that does not rely on wiretap coding.
• Provide privacy amplification tools to extract secrecy from coded sequences under quantum side-information.
• Analyse extractable key length under universal, non-i.i.d. channel conditions across blocks.

提出的方法

• Introduce a block-based QMF-QSDC protocol that transmits coded sequences and generates a fresh key via privacy amplification.
• Model the forward and backward quantum channels with potential collective attacks by Eve.
• Apply universal hashing-based privacy amplification to extract secrecy from coded sequences after channel estimation.
• Derive asymptotic (Theorem 2) and finite-length (Theorem 3) lower bounds on extractable key length.
• Specialize results to linear codes (Corollaries 5 and 6) to illustrate term handling for unitary encoders.
• Compare to existing QMF-QSDC protocols by accounting for non-i.i.d. codeword structures and universal privacy amplification.]
• research_questions: ["How can privacy amplification extract secrecy from coded sequences in a QMF-QSDC setting without wiretap coding?", "What are universal, block-wise lower bounds on extractable key length under collective attacks and non-i.i.d. codeword structures?", "How do asymptotic and finite-length analyses inform practical key rates in QMF-QSDC with universal hashing?", "What code designs (e.g., linear codes) simplify the bounds and ensure tractable key-length estimates?"]
• key_findings:["A QMF-QSDC protocol is proposed that forgoes wiretap coding and uses universal hashing of coded sequences for secrecy extraction.", "A set of privacy amplification theorems is developed to bound secrecy against quantum side-information for coded sequences.", "An asymptotic lower bound on extractable key length is established showing dependence on coding rate and Holevo information term, with an O(n^{3/4}) finite-size penalty.", "A finite-length lower bound is provided using a one-shot smooth min-entropy framework and a Taylor expansion of Rényi divergence.", "Corollaries for binary linear codes show how variance and relative-entropy terms influence the key length, and a unitary-encoder case simplifies the bound.", "The protocol accommodates non-i.i.d. block structure and does not require quantum memories, unlike some prior QSDC approaches.]

实验结果

研究问题

• RQ1 How can privacy amplification extract secrecy from coded sequences in a QMF-QSDC setting without wiretap coding?
• RQ2 What are universal, block-wise lower bounds on extractable key length under collective attacks and non-i.i.d. codeword structures?
• RQ3 How do asymptotic and finite-length analyses inform practical key rates in QMF-QSDC with universal hashing?
• RQ4 What code designs (e.g., linear codes) simplify the bounds and ensure tractable key-length estimates?

主要发现

• A QMF-QSDC protocol is proposed that forgoes wiretap coding and uses universal hashing of coded sequences for secrecy extraction.
• A set of privacy amplification theorems is developed to bound secrecy against quantum side-information for coded sequences.
• An asymptotic lower bound on extractable key length is established showing dependence on coding rate and Holevo information term, with an O(n^{3/4}) finite-size penalty.
• A finite-length lower bound is provided using a one-shot smooth min-entropy framework and a Taylor expansion of Rényi divergence.
• Corollaries for binary linear codes show how variance and relative-entropy terms influence the key length, and a unitary-encoder case simplifies the bound.
• The protocol accommodates non-i.i.d. block structure and does not require quantum memories, unlike some prior QSDC approaches.]