⚛️ quantum physics

Quantum-Resistant Quantum Teleportation

This paper proposes a quantum-resistant teleportation framework that secures the classical correction channel using post-quantum cryptography, revealing that finite quantum memory coherence time creates a non-monotonic attack window and imposes strict distance limits (approximately 191–199 km) while providing analytical bounds on fidelity and information leakage under various stochastic attack models.

Original authors: Xin Jin, Nitish Kumar Chandra, Mohadeseh Azari, Jinglei Cheng, Zilin Shen, Kaushik P. Seshadreesan, Junyu Liu

Published 2026-04-20

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Xin Jin, Nitish Kumar Chandra, Mohadeseh Azari, Jinglei Cheng, Zilin Shen, Kaushik P. Seshadreesan, Junyu Liu

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Big Picture: Sending a Ghost Without Losing the Map

Imagine you want to send a fragile, invisible ghost (a quantum state) from your house (Alice) to your friend's house (Bob) across the country. You can't put the ghost in a box and mail it; if you touch it, it disappears.

Instead, you use a special trick called Quantum Teleportation. You and Bob share a pair of "magic linked dice" (entangled particles). You roll your die and the ghost together, which instantly changes the state of Bob's die. However, Bob's die is now scrambled. To unscramble it and see the ghost, he needs a secret code (two bits of information) that you generate from your roll.

The Problem:
In the old days, we sent this secret code over a regular phone line. But now, imagine a super-smart hacker with a "Quantum Computer" (a super-weapon) is listening to that phone line. They can break the lock on the code in seconds. If they get the code before Bob, they can steal the ghost, and Bob gets nothing.

The Solution (QRQT):
This paper proposes a new way to send that secret code. Instead of using old locks (like RSA), we use Post-Quantum Cryptography (PQC). These are new, super-strong locks that even a quantum computer can't break easily.

But here is the twist: Time is the enemy.

The Hidden Bottleneck: The "Melting Ice Cube"

Here is the catch: While the hacker is trying to pick the new, super-strong lock on the phone line, Bob is holding the "ghost" in his hand. But the ghost is like an ice cube sitting in a warm room. It starts melting (decohering) the moment it arrives.

The Hacker's Goal: Break the lock on the phone line. This takes time. The stronger the lock (better security), the longer it takes.
Bob's Problem: The ice cube (the quantum memory) melts after a certain time (e.g., 1 millisecond).

The Paper's Discovery:
The authors realized that security and distance are locked in a tug-of-war.

If you use a very heavy, super-strong lock (high security), it takes the hacker longer to break. But it also takes the computer longer to process the lock. By the time the code arrives, Bob's ice cube has melted. The teleportation fails.
If you use a lighter lock, the code arrives faster, but a quantum hacker might break it before the ice melts.

The Result:
They calculated that with current technology (where the ice cube lasts about 1 millisecond), you can only teleport a secure ghost about 190 to 200 kilometers. If you try to go further, the signal takes too long to travel, and the ice melts before the code arrives.

The "Bell-Shaped" Danger Zone

The paper also looked at the hacker's chances of success. They found a funny pattern:

Too Fast: If the hacker tries to break the code immediately, they haven't had enough time to do the math. They fail.
Too Slow: If they wait too long, the ice cube (the quantum state) has melted completely. Even if they have the code, the ghost is gone.
Just Right: There is a tiny, specific window of time where the hacker has just enough time to break the code, but the ice cube hasn't melted yet.

This creates a "Bell Curve" of danger. The hacker has a "sweet spot" to attack, but if they miss that window, their chances of success drop to zero. This actually makes the system safer than we thought, because the window of opportunity is so short.

Leaking Secrets: The "Slow Drip" vs. The "Burst"

The authors also asked: "What if the secret code leaks out slowly, bit by bit, instead of all at once?"

They modeled four ways this could happen, like water leaking from a bucket:

Independent Drip: Bit 1 leaks, then later Bit 2 leaks.
Sequential: Bit 1 must leak before Bit 2 can leak.
Burst: Both bits leak at the exact same moment (a pipe burst).
Correlated: They leak together, but not perfectly.

They found that the timing of the leak matters more than the leak itself. If the code leaks slowly, the hacker can piece it together while the ghost is still frozen. If it leaks all at once, the hacker might get the code too late.

The Takeaway

This paper is like a blueprint for building a Quantum Internet. It tells us:

We can protect quantum teleportation using new, unbreakable locks (PQC).
But we can't go too far. The distance is limited by how long we can keep the "ice cube" (quantum memory) from melting.
Security is a race against time. The hacker is racing against the melting ice. If we can keep the ice frozen longer (better quantum memory), we can send secrets further and use stronger locks.

In short: We have the keys to the future of quantum communication, but we need to build better freezers (quantum memories) to keep the secrets safe on the journey.

1. Problem Statement

Quantum teleportation is a fundamental primitive for quantum networks, enabling the transfer of unknown quantum states using shared entanglement and classical communication. However, the protocol relies on a classical control channel to transmit measurement outcomes (two classical bits) from the sender (Alice) to the receiver (Bob) so Bob can apply the necessary Pauli corrections.

The Vulnerability: Current classical channels often rely on public-key cryptography (e.g., RSA, ECC) which is vulnerable to Shor's algorithm on quantum computers. If an adversary breaks the classical encryption, they can intercept the correction bits and reconstruct the teleported state.
The Gap: Existing solutions like Quantum Key Distribution (QKD) or Wegman-Carter authentication are either infrastructure-heavy or require pre-shared keys, making them difficult to scale. Furthermore, simply applying Post-Quantum Cryptography (PQC) introduces computational latency.
The Core Conflict: Quantum teleportation requires the receiver's qubit to remain in quantum memory while waiting for the classical correction bits. PQC encryption/decryption adds latency. If the classical processing time exceeds the quantum memory coherence time, the quantum state decoheres before it can be corrected, rendering the teleportation useless. This creates a hidden bottleneck where computational security (PQC) and physical security (coherence) are inextricably linked.

