Quantum Strategies to Overcome Classical Multiplexing Limits

1. Problem Statement

Near-term quantum networks face a critical bottleneck: low quantum communication rates. This limitation degrades performance by reducing operating speeds and forcing qubits to be stored in noisy quantum memories for extended periods. Due to decoherence, long storage times reduce state fidelity, making many-qubit applications (such as Blind Quantum Computation or distributed sensing) infeasible.

While classical multiplexing (combining multiple signals in time, space, or frequency) is a standard technique to increase channel capacity in classical networks, its application to quantum networks has limits. Standard classical multiplexing does not utilize quantum coherence between channels and fails to account for decoherence rates that vary during protocol execution. The authors aim to derive the fundamental limits of classical multiplexing for quantum protocols and propose quantum multiplexing strategies that surpass these limits.

2. Methodology

The paper employs a combination of theoretical derivation, semiclassical limit analysis, and numerical simulation to evaluate multiplexing strategies.

• Metric Definition: The authors define the multiplexing improvement factor ($m_s$) as the ratio of the execution rate of an $s$-qubit protocol with $M$ multiplexing resources to the rate without multiplexing:
  $$m_s = \frac{R_{s|F}(M)}{R_{s|F}(1)}$$
  where $R$ is the rate achieved at a minimum final state fidelity $F$.

• Semiclassical Limits: The authors first derive upper bounds for multiplexing advantages assuming no quantum correlations between attempts (Semiclassical Limits). They model the problem using "scan statistics" (the "window problem"), where $s$ successful attempts must occur within a time window $w$ determined by memory coherence times ($T_2$).

  • For single-qubit protocols ($s=1$), the limit is linear: $m \leq M$.
  • For many-qubit protocols ($s > 1$), the limit is superlinear but bounded: $m_s \leq M \binom{Ms-1}{s-1}$. In the limit of large windows ($w \gg s$), this approaches $m_s \leq M^s$.

• Quantum Strategies: The paper introduces two specific techniques that utilize quantum coherence to break these semiclassical bounds:

  1. Single Click Quantum Multiplexing: Utilizes coherence between spatial modes (e.g., splitting a single photon across multiple paths) to improve rates in asymmetric networks.
  2. Multi-Server Multiplexing: Utilizes a network of interconnected servers to serve a single client, exploiting fast inter-server links to mitigate decoherence in memory.

3. Key Contributions

A. Derivation of Semiclassical Limits

The authors rigorously derive that without quantum coherence, the multiplexing advantage for $s$-qubit protocols is bounded by $m_s \leq M^s$ (in the low-success probability limit). This establishes a benchmark: any strategy exceeding this factor is utilizing genuine quantum advantages.

B. Single Click Quantum Multiplexing

This technique exploits the coherence of a single photon interacting with multiple memories or clients.

• Use Case 1: Asymmetric Entanglement Generation (EG):
  • Scenario: Node A has $M$ memories; Node B has 1.
  • Mechanism: Node B emits a photon that is split into a superposition of $M$ temporal modes matching Node A's memories. A single detection event heralds entanglement between Node B and one of Node A's memories.
  • Result: In high-loss regimes, this yields a multiplexing gain of $m \approx \frac{2M}{M+1}$. While this approaches a factor of 2 (not exceeding the classical $M$ bound for single qubits), it significantly outperforms classical strategies in asymmetric networks where one link is inefficient.
• Use Case 2: Multi-Client Remote State Preparation (RSP):
  • Scenario: $M$ client devices (Weak Coherent Pulses) connect to a single server.
  • Mechanism: The server splits the signal into $M$ channels. The quantum nature of the single-photon limit reduces the probability of undetected multi-photon errors.
  • Result: In the high-fidelity limit with a perfect server, the gain approaches $m \to M$, surpassing the classical limit for single-qubit RSP in specific regimes where classical multiplexing is impossible due to resource constraints.

C. Multi-Server Multiplexing

This is the paper's most significant contribution, demonstrating superlinear scaling ($m_s > M^s$) for many-qubit protocols.

• Scenario: A single client attempts $s$-qubit RSP using a hub of $M$ interconnected server nodes.
• Mechanism: The client sends a pulse to all $M$ servers simultaneously. Crucially, the protocol utilizes the fact that inter-server links are faster and less lossy than client-server links.
  • Strategy: If a qubit is successfully prepared on one server, the client can attempt to prepare the next qubit on a different server via the fast inter-server link, rather than waiting for the slow client-server link to retry.
  • Decoherence Mitigation: This strategy effectively increases the "window" of successful attempts because qubits are not held in memory for the duration of the slow client-server retry cycle.
• Result: For $s$-qubit protocols, the improvement factor $m_s$ can exceed the classical bound $M^s$. Numerical simulations for $s=2, 3, 4$ show that $m_s$ scales superlinearly with $M$, achieving orders of magnitude improvement in execution rates.

4. Key Results

• Rate-Fidelity Trade-off: Both quantum strategies improve the rate-fidelity trade-off. Single-click multiplexing improves rates in asymmetric networks without sacrificing fidelity. Multi-server multiplexing allows for high-fidelity many-qubit states by reducing the effective storage time of qubits.
• Scaling Laws:
  • Classical Limit: $m_s \leq M^s$ (for large windows).
  • Single Click: $m \approx 2$ (asymptotic) for asymmetric EG; $m \to M$ for high-fidelity RSP.
  • Multi-Server: $m_s$ exceeds $M^s$. For example, with $s=4$ and $M=4$, the rate improvement is significantly higher than the classical prediction.
• Resource Efficiency: The paper demonstrates that using many noisy, interconnected devices (e.g., color centers with short coherence times when active) can outperform fewer high-quality devices. The network topology and fast inter-node connections compensate for individual node limitations.

5. Significance and Outlook

• Beyond Classical Limits: The paper proves that quantum coherence and network topology can be leveraged to break the fundamental limits of classical multiplexing in quantum networks.
• Scalability: The findings suggest a path toward a "broadband" quantum internet. Instead of waiting for perfect, low-noise quantum memories, networks can scale by deploying many imperfect nodes and utilizing advanced multiplexing strategies to manage decoherence.
• Application Impact: These strategies are critical for Blind Quantum Computation (BQC) and other multi-qubit applications where the overhead of qubit storage and error correction is currently prohibitive. By increasing the execution rate, these methods reduce the time qubits spend in memory, thereby preserving fidelity.
• Future Directions: The authors suggest that adaptive strategies, machine learning for network optimization, and more advanced quantum multiplexing (e.g., using higher-dimensional qudits) could further push these limits. They emphasize that the relationship between qubit transmission rates and protocol execution rates is non-trivial in quantum networks, differing fundamentally from classical networks.

In summary, this work provides a theoretical framework and practical strategies to overcome the rate bottlenecks of near-term quantum networks, showing that networking lower-quality hardware via quantum multiplexing can yield superior performance to isolated high-quality hardware.