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

Matthieu R. Bloch; Shang-Jen Su; Shi-Yuan Wang

arxiv: 2601.21265 · v2 · submitted 2026-01-29 · 🪐 quant-ph

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

Shang-Jen Su , Shi-Yuan Wang , Matthieu R. Bloch This is my paper

Pith reviewed 2026-05-16 10:25 UTC · model grok-4.3

classification 🪐 quant-ph

keywords quantum secure direct communicationquantum-memory-freeprivacy amplificationuniversal hashingcollective attacksquantum side-informationinformation-theoretic security

0 comments

The pith

Universal hashing of coded sequences secures quantum direct communication without memory or wiretap coding.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops an information-theoretic analysis of quantum secure direct communication without quantum memory under collective attacks. It introduces a protocol that achieves security through universal hashing applied to coded sequences alone, dispensing with wiretap coding. This serves as a direct alternative to running quantum key distribution followed by one-time pads. The authors supply privacy amplification theorems that extract secrecy from classical coded sequences when the adversary holds quantum side-information. The approach aims to simplify protocol design by removing memory hardware requirements.

Core claim

A quantum-memory-free quantum secure direct communication protocol can be realized by applying universal hashing to coded sequences without wiretap coding, supported by privacy amplification theorems that guarantee secrecy extraction from classical codes against quantum side-information under collective attacks.

What carries the argument

Universal hashing for privacy amplification on coded classical sequences to extract secrecy against quantum side-information.

If this is right

The protocol offers a simpler alternative to quantum key distribution plus one-time pads for direct secure transmission.
Security analysis reduces to classical privacy amplification theorems adapted to quantum side-information.
Effective QMF-QSDC protocols become feasible without quantum memory or complex wiretap codes.
The same hashing-based secrecy extraction can be reused across multiple communication rounds.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Hardware implementations could become lighter by dropping quantum memory components entirely.
The technique may transfer to other quantum tasks that currently rely on memory-assisted coding.
Testing the theorems under individual or coherent attacks would clarify the security margin beyond collective attacks.

Load-bearing premise

The privacy amplification theorems and resulting security hold when the adversary is limited to collective attacks and the chosen coding plus hashing scheme extracts enough secrecy from the quantum side-information.

What would settle it

An explicit collective attack in which the hashed output still leaves the eavesdropper with non-negligible information on the transmitted message would falsify the security claim.

Figures

Figures reproduced from arXiv: 2601.21265 by Matthieu R. Bloch, Shang-Jen Su, Shi-Yuan Wang.

read the original 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 use of a conventional Quantum Key Distribution (QKD) protocol in conjunction 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 effective QMF-QSDC protocols.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives a hashing-based QMF-QSDC protocol and privacy-amplification theorems for coded sequences, but leaves the needed min-entropy lower bound under collective attacks unshown.

read the letter

The core claim is a quantum-memory-free QSDC scheme that hashes coded sequences for secrecy instead of using wiretap codes, plus a set of theorems that extract secrecy from those sequences when quantum side information is present. This is positioned as a simpler alternative to QKD plus one-time pad for direct communication in quantum networks. The protocol steps are laid out clearly and the hashing choice is a deliberate departure from most prior QSDC work cited in the abstract. That design choice is the main novelty and could reduce hardware demands if the security argument closes. The theorems themselves look like standard information-theoretic tools adapted to this setting, which is useful scaffolding for others who want to build similar protocols. The soft spot is exactly the one flagged in the stress test. The theorems only guarantee secrecy once the smooth min-entropy of the coded sequence is shown to be large enough relative to the leakage. The manuscript states that universal hashing is applied but does not derive or bound H_min^ε(X^n | E) for the specific code and collective-attack channel parameters. Without that step the theorems cannot be invoked, so the security claim remains open. If those bounds appear later in the full text they need to be explicit and checked; otherwise the central argument does not hold. This is for people working on practical quantum communication protocols who are already comfortable with privacy amplification and coding arguments. A reader looking for concrete implementation shortcuts would find the hashing route worth examining, though they would have to supply the missing entropy analysis themselves. It deserves peer review so that referees can verify whether the bounds can be filled in and whether the protocol actually delivers the claimed security.

Referee Report

1 major / 0 minor

