Resource-Adaptive Teleportation Under Imperfect Entanglement: A Code-Puncturing Framework

• URL: http://arxiv.org/abs/2602.12309v1
• Date: Thu, 12 Feb 2026 13:06:31 GMT
• Title: Resource-Adaptive Teleportation Under Imperfect Entanglement: A Code-Puncturing Framework
• Abstract summary: Punctured codes improve reliability across a broader range of purification regimes, enabling target reliability to be met without hardware-level code switching.<n>This is corroborated by numerical results, showing that different punctured codes achieve the lowest logical error probability in different operating regimes.<n>Overall, puncturing enables adaptation to varying entanglement conditions and reliability requirements while reusing a single stabilizer structure.
• Score: 35.837583125622984
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum teleportation is a foundational protocol for sending quantum information through entanglement distribution and classical communication. Assuming ideal classical communication, the reliability of quantum teleportation is limited by the fidelity of the shared EPR pairs. This reliability can be improved through two mechanisms: entanglement purification and quantum error correction (QEC). Using both techniques in concert requires flexible QEC rates, since purification alters the structure of errors induced by imperfect-EPR teleportation, and fixed-rate codes cannot be uniformly effective across purification regimes or reliability targets. In this work, we supplement purification with punctured QEC codes, providing a family of code variants that can be adapted to error-channel characteristics and reliability targets. Punctured codes improve teleportation reliability across a broader range of purification regimes, enabling target reliability to be met without hardware-level code switching. This is corroborated by numerical results, showing that different punctured codes achieve the lowest logical error probability in different operating regimes, and that selecting among them reduces logical error relative to fixed-rate encoded teleportation. This reduction relaxes the requirement on the initial EPR fidelity or purification needed to achieve a target reliability. Overall, puncturing enables adaptation to varying entanglement conditions and reliability requirements while reusing a single stabilizer structure.

Related papers

• Classical Communication Protocol based on Joint Classical-Quantum Coding [34.13664611440956]
  We introduce a robust quantum communication protocol that integrates classical error-control coding, entanglement distribution, and superdense coding.<n>We derive conditions on the employed codes that guarantee successful error correction under a bounded error-frequency model.<n>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.
  arXiv  Detail & Related papers  (2026-09-15T10:14:27Z)
• Theory of approximate quantum error correction and the error-set model [53.73800998389749]
  We develop a theory of approximate quantum error correction based on the error-set model.<n>Code correcting a given error set automatically protects against every channel whose Kraus operators lie in their linear span.<n>This linearity gives rise to code distance, the equivalence between erasures and general errors, and a theory ofally good codes.
  arXiv  Detail & Related papers  (2026-07-25T02:15:33Z)
• Latency-Constrained Encoded Quantum Teleportation with Punctured Codes [37.71240278740115]
  We focus on encoded teleportation, in which quantum information is encoded using a quantum error-correcting code and transmitted as a codeword.<n>We develop a unified framework that captures the interaction between entanglement availability, decoherence, and coding decisions.<n> Numerical results show that encoded teleportation can provide substantial reliability gains over uncoded transmission.
  arXiv  Detail & Related papers  (2026-07-22T05:38:32Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Uncorrectable-error-injection based reliable and secure quantum communication [0.0]
  Quantum teleportation is widely used to transmit arbitrary quantum states. It requires entanglement swapping and purification to distribute entanglements over long distances. These challenges limit its practicality for real-world quantum communication networks. We propose a novel scheme for directly transmitting quantum states encoded using error-correction codes.
  arXiv  Detail & Related papers  (2024-11-22T03:34:26Z)
• Boosting end-to-end entanglement fidelity in quantum repeater networks via hybridized strategies [0.6123149401802668]
  Quantum networks are expected to enhance distributed quantum computing and quantum communication over long distances. We show that a quantum network utilizing only entanglement purification or only quantum error correction as error management strategies cannot create Bell pairs with fidelity that exceeds the requirement for a secured quantum key distribution protocol for a broad range of hardware parameters.
  arXiv  Detail & Related papers  (2024-05-16T07:38:17Z)
• Reliable Quantum Communications based on Asymmetry in Distillation and Coding [35.693513369212646]
  We address the problem of reliable provision of entangled qubits in quantum computing schemes. We combine indirect transmission based on teleportation and distillation; (2) direct transmission, based on quantum error correction (QEC) Our results show that ad-hoc asymmetric codes give, compared to conventional QEC, a performance boost and codeword size reduction both in a single link and in a quantum network scenario.
  arXiv  Detail & Related papers  (2023-05-01T17:13:23Z)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• An efficient combination of quantum error correction and authentication [1.1602089225841632]
  We study whether it can be done more efficiently by combining the two functionalities in a single code. We show that the threshold code needs polylogarithmically fewer qubits to achieve the same level of security and robustness.
  arXiv  Detail & Related papers  (2022-11-17T17:25:39Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Quantum Error Correction via Noise Guessing Decoding [0.0]
  Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime.
  arXiv  Detail & Related papers  (2022-08-04T16:18:20Z)
• Optimizing quantum codes with an application to the loss channel with partial erasure information [1.90365714903665]
  We investigate the loss channel, which plays a key role in quantum communication, and in particular in quantum key distribution over long distances. We develop a numerical set of tools that allows to optimize an encoding specifically for recovering lost particles both deterministically and probabilistically. This allows us to arrive at new codes ideal for the distribution of entangled states in this particular setting, and also to investigate if encoding in qudits or allowing for non-deterministic correction proves advantageous compared to known QECCs.
  arXiv  Detail & Related papers  (2021-05-27T15:24:57Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

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.