The Fidelity-Throughput Trade-off in Quantum Networks

You are reading version 1 of this direction, frozen 2026-10-04. The latest version is version 2.

Version 1 of 29 papers22 conceptsfrozen 2026-10-04

In classical networking, we usually care about two things: how much data we can send (bandwidth) and how fast it gets there (latency). If a packet arrives with a few flipped bits, we use error-correcting codes to fix it. In quantum networking, the "data" is often entanglement, and the "quality" is called fidelity.

Unlike classical bits, quantum states are incredibly fragile. As they travel through fiber optics or free space, they interact with the environment and lose their "quantumness." If the fidelity of an entangled pair drops too low, it becomes useless for quantum computation or secure communication. To fix this, we use a process called entanglement purification (or distillation). However, as recent research shows, this creates a brutal trade-off: the higher the quality you demand, the less "data" the network can actually deliver.

The Cost of Purity

Entanglement purification is a probabilistic process that consumes multiple low-quality entangled pairs to produce a single higher-quality pair. Imagine trying to build a high-quality rope by braiding together several frayed ones; you end up with a stronger rope, but you have much less total length than you started with.

In On the Capacity Region of a Quantum Switch with Entanglement Purification, Nitish K. Panigrahy, Thirupathaiah Vasantam, Leandros Tassiulas, and Don Towsley quantify this "throughput penalty." They show that as the target fidelity threshold increases, the capacity region—the set of request rates a quantum switch can handle—contracts exponentially. Under realistic noise conditions, demanding near-perfect fidelity can effectively choke the network's throughput to near zero because the overhead of multi-round purification consumes resources faster than they can be generated.

The Distillation Dilemma

One might assume that more purification is always better, but quantum systems face a unique "race against the clock." Qubits have a limited coherence time; they "rot" while sitting idle.

In Architectures for Multinode Superconducting Quantum Computers, James S. Ang, Sophia E. Economou, and their colleagues identify a critical bottleneck: the latency of purification. While you are busy performing the gates and measurements required to distill a high-fidelity link between two nodes, the other qubits in your computer are decohering. If the purification process takes too long, the net benefit is negative—the idle qubits lose more "quality" from waiting than the link gains from purification. This suggests that in near-term multinode systems, we may sometimes have to settle for "good enough" links to keep the overall algorithm from failing.

Strategic Scheduling and Routing

Because purification is so expensive, the order in which we perform operations matters. Panigrahy et al. analyzed two main strategies:

  1. Purify-and-Swap: Clean up the noise on individual links first, then connect them to form a long-distance path.
  2. Swap-and-Purify: Connect the noisy links first, then try to clean up the resulting long-distance entanglement.

Their mathematical framework proves that "Purify-and-Swap" generally yields a larger capacity region. Swapping (connecting two links) inherently reduces fidelity; if you start with low-quality links, the cumulative noise after a swap can become so high that the state becomes impossible to purify.

This logic extends to larger network topologies. In Efficient Entanglement Routing for Satellite-Aerial-Terrestrial Quantum Networks, Yanmin Gong and Yu Zhang argue that routing protocols cannot simply maximize throughput like classical internet routers. They must jointly optimize the path and the purification rate. If a protocol ignores fidelity, it might successfully deliver a high volume of entangled pairs that are too noisy to be used, effectively wasting 100% of the network's effort.

A New Constraint for Network Design

The fundamental shift in this research area is treating fidelity not as a static property of a wire, but as a dynamic resource that can be traded for throughput.

As Mahdi Chehimi and Walid Saad point out in their work on RIS-Assisted Entanglement Distribution, prioritizing raw transmission speed over signal quality can lead to an 83% drop in fidelity. To build a functional Quantum Internet, researchers like Madhav Krishnan Vijayan and Eric Chitambar are developing one-shot distillation bounds to help practitioners calculate exactly how much "gate imperfection" or noise they can tolerate to meet a specific purity target.

Ultimately, the capacity of a quantum network isn't just a number of bits per second—it is a multidimensional surface where every gain in state purity must be paid for with a sacrifice in speed.

Papers in this version

History & citationVersion 2 · 2026-10-04

Current · Permanent link

  1. Version 2 (latest) · 2026-10-04 · 11 papers
  2. Version 1 · 2026-10-04 · 9 papers
Cite this direction

Latest version (a living page):

@misc{lacuna_fidelity_throughput_tradeoff_032dd6f9,
  title = {fidelity-throughput tradeoff},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/fidelity-throughput-tradeoff/rdr_032dd6f9c2cb4f3f9bc4881164ad2824},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_the_fidelity_throughput_trade_off_in_qua_032dd6f9_v1,
  title = {The Fidelity-Throughput Trade-off in Quantum Networks},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/the-fidelity-throughput-trade-off-in-quantum-networks/rdr_032dd6f9c2cb4f3f9bc4881164ad2824/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}