Summary. The manuscript develops an information-theoretic analysis of a Quantum-Memory-Free Quantum Secure Direct Communication (QMF-QSDC) protocol under collective attacks. It claims two main contributions: (1) a QMF-QSDC protocol that performs universal hashing directly on coded sequences without requiring wiretap coding, and (2) a set of privacy amplification theorems that extract secrecy from classical coded sequences against quantum side-information.

Significance. If the privacy amplification theorems are accompanied by explicit min-entropy bounds that close the security argument, the protocol could offer a simpler alternative to QKD-plus-one-time-pad constructions for direct secure communication, reducing reliance on quantum memory.

major comments (1)

[Protocol and Theorems] The privacy amplification theorems (stated in the main technical section) are only applicable once a concrete lower bound on the smooth min-entropy H_min^ε(X^n | E) of the coded sequence is established under the collective-attack model. No such explicit calculation or bound is supplied for the chosen code parameters and channel; without it the theorems cannot be invoked to guarantee that the hashed output is secret.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the detailed review and constructive feedback. We agree that completing the security argument requires an explicit lower bound on the smooth min-entropy and will address this directly in the revision.

read point-by-point responses

Referee: [Protocol and Theorems] The privacy amplification theorems (stated in the main technical section) are only applicable once a concrete lower bound on the smooth min-entropy H_min^ε(X^n | E) of the coded sequence is established under the collective-attack model. No such explicit calculation or bound is supplied for the chosen code parameters and channel; without it the theorems cannot be invoked to guarantee that the hashed output is secret.

Authors: We agree that an explicit lower bound on H_min^ε(X^n | E) is required to invoke the privacy amplification theorems under the collective-attack model. In the revised manuscript we will add a dedicated subsection deriving this bound for the chosen code parameters and channel, using the standard quantum information techniques for collective attacks (including the use of the quantum de Finetti theorem and appropriate concentration inequalities). This will close the security argument and allow direct application of the stated theorems. revision: yes

Circularity Check

0 steps flagged

No significant circularity; claims rely on standard information-theoretic tools

full rationale

The paper develops a QMF-QSDC protocol using universal hashing on coded sequences and presents privacy amplification theorems for secrecy extraction against quantum side-information under collective attacks. These contributions build directly on established min-entropy and hashing properties without self-definitional loops, fitted inputs renamed as predictions, or load-bearing self-citations that reduce the central result to its own inputs. The derivation chain remains self-contained as the theorems are stated as general tools applicable once standard entropy bounds hold, with no equations or steps shown to equate outputs to inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review provides no explicit free parameters, axioms, or invented entities; all details deferred to full text.

pith-pipeline@v0.9.0 · 5397 in / 924 out tokens · 29332 ms · 2026-05-16T10:25:37.292621+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

Cost.FunctionalEquation washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

H^ε_min(X^n|Z^n) ≥ n R_code − n χ(N) − V(ρ||σ)/(2n log e) − C/n² − n g(ε) (Theorem 3)
Foundation.RealityFromDistinction reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

extractable key length determined by smooth min-entropy of transmitted codeword

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

43 extracted references · 43 canonical work pages

[1]

Quantum cryptography: Public key distribution and coin tossing,

C. H. Bennett and G. Brassard, “Quantum cryptography: Public key distribution and coin tossing,” inProceedings of IEEE International Conference on Computers, Systems, and Signal Processing, vol. 1, Bangalore, India, Dec. 1984, pp. 175–179

work page 1984
[2]

Experimental quantum cryptography,

C. H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, “Experimental quantum cryptography,”Journal of Cryptology, vol. 5, no. 1, pp. 3–28, Jan. 1992

work page 1992
[3]

The security of practical quantum key distribution,

V . Scarani, H. Bechmann-Pasquinucci, N. J. Cerf, and et al., “The security of practical quantum key distribution,”Reviews of Modern Physics, vol. 81, no. 3, pp. 1301–1350, Sep. 2009

work page 2009
[4]

Advances in quantum cryptography,

S. Pirandola, U. L. Andersen, L. Banchi, and et al., “Advances in quantum cryptography,”Advances in Optics and Photonics, vol. 12, no. 4, p. 1012, Dec. 2020

work page 2020
[5]

Secure quantum key distribution with realistic devices,

F. Xu, X. Ma, Q. Zhang, H.-K. Lo, and J.-W. Pan, “Secure quantum key distribution with realistic devices,”Reviews of Modern Physics, vol. 92, no. 2, p. 025002, May 2020

work page 2020
[6]

Satellite-relayed intercontinental quantum network,

S.-K. Liao, W.-Q. Cai, J. Handsteiner, and et al., “Satellite-relayed intercontinental quantum network,”Physical Review Letters, vol. 120, no. 3, p. 030501, Jan. 2018

work page 2018
[7]

An integrated space- to-ground quantum communication network over 4,600 kilometres,

Y .-A. Chen, Q. Zhang, T.-Y . Chen, and et al., “An integrated space- to-ground quantum communication network over 4,600 kilometres,” Nature, vol. 589, no. 7841, pp. 214–219, Jan. 2021

work page 2021
[8]

Theoretically efficient high-capacity quantum-key-distribution scheme,

G. L. Long and X. S. Liu, “Theoretically efficient high-capacity quantum-key-distribution scheme,”Physical Review A: Atomic, Molec- ular, and Optical Physics, vol. 65, no. 3, p. 032302, Feb. 2002

work page 2002
[9]

Quantum cryptography based on bell’s theorem,

A. K. Ekert, “Quantum cryptography based on bell’s theorem,”Physical Review Letters, vol. 67, no. 6, pp. 661–663, Aug. 1991

work page 1991
[10]

Implementation and security analysis of practical quantum secure direct communication,

R. Qi, Z. Sun, Z. Lin, and et al., “Implementation and security analysis of practical quantum secure direct communication,”Light: Science & Applications, vol. 8, no. 1, p. 22, Feb. 2019

work page 2019
[11]

Security of quantum secure di- rect communication based on wyner’s wiretap channel theory,

J. Wu, Z. Lin, L. Yin, and G.-L. Long, “Security of quantum secure di- rect communication based on wyner’s wiretap channel theory,”Quantum Engineering, vol. 1, no. 4, Dec. 2019

work page 2019
[12]

Secure direct communication with a quantum one-time pad,

F.-G. Deng and G.-L. Long, “Secure direct communication with a quantum one-time pad,”Physical Review A: Atomic, Molecular, and Optical Physics, vol. 69, no. 5, p. 052319, May 2004

work page 2004
[13]

Realization of quantum secure direct communication over 100 km fiber with time-bin and phase quantum states,

H. Zhang, Z. Sun, R. Qi, and et al., “Realization of quantum secure direct communication over 100 km fiber with time-bin and phase quantum states,”Light: Science & Applications, vol. 11, no. 1, Apr. 2022

work page 2022
[14]

The wire-tap channel,

A. D. Wyner, “The wire-tap channel,”Bell System Technical Journal, vol. 54, no. 8, pp. 1355–1367, Oct. 1975

work page 1975
[15]

Broadcast channels with confidential mes- sages,

I. Csisz ´ar and J. K ¨orner, “Broadcast channels with confidential mes- sages,”IEEE Transactions on Information Theory, vol. 24, no. 3, pp. 339–348, May 1978

work page 1978
[16]

The private classical capacity and quantum capacity of a quantum channel,

I. Devetak, “The private classical capacity and quantum capacity of a quantum channel,”IEEE Transactions on Information Theory, vol. 51, no. 1, pp. 44–55, 2005

work page 2005
[17]

Quantum wiretap channel with non-uniform random number and its exponent and equivocation rate of leaked information,

M. Hayashi, “Quantum wiretap channel with non-uniform random number and its exponent and equivocation rate of leaked information,” IEEE Transactions on Information Theory, vol. 61, no. 10, pp. 5595– 5622, 2015

work page 2015
[18]

Common randomness in information theory and cryptography. I. Secret sharing,

R. Ahlswede and I. Csisz ´ar, “Common randomness in information theory and cryptography. I. Secret sharing,”IEEE Transactions on Information Theory, vol. 39, no. 4, pp. 1121–1132, Jul. 1993

work page 1993
[19]

Secret key agreement by public discussion from common information,

U. Maurer, “Secret key agreement by public discussion from common information,”IEEE Transactions on Information Theory, vol. 39, no. 3, pp. 733–742, May 1993

work page 1993
[20]

Design and Implementation of a Practical Quantum Secure Direct Communication System,

