Quantum-Resistant Quantum Teleportation

• URL: http://arxiv.org/abs/2604.16101v1
• Date: Fri, 17 Apr 2026 14:36:22 GMT
• Title: Quantum-Resistant Quantum Teleportation
• Abstract summary: We propose a quantum-resistant quantum teleportation framework protected by post-quantum cryptography (PQC)<n>By applying PQC to the classical control bits, QRQT eliminates the classical attack surface of quantum teleportation.<n>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.
• Score: 14.393446912575362
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Fundamental Limits on QBER and Distance in Quantum Key Distribution [0.0]
  We establish the maximum quantum bit error rate compatible with secure QKD and derive corresponding upper bounds on communication distance.<n>By connecting information-theoretic limits to realistic physical noise models, we obtain universal bounds on achievable distances in fiber and free-space links.
  arXiv  Detail & Related papers  (2026-02-25T19:00:02Z)
• Practical quantum teleportation with finite-energy codebooks [0.0]
  Quantum teleportation in the microwave regime provides an important tool for high-fidelity remote quantum operations.<n>We consider practical application scenarios for the microwave analog quantum teleportation protocol based on continuous-variable states.<n>Our results contribute to the general development of quantum communication protocols.
  arXiv  Detail & Related papers  (2025-12-29T11:25:29Z)
• Simultaneous Classical and Quantum Communications: Recent Progress and Three Challenges [52.931372025288844]
  We explore novel protocols that enable simultaneous classical and quantum communications.<n>We extend quantum communication capabilities beyond traditional optical bands into the terahertz.<n>We identify open problems that must be addressed to facilitate practical implementation.
  arXiv  Detail & Related papers  (2025-12-11T00:27:08Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• On the Role of Quantum Communication and Loss in Attacks on Quantum Position Verification [0.0]
  We show that any protocol secure against classical communication can be transformed into a protocol secure against quantum communication. We observe that any multi-round QPV protocol can be attacked with a linear amount of entanglement if the loss is high enough.
  arXiv  Detail & Related papers  (2022-08-08T18:01:22Z)
• Long-distance twin-field quantum key distribution with entangled sources [4.334669226849793]
  We propose a scheme to implement TFQKD with an entangled coherent state source in the middle to increase its range. Our work is a promising step toward long-distance secure communication and is greatly compatible with future global quantum network.
  arXiv  Detail & Related papers  (2021-11-06T02:01:42Z)
• The Entanglement-Assisted Communication Capacity over Quantum Trajectories [6.836162272841265]
  We show that indefinite causal order of quantum channels enables the violation of bottleneck capacity. We derive capacity expressions of entanglement-assisted classical and quantum communication for arbitrary quantum Pauli channels.
  arXiv  Detail & Related papers  (2021-10-15T13:09:54Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.