Skip to content

Latency-Constrained Encoded Quantum Teleportation with Punctured Codes

Jul 2026 · arXiv.org · Vol abs/2607.19770 · 0 citations · 16 references
Physics Computer Science Mathematics

TL;DR

This work focuses on encoded teleportation, in which quantum information is encoded using a quantum error-correcting code and transmitted as a codeword, and develops a unified framework that captures the interaction between entanglement availability, decoherence, and coding decisions.

Abstract

Quantum teleportation is a key protocol for transmitting quantum information using entanglement and classical communication. Its reliability is constrained by both the availability and fidelity of shared entangled pairs, which are affected by stochastic generation and memory decoherence. In this work, we focus on encoded teleportation, in which quantum information is encoded using a quantum error-correcting code and transmitted as a codeword. We evaluate reliability in terms of logical error probability, considering latency-constrained settings where entanglement is accumulated over time and degrades while in memory. We develop a unified framework that captures the interaction between entanglement availability, decoherence, and coding decisions. Our results show that the benefits of longer codes depend on the availability and fidelity of entangled pairs, as acquiring additional resources introduces delays that can reduce their quality. To address this latency-reliability tradeoff, we leverage code puncturing to enable flexible encoded teleportation, allowing the effective code length to adapt across different latency regimes while preserving a common stabilizer structure. Numerical results show that encoded teleportation can provide substantial reliability gains over uncoded transmission under a common entanglement-acquisition latency constraint, and that selecting appropriate punctured codes improves performance across varying latency budgets. Overall, our results highlight the importance of resource-aware adaptation for reliable quantum networking.

View source

Similar papers

Preprint Sep 2026

Classical Communication Protocol based on Joint Classical-Quantum Coding

A robust quantum communication protocol that integrates classical error-control coding, entanglement distribution, and superdense coding, and superdense coding is introduced that can provide high communication throughput while integrating entanglement distribution directly into the communication process.

Kristian Skafte Jensen, René Bødker Christensen, Čedomir Stefanović et al. · 0 citations
Preprint Sep 2026

Scalable entanglement distribution using encoded hybrid repeater chains

Long-distance entanglement distribution requires error correction protocols to compensate for qubit decoherence in quantum memories and noise introduced during entanglement swapping. We argue that repeater chains with error-correction capabilities should exploit more than one physical platform, combining the complement...

S. Haldar, Saikat Guha, Don Towsley et al. · 0 citations
Preprint Aug 2026

On the Swapping Capacity of a Quantum Repeater

We study the capacity of a memory-based quantum repeater in entanglement swapping between two quantum links with either single or multiple memories, which we refer to as the end-to-end (E2E) entanglement throughput, subject to a constraint on the minimum fidelity. In order to approximate the E2E entanglement throughput...

V. Mai, Richard J. La, Abdella Battou et al. · 2 citations
Preprint Aug 2026

Scalable Quantum Key Distribution via GHZ Entanglement and Qubit Reuse

A Multi-Qubit Greenberger--Horne--Zeilinger (GHZ) State-based QKD scheme that reduces the number of qubits transmitted over the quantum channel and can be extended to multi-party QKD and server-client deployment.

Tasdiqul Islam, Rasman Mubtasim Swargo, Engin Arslan et al. · 0 citations
Open access 2026

Entanglement Distribution and Teleportation in Assisted and Scalable Quantum Access Networks

It is found that nonassisted teleportation fidelity rapidly drops below the classical limit as the number of users increases, while assisted teleportation remains robust against both network size and photon loss, provided that the distributed entangled resource has sufficiently high fidelity.

Amir Mohammad Yaghoobianzadeh, J. A. Salehi · 1 citation
Preprint Aug 2026

Distributed Trotterization with optimal time-scaling entanglement cost

A simple repeat-until-success protocol is introduced that makes entanglement consumption adaptive to interaction strength and yields a total entanglement cost that scales linearly with evolution time and remains independent of Trotter error.

Tian-Feng Feng, Jin-Zhao Sun, Yun-Long Xiao et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.