Z. Sun, R. Qi, Z. Lin, and et al., “Design and Implementation of a Practical Quantum Secure Direct Communication System,” in2018 IEEE Globecom Workshops (GC Wkshps). Abu Dhabi, United Arab Emirates: IEEE, Dec. 2018, pp. 1–6

work page 2018
[21]

Toward practical quantum secure direct communication: A quantum-memory-free protocol and code design,

Z. Sun, L. Song, Q. Huang, and et al., “Toward practical quantum secure direct communication: A quantum-memory-free protocol and code design,”IEEE Transactions on Communications, vol. 68, no. 9, pp. 5778–5792, Sep. 2020

work page 2020
[22]

Secret-key reconciliation by public discus- sion,

G. Brassard and L. Salvail, “Secret-key reconciliation by public discus- sion,” inAdvances in Cryptology — EUROCRYPT ’93. Springer Berlin Heidelberg, 1993, pp. 410–423

work page 1993
[23]

Key reconciliation for high performance quantum key distribution,

J. Martinez-Mateo, D. Elkouss, and V . Martin, “Key reconciliation for high performance quantum key distribution,”Scientific Reports, vol. 3, p. 1576, Apr. 2013

work page 2013
[24]

General- ized privacy amplification,

C. H. Bennett, G. Brassard, C. Cr ´epeau, and U. Maurer, “General- ized privacy amplification,”IEEE Transactions on Information Theory, vol. 41, no. 6, pp. 1915–1923, Nov. 1995

work page 1915
[25]

Efficient reconciliation protocol for discrete-variable quantum key distribution,

D. Elkouss, A. Leverrier, R. Alleaume, and J. J. Boutros, “Efficient reconciliation protocol for discrete-variable quantum key distribution,” inProc. of IEEE International Symposium on Information Theory, Seoul, Korea, Jun. 2009, pp. 1879–1883

work page 2009
[26]

Semantic security for the wiretap channel,

M. Bellare, S. Tessaro, and A. Vardy, “Semantic security for the wiretap channel,” inAdvances in Cryptology – CRYPTO 2012, vol. 7417, Aug. 2012, pp. 294–311

work page 2012
[27]

Explicit wiretap channel codes via source coding, universal hashing, and distribution approximation, when the channels’ statistics are uncertain,

R. A. Chou, “Explicit wiretap channel codes via source coding, universal hashing, and distribution approximation, when the channels’ statistics are uncertain,”IEEE Transactions on Information Forensics and Security, vol. 18, pp. 117–132, Oct. 2022

work page 2022
[28]

Quantum secure direct communi- cation with private dense coding using general preshared quantum state,

J. Wu, G.-L. Long, and M. Hayashi, “Quantum secure direct communi- cation with private dense coding using general preshared quantum state,” Physical Review Applied, vol. 17, no. 6, p. 064011, Jun. 2022

work page 2022
[29]

Applications of LDPC codes to the wiretap channels,

A. Thangaraj, S. Dihidar, A. R. Calderbank, S. W. McLaughlin, and J.-M. Merolla, “Applications of LDPC codes to the wiretap channels,” IEEE Transactions on Information Theory, vol. 53, no. 8, pp. 2933– 2945, Aug. 2007

work page 2007
[30]

Achieving the secrecy capacity of wiretap channels using polar codes,

H. Mahdavifar and A. Vardy, “Achieving the secrecy capacity of wiretap channels using polar codes,”IEEE Transactions on Information Theory, vol. 57, no. 10, pp. 6428–6443, Oct. 2011

work page 2011
[31]

Performance analysis and design of two edge-type LDPC codes for the BEC wiretap channel,

V . Rathi, M. Andersson, R. Thobaben, J. Kliewer, and M. Skoglund, “Performance analysis and design of two edge-type LDPC codes for the BEC wiretap channel,”IEEE Transactions on Information Theory, vol. 59, no. 2, pp. 1048–1064, Feb. 2013

work page 2013
[32]

Polar coding for the broadcast channel with confidential messages: A random binning analogy,

R. A. Chou and M. R. Bloch, “Polar coding for the broadcast channel with confidential messages: A random binning analogy,”IEEE Transac- tions on Information Theory, vol. 62, no. 5, pp. 2410–2429, May 2016

work page 2016
[33]

Wire- less information-theoretic security,

M. Bloch, J. Barros, M. R. D. Rodrigues, and S. W. McLaughlin, “Wire- less information-theoretic security,”IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2515–2534, Jun. 2008

