ArXiv TLDR

Quantum-Resistant Quantum Teleportation

🐦 Tweet
2604.16101

Xin Jin, Nitish Kumar Chandra, Mohadeseh Azari, Jinglei Cheng, Zilin Shen + 2 more

quant-phcs.CR

TLDR

This paper introduces Quantum-Resistant Quantum Teleportation (QRQT) using post-quantum cryptography to secure classical channels against quantum adversaries.

Key contributions

  • Proposes Quantum-Resistant Quantum Teleportation (QRQT) using post-quantum cryptography for secure classical channels.
  • Identifies quantum memory coherence time as a critical bottleneck for secure distance, PQC overhead, and attack window.
  • Calculates maximum secure teleportation distances (e.g., 191-199 km) under realistic parameters.
  • Analyzes classical bit leakage models, deriving impacts on Holevo quantity and teleportation fidelity.

Why it matters

This paper addresses a critical vulnerability in quantum teleportation by securing its classical channel with post-quantum cryptography. It highlights quantum memory as a hidden bottleneck, providing concrete distance limits and insights into attack dynamics. This work is crucial for designing robust, leakage-resilient quantum communication protocols.

Original Abstract

We propose a quantum-resistant quantum teleportation (QRQT) framework protected by post-quantum cryptography (PQC) to secure the classical correction channel, which is vulnerable to quantum adversaries. By applying PQC to the classical control bits, QRQT eliminates the classical attack surface of quantum teleportation. Our analysis reveals that quantum memory is a hidden bottleneck linking physical and computational security: its finite coherence time simultaneously limits communication distance, constrains tolerable PQC overhead, and restricts the adversary attack window. Under realistic parameters (1 ms coherence, fiber-optic propagation), the maximum secure teleportation distance ranges from 191 km (FrodoKEM-1344) to 199 km (Kyber512). We show that the joint classical-quantum attack probability exhibits a non-monotonic, Bell-shaped profile due to the opposing time dependencies of classical cryptanalysis and quantum decoherence, establishing a bounded optimal attack window beyond which adversarial success decays exponentially. We further analyze how leakage of classical correction bits affects teleportation security under four stochastic leakage models: independent exponential, sequential, burst, and correlated leakage, also accounting for amplitude damping on the shared Bell pair. For each scenario, we derive closed-form expressions for the average Holevo quantity and teleportation fidelity as functions of time, providing measurement-independent upper bounds on extractable information and guiding the design of leakage-resilient quantum communication protocols.

📬 Weekly AI Paper Digest

Get the top 10 AI/ML arXiv papers from the week — summarized, scored, and delivered to your inbox every Monday.