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.
We introduce a robust quantum communication protocol that integrates classical error-control coding, entanglement distribution, and superdense coding. Classical error-correcting codes are used to mitigate dark counts and photon losses by determining the positions of qubit transmissions and protecting the data embedded through superdense coding. We derive conditions on the employed codes that guarantee successful error correction under a bounded error-frequency model. Moreover, upper bounds are derived on the performance of conventional superdense coding protected by classical error correction. It is shown that, under the same constraints on error frequency, suitable code configurations of the proposed protocol can exceed those upper bounds both in terms of data rate and energy efficiency. Finally, we develop a physical error model based on fiber attenuation, detector efficiency, dark counts, and time-slot duration, and use it to evaluate the effective performance of different configurations of error-correcting codes. The proposed approach is primarily suited for short-distance quantum links, as in Quantum Local Area Network (QLAN) where it 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
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 complementary strengths of different quantum memory technologies into a single hybrid repeater architecture. An important constituent of such an architecture is a hybrid repeater which combines type-1 memories, characterized by fast entanglement generation rates and suitability for multiplexing, and type-2 memories that offer long coherence times and low two-qubit gate error rates. Taking the resource-intensive nature of hybrid nodes into account, we propose and analyze repeater chains in which only a subset of nodes need to be hybrid, while the remaining nodes are simpler first-generation repeaters with no error-correction capability. Through detailed Monte Carlo simulations of fault-tolerant encoded repeater chain protocols based on the three-qubit phase-flip repetition code, the $[[7,1,3]]$ Steane code, and the $[[9,1,3]]$ Shor code, we demonstrate that these hybrid architectures outperform pure architectures based on a single memory platform in terms of end-to-end entanglement distribution rate. In our study we develop a full circuit-level noise model of our architectures and examine the impact of an imperfect interface between the two platforms on our hybrid architecture. We also develop a modified version of the swap-as-soon-as-possible policy with multiplexing, more suited to our architecture where some nodes perform error-correction while others do not. This modified policy significantly reduces the information storage time in memory qubits relative to the previously considered swap policies in encoded repeater chains.
S. Haldar, Saikat Guha, Don Towsley et al.· 0 citations
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, we adopt queueing models, where quantum links can have different characteristics: memory capacities, entanglement attempt rates and success probabilities, as well as classical communication latencies. We develop a model for estimating E2E entanglement fidelity, while taking into account the heterogeneous dephasing and depolarizing dynamics of quantum memories and Bell-state measurements in entanglement swapping as well as classical communication delays and noises. Finally, with the help of our models for approximating the E2E entanglement throughput and fidelity, we use the maximum waiting times of entanglements in quantum memories at the repeater as optimization variables to maximize the E2E entanglement throughput while ensuring required minimum E2E fidelity.
V. Mai, Richard J. La, Abdella Battou et al.· 0 citations
Conventional Quantum Key Distribution (QKD) requires the transmission of qubits proportional to or exceeding the length of the key, as protocols such as BB84 transmit more qubits than the final key size due to basis sifting and privacy amplification. Since quantum networks are still in their infancy and have limited capacity, this overhead puts significant pressure on network resources. To address this issue, we propose a Multi-Qubit Greenberger--Horne--Zeilinger (GHZ) State-based QKD scheme that reduces the number of qubits transmitted over the quantum channel. The proposed method transmits one GHZ qubit between endpoints and reuses the resulting entanglement to convey multiple classical key bits with the help of Quantum Non-Demolition (QND) measurements. Under the stated assumptions on authenticated classical communication, local reset verification, and bounded-error QND discrimination, one can transfer $L$ classical bits by generating an (L+1)-qubit GHZ state and transferring one qubit to the remote party. We verify correctness using the NetSquid quantum network simulator: the protocol achieves 100\% raw-key fidelity for keys of length up to 12 bits under both ideal conditions and depolarizing noise up to p = 0.005 per round. We further show that the proposed QKD algorithm can be extended to multi-party QKD and server-client deployment. The proposed scheme offers a transmitted-qubit-efficient, noise-tolerant alternative for bandwidth-limited quantum networks.
Tasdiqul Islam, Rasman Mubtasim Swargo, Engin Arslan et al.· 0 citations
We have investigated the entanglement distribution and quantum teleportation in quantum passive optical networks, where an entangled state is distributed between the central node and multiple end users through lossy fibers and passive optical splitter/combiner. The entanglement degradation is quantified using logarithmic negativity and teleportation fidelity, both in nonassisted and assisted strategies. We find that nonassisted teleportation fidelity rapidly drops below the classical limit as the number of users increases (possible up to five users), while assisted teleportation remains robust against both network size and photon loss, provided that the distributed entangled resource has sufficiently high fidelity. These results highlight the fundamental limitations of bipartite schemes and establish cooperative assisted strategies as essential primitives for scalable fiber-to-the-home quantum access networks and the quantum internet with several end users.
Amir Mohammad Yaghoobianzadeh, J. A. Salehi· IEEE Transactions on Quantum...· 1 citation
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, Jinzhao 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.