work page 2008
[34]

Secrecy outage capacity of fading channels,

O. Gungor, J. Tan, C. E. Koksal, H. El-Gamal, and N. B. Shroff, “Secrecy outage capacity of fading channels,”IEEE Transactions on Information Theory, vol. 59, no. 9, pp. 5379–5397, Sep. 2013

work page 2013
[35]

Learning an adversary’s actions for secret communication,

M. Tahmasbi, M. R. Bloch, and A. Yener, “Learning an adversary’s actions for secret communication,”IEEE Transactions on Information Theory, vol. 66, no. 3, pp. 1607–1624, Mar. 2020

work page 2020
[36]

A quantum-memory-free quantum secure direct communication protocol based on privacy am- plification of coded sequences,

S.-J. Su, S.-Y . Wang, and M. R. Bloch, “A quantum-memory-free quantum secure direct communication protocol based on privacy am- plification of coded sequences,” arXiv, Jan. 2026

work page 2026
[37]

Tomamichel,Quantum Information Processing with Finite Resources (arXiv Version)

M. Tomamichel,Quantum Information Processing with Finite Resources (arXiv Version). Springer International Publishing, 2016, vol. 5

work page 2016
[38]

Security of two-way quantum key distribution,

N. J. Beaudry, M. Lucamarini, S. Mancini, and R. Renner, “Security of two-way quantum key distribution,”Physical Review A: Atomic, Molecular, and Optical Physics, vol. 88, no. 6, p. 062302, Dec. 2013

work page 2013
[39]

Leftover hashing against quantum side information,

M. Tomamichel, C. Schaffner, A. Smith, and R. Renner, “Leftover hashing against quantum side information,”IEEE Transactions on Information Theory, vol. 57, no. 8, pp. 5524–5535, 2011

work page 2011
[40]

Entropy accumulation,

F. Dupuis, O. Fawzi, and R. Renner, “Entropy accumulation,”Commu- nications in Mathematical Physics, vol. 379, no. 3, pp. 867–913, Sep. 2020

work page 2020
[41]

Smooth min-entropy lower bounds for approximation chains,

A. Marwah and F. Dupuis, “Smooth min-entropy lower bounds for approximation chains,” arXiv:2308.11736v2, Feb. 2024

work page arXiv 2024
[42]

A fully quantum asymp- totic equipartition property,

M. Tomamichel, R. Colbeck, and R. Renner, “A fully quantum asymp- totic equipartition property,”IEEE Transactions on Information Theory, vol. 55, no. 12, pp. 5840–5847, Dec. 2009

work page 2009
[43]

A Deterministic Algorithm for Com- puting the Weight Distribution of Polar Codes,