2. Methodology

The authors propose the Quantum-Resistant Quantum Teleportation (QRQT) framework and analyze it through three complementary lenses:

A. The QRQT Framework

Mechanism: The underlying teleportation protocol remains unchanged. The classical correction bits ( $M_1, M_2$ ) are secured using a hybrid PQC scheme (e.g., CRYSTALS-Kyber for key encapsulation and AES for symmetric encryption).
Timing Constraint: The total time $\tau_m$ includes Bell-pair preparation, measurement, PQC encryption/decryption, and classical transmission. Successful teleportation requires the quantum memory coherence time ( $T_{coh}$ ) to satisfy $T_{coh} > \tau_m$ .

B. Hybrid Threat Model (Joint Attack Analysis)

The authors model an adversary (Eve) who must simultaneously compromise two channels within a specific time window:

Classical Attack: Eve attempts to break the PQC scheme using lattice reduction (BKZ algorithm) against the underlying Learning With Errors (LWE) problem. The success probability $P_{LWE}(t)$ increases with time as she accumulates computational power.
Quantum Attack: Eve attempts a SWAP attack, intercepting the entangled qubit intended for Bob and storing it in her own quantum memory. The success probability $P_{SWAP}(t)$ decreases with time due to quantum decoherence (modeled via amplitude damping or depolarizing channels).

Joint Probability: The total attack success is $P_{joint}(t) = P_{LWE}(t) \times P_{SWAP}(t)$ .

C. Information-Theoretic Analysis (Holevo Bound)

To assess security against partial leakage (e.g., side-channel attacks where bits leak over time), the authors analyze the Holevo quantity ( $\chi$ ).

They model four stochastic leakage scenarios: Independent Exponential, Sequential, Burst, and Correlated leakage.
They derive closed-form expressions for the expected Holevo information and the adversary's optimal reconstruction fidelity as functions of time, accounting for amplitude damping in the entangled resource.

3. Key Contributions

QRQT Framework: A novel protocol integrating PQC into the classical correction path of quantum teleportation, identifying the critical trade-off between cryptographic overhead and quantum memory constraints.
Joint Security Landscape: The discovery that quantum memory acts as a "hidden bottleneck." The authors demonstrate that the joint attack probability $P_{joint}(t)$ exhibits a non-monotonic, Bell-shaped profile. There is a bounded "optimal attack window" ( $t^*$ ); if the adversary takes longer than $t^*$ to break the PQC, the quantum state decoheres, and the attack fails.
Feasibility Quantification: The paper quantifies the maximum secure teleportation distance under realistic parameters (1 ms coherence time).
- Kyber512: ~199 km
- FrodoKEM-1344: ~191 km
- Insight: Stronger PQC schemes (higher security levels) impose higher latency, reducing the maximum feasible distance.
Stochastic Leakage Models: A rigorous information-theoretic analysis of how partial or delayed leakage of classical bits degrades security, providing measurement-independent upper bounds on extractable information.

4. Key Results

Distance-Security Tradeoff: Under realistic conditions (1 ms coherence, fiber-optic propagation), the maximum secure distance is limited to approximately 191–199 km. The choice of PQC algorithm directly dictates this limit; heavier algorithms shrink the operational window.
The Bell-Shaped Attack Window: The analysis reveals that security is not static. There is a specific time $t^*$ $t^{*}$ where the probability of a successful joint attack is maximized.
- Before $t^*$ : The adversary has not yet broken the PQC.
- After $t^*$ : The quantum state has decohered, making recovery impossible even if the PQC is broken.
- This establishes a natural "expiration date" for the vulnerability of the intercepted state.
Leakage Impact: In the information-theoretic analysis, the Holevo quantity decreases monotonically as leakage progresses. The "Burst" leakage model (simultaneous compromise) causes the fastest drop in security, while "Sequential" leakage allows for a more gradual degradation of the adversary's reconstruction fidelity.
Fidelity vs. Time: The adversary's ability to reconstruct the state (fidelity) increases as they gain more classical bits, but this is capped by the decoherence of the quantum memory.

5. Significance

Bridging Theory and Practice: The paper moves beyond theoretical security proofs to address the physical realities of quantum networks. It highlights that the security of a quantum protocol cannot be analyzed in isolation from the hardware limitations (coherence time) of the quantum memory.
Design Guidelines for Quantum Networks: The results provide concrete design constraints for future quantum internet infrastructure. Network architects must balance the selection of PQC algorithms (security level) against the capabilities of available quantum memory technologies to ensure end-to-end security.
New Security Paradigm: The identification of the "Bell-shaped" attack window introduces a new concept in quantum cryptography: temporal security. It suggests that even if a cryptographic scheme is theoretically breakable, the physical decay of the quantum state may render the attack futile if the computation takes too long.
Robustness Against Side Channels: By modeling various leakage scenarios, the paper offers a framework for assessing the resilience of teleportation protocols against realistic, imperfect side-channel attacks, guiding the development of more robust quantum communication standards.

In summary, this work establishes that quantum memory coherence is the fundamental limiter of secure quantum teleportation in a post-quantum world, creating a unique interplay where the adversary's computational power and the physical decay of quantum information compete to define the system's security.