H. Yao, A. Fazeli, and A. Vardy, “A Deterministic Algorithm for Com- puting the Weight Distribution of Polar Codes,” arXiv:2102.07362v2, Feb. 2023. APPENDIXA SUPPORTINGLEMMAS Lemma 7.Forρ 1, σ1 ∈ D ◦(H1),ρ 2, σ2 ∈ D ◦(H2), anda∈R +, we haveD(aρ 1 ⊗ρ 2 ∥σ 1 ⊗σ 2) =aloga+ aD(ρ1 ⊗ρ 2 ∥σ 1 ⊗σ 2). Proof. D(aρ1 ⊗ρ 2 ∥σ 1 ⊗σ 2) =tr((aρ 1 ⊗ρ 2) (log (aρ1 ⊗ρ 2)−lo...

work page arXiv 2023

[1] [1]

Quantum cryptography: Public key distribution and coin tossing,

C. H. Bennett and G. Brassard, “Quantum cryptography: Public key distribution and coin tossing,” inProceedings of IEEE International Conference on Computers, Systems, and Signal Processing, vol. 1, Bangalore, India, Dec. 1984, pp. 175–179

work page 1984

[2] [2]

Experimental quantum cryptography,

C. H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, “Experimental quantum cryptography,”Journal of Cryptology, vol. 5, no. 1, pp. 3–28, Jan. 1992

work page 1992

[3] [3]

The security of practical quantum key distribution,

V . Scarani, H. Bechmann-Pasquinucci, N. J. Cerf, and et al., “The security of practical quantum key distribution,”Reviews of Modern Physics, vol. 81, no. 3, pp. 1301–1350, Sep. 2009

work page 2009

[4] [4]

Advances in quantum cryptography,

S. Pirandola, U. L. Andersen, L. Banchi, and et al., “Advances in quantum cryptography,”Advances in Optics and Photonics, vol. 12, no. 4, p. 1012, Dec. 2020

work page 2020

[5] [5]

Secure quantum key distribution with realistic devices,

F. Xu, X. Ma, Q. Zhang, H.-K. Lo, and J.-W. Pan, “Secure quantum key distribution with realistic devices,”Reviews of Modern Physics, vol. 92, no. 2, p. 025002, May 2020

work page 2020

[6] [6]

Satellite-relayed intercontinental quantum network,

S.-K. Liao, W.-Q. Cai, J. Handsteiner, and et al., “Satellite-relayed intercontinental quantum network,”Physical Review Letters, vol. 120, no. 3, p. 030501, Jan. 2018

work page 2018

[7] [7]

An integrated space- to-ground quantum communication network over 4,600 kilometres,

Y .-A. Chen, Q. Zhang, T.-Y . Chen, and et al., “An integrated space- to-ground quantum communication network over 4,600 kilometres,” Nature, vol. 589, no. 7841, pp. 214–219, Jan. 2021

work page 2021

[8] [8]

Theoretically efficient high-capacity quantum-key-distribution scheme,

G. L. Long and X. S. Liu, “Theoretically efficient high-capacity quantum-key-distribution scheme,”Physical Review A: Atomic, Molec- ular, and Optical Physics, vol. 65, no. 3, p. 032302, Feb. 2002

work page 2002

[9] [9]

Quantum cryptography based on bell’s theorem,

A. K. Ekert, “Quantum cryptography based on bell’s theorem,”Physical Review Letters, vol. 67, no. 6, pp. 661–663, Aug. 1991

work page 1991

[10] [10]

Implementation and security analysis of practical quantum secure direct communication,

R. Qi, Z. Sun, Z. Lin, and et al., “Implementation and security analysis of practical quantum secure direct communication,”Light: Science & Applications, vol. 8, no. 1, p. 22, Feb. 2019

work page 2019

[11] [11]

Security of quantum secure di- rect communication based on wyner’s wiretap channel theory,

J. Wu, Z. Lin, L. Yin, and G.-L. Long, “Security of quantum secure di- rect communication based on wyner’s wiretap channel theory,”Quantum Engineering, vol. 1, no. 4, Dec. 2019

work page 2019

[12] [12]

Secure direct communication with a quantum one-time pad,

F.-G. Deng and G.-L. Long, “Secure direct communication with a quantum one-time pad,”Physical Review A: Atomic, Molecular, and Optical Physics, vol. 69, no. 5, p. 052319, May 2004

work page 2004

[13] [13]

Realization of quantum secure direct communication over 100 km fiber with time-bin and phase quantum states,

H. Zhang, Z. Sun, R. Qi, and et al., “Realization of quantum secure direct communication over 100 km fiber with time-bin and phase quantum states,”Light: Science & Applications, vol. 11, no. 1, Apr. 2022

work page 2022

[14] [14]

The wire-tap channel,

A. D. Wyner, “The wire-tap channel,”Bell System Technical Journal, vol. 54, no. 8, pp. 1355–1367, Oct. 1975

work page 1975

[15] [15]

Broadcast channels with confidential mes- sages,

I. Csisz ´ar and J. K ¨orner, “Broadcast channels with confidential mes- sages,”IEEE Transactions on Information Theory, vol. 24, no. 3, pp. 339–348, May 1978

work page 1978

[16] [16]

The private classical capacity and quantum capacity of a quantum channel,

I. Devetak, “The private classical capacity and quantum capacity of a quantum channel,”IEEE Transactions on Information Theory, vol. 51, no. 1, pp. 44–55, 2005

work page 2005

[17] [17]

Quantum wiretap channel with non-uniform random number and its exponent and equivocation rate of leaked information,

M. Hayashi, “Quantum wiretap channel with non-uniform random number and its exponent and equivocation rate of leaked information,” IEEE Transactions on Information Theory, vol. 61, no. 10, pp. 5595– 5622, 2015

work page 2015

[18] [18]

Common randomness in information theory and cryptography. I. Secret sharing,

R. Ahlswede and I. Csisz ´ar, “Common randomness in information theory and cryptography. I. Secret sharing,”IEEE Transactions on Information Theory, vol. 39, no. 4, pp. 1121–1132, Jul. 1993

work page 1993

[19] [19]

Secret key agreement by public discussion from common information,

U. Maurer, “Secret key agreement by public discussion from common information,”IEEE Transactions on Information Theory, vol. 39, no. 3, pp. 733–742, May 1993

work page 1993

[20] [20]

Design and Implementation of a Practical Quantum Secure Direct Communication System,

Z. Sun, R. Qi, Z. Lin, and et al., “Design and Implementation of a Practical Quantum Secure Direct Communication System,” in2018 IEEE Globecom Workshops (GC Wkshps). Abu Dhabi, United Arab Emirates: IEEE, Dec. 2018, pp. 1–6

work page 2018

[21] [21]

Toward practical quantum secure direct communication: A quantum-memory-free protocol and code design,

Z. Sun, L. Song, Q. Huang, and et al., “Toward practical quantum secure direct communication: A quantum-memory-free protocol and code design,”IEEE Transactions on Communications, vol. 68, no. 9, pp. 5778–5792, Sep. 2020

work page 2020

[22] [22]

Secret-key reconciliation by public discus- sion,

G. Brassard and L. Salvail, “Secret-key reconciliation by public discus- sion,” inAdvances in Cryptology — EUROCRYPT ’93. Springer Berlin Heidelberg, 1993, pp. 410–423

work page 1993

[23] [23]

Key reconciliation for high performance quantum key distribution,

J. Martinez-Mateo, D. Elkouss, and V . Martin, “Key reconciliation for high performance quantum key distribution,”Scientific Reports, vol. 3, p. 1576, Apr. 2013

work page 2013

[24] [24]

General- ized privacy amplification,

C. H. Bennett, G. Brassard, C. Cr ´epeau, and U. Maurer, “General- ized privacy amplification,”IEEE Transactions on Information Theory, vol. 41, no. 6, pp. 1915–1923, Nov. 1995

work page 1915

[25] [25]

Efficient reconciliation protocol for discrete-variable quantum key distribution,

D. Elkouss, A. Leverrier, R. Alleaume, and J. J. Boutros, “Efficient reconciliation protocol for discrete-variable quantum key distribution,” inProc. of IEEE International Symposium on Information Theory, Seoul, Korea, Jun. 2009, pp. 1879–1883

work page 2009

[26] [26]

Semantic security for the wiretap channel,

M. Bellare, S. Tessaro, and A. Vardy, “Semantic security for the wiretap channel,” inAdvances in Cryptology – CRYPTO 2012, vol. 7417, Aug. 2012, pp. 294–311

work page 2012

[27] [27]

Explicit wiretap channel codes via source coding, universal hashing, and distribution approximation, when the channels’ statistics are uncertain,

R. A. Chou, “Explicit wiretap channel codes via source coding, universal hashing, and distribution approximation, when the channels’ statistics are uncertain,”IEEE Transactions on Information Forensics and Security, vol. 18, pp. 117–132, Oct. 2022

work page 2022

[28] [28]

Quantum secure direct communi- cation with private dense coding using general preshared quantum state,

J. Wu, G.-L. Long, and M. Hayashi, “Quantum secure direct communi- cation with private dense coding using general preshared quantum state,” Physical Review Applied, vol. 17, no. 6, p. 064011, Jun. 2022

work page 2022

[29] [29]

Applications of LDPC codes to the wiretap channels,

A. Thangaraj, S. Dihidar, A. R. Calderbank, S. W. McLaughlin, and J.-M. Merolla, “Applications of LDPC codes to the wiretap channels,” IEEE Transactions on Information Theory, vol. 53, no. 8, pp. 2933– 2945, Aug. 2007

work page 2007

[30] [30]

Achieving the secrecy capacity of wiretap channels using polar codes,

H. Mahdavifar and A. Vardy, “Achieving the secrecy capacity of wiretap channels using polar codes,”IEEE Transactions on Information Theory, vol. 57, no. 10, pp. 6428–6443, Oct. 2011

work page 2011

[31] [31]

Performance analysis and design of two edge-type LDPC codes for the BEC wiretap channel,

V . Rathi, M. Andersson, R. Thobaben, J. Kliewer, and M. Skoglund, “Performance analysis and design of two edge-type LDPC codes for the BEC wiretap channel,”IEEE Transactions on Information Theory, vol. 59, no. 2, pp. 1048–1064, Feb. 2013

work page 2013

[32] [32]

Polar coding for the broadcast channel with confidential messages: A random binning analogy,

R. A. Chou and M. R. Bloch, “Polar coding for the broadcast channel with confidential messages: A random binning analogy,”IEEE Transac- tions on Information Theory, vol. 62, no. 5, pp. 2410–2429, May 2016

work page 2016

[33] [33]

Wire- less information-theoretic security,

M. Bloch, J. Barros, M. R. D. Rodrigues, and S. W. McLaughlin, “Wire- less information-theoretic security,”IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2515–2534, Jun. 2008

work page 2008

[34] [34]

Secrecy outage capacity of fading channels,

O. Gungor, J. Tan, C. E. Koksal, H. El-Gamal, and N. B. Shroff, “Secrecy outage capacity of fading channels,”IEEE Transactions on Information Theory, vol. 59, no. 9, pp. 5379–5397, Sep. 2013

work page 2013

[35] [35]

Learning an adversary’s actions for secret communication,

M. Tahmasbi, M. R. Bloch, and A. Yener, “Learning an adversary’s actions for secret communication,”IEEE Transactions on Information Theory, vol. 66, no. 3, pp. 1607–1624, Mar. 2020

work page 2020

[36] [36]

A quantum-memory-free quantum secure direct communication protocol based on privacy am- plification of coded sequences,

S.-J. Su, S.-Y . Wang, and M. R. Bloch, “A quantum-memory-free quantum secure direct communication protocol based on privacy am- plification of coded sequences,” arXiv, Jan. 2026

work page 2026

[37] [37]

Tomamichel,Quantum Information Processing with Finite Resources (arXiv Version)

M. Tomamichel,Quantum Information Processing with Finite Resources (arXiv Version). Springer International Publishing, 2016, vol. 5

work page 2016

[38] [38]

Security of two-way quantum key distribution,

N. J. Beaudry, M. Lucamarini, S. Mancini, and R. Renner, “Security of two-way quantum key distribution,”Physical Review A: Atomic, Molecular, and Optical Physics, vol. 88, no. 6, p. 062302, Dec. 2013

work page 2013

[39] [39]

Leftover hashing against quantum side information,

M. Tomamichel, C. Schaffner, A. Smith, and R. Renner, “Leftover hashing against quantum side information,”IEEE Transactions on Information Theory, vol. 57, no. 8, pp. 5524–5535, 2011

work page 2011

[40] [40]

Entropy accumulation,

F. Dupuis, O. Fawzi, and R. Renner, “Entropy accumulation,”Commu- nications in Mathematical Physics, vol. 379, no. 3, pp. 867–913, Sep. 2020

work page 2020

[41] [41]

Smooth min-entropy lower bounds for approximation chains,

A. Marwah and F. Dupuis, “Smooth min-entropy lower bounds for approximation chains,” arXiv:2308.11736v2, Feb. 2024

work page arXiv 2024

[42] [42]

A fully quantum asymp- totic equipartition property,

M. Tomamichel, R. Colbeck, and R. Renner, “A fully quantum asymp- totic equipartition property,”IEEE Transactions on Information Theory, vol. 55, no. 12, pp. 5840–5847, Dec. 2009

work page 2009

[43] [43]

A Deterministic Algorithm for Com- puting the Weight Distribution of Polar Codes,

H. Yao, A. Fazeli, and A. Vardy, “A Deterministic Algorithm for Com- puting the Weight Distribution of Polar Codes,” arXiv:2102.07362v2, Feb. 2023. APPENDIXA SUPPORTINGLEMMAS Lemma 7.Forρ 1, σ1 ∈ D ◦(H1),ρ 2, σ2 ∈ D ◦(H2), anda∈R +, we haveD(aρ 1 ⊗ρ 2 ∥σ 1 ⊗σ 2) =aloga+ aD(ρ1 ⊗ρ 2 ∥σ 1 ⊗σ 2). Proof. D(aρ1 ⊗ρ 2 ∥σ 1 ⊗σ 2) =tr((aρ 1 ⊗ρ 2) (log (aρ1 ⊗ρ 2)−lo...

work page arXiv 2023