Optimal Calibration of Quantum Network Links

• URL: http://arxiv.org/abs/2606.18167v1
• Date: Tue, 16 Jun 2026 17:06:41 GMT
• Title: Optimal Calibration of Quantum Network Links
• Abstract summary: We develop a protocol for optimally assigning activation periods to each link in linear quantum repeater chains.<n>Building on this foundation, we extend to general quantum networks, where multiple paths may cross at common links.
• Score: 7.459723752881938
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The reliable distribution of entanglement is essential for the effective operation of quantum networks. Due to fundamental differences between quantum and classical communication systems, it is necessary to develop specialised algorithms and protocols that also account for quantum-specific constraints. In this work, we focus on the issue of recalibration. As suggested by recent experimental studies, the process of local entanglement generation in a quantum link degrades over time due to environmental changes that have to be estimated and compensated via a calibration operation, during which the link is not available. Therefore, in such a quantum network, every link alternates between an activation period, during which it operates normally, and a calibration period, during which it cannot participate in the end-to-end entanglement distribution, thereby creating a trade-off between link quality (the fidelity of generated pairs, which decays during activation) and availability (the fraction of time the link is usable, which calibration reduces). We develop analytically a protocol for optimally assigning activation periods to each link in linear quantum repeater chains, subject to any general end-to-end fidelity requirements and local initial fidelity thresholds. Building on this foundation, we extend to general quantum networks, where multiple paths may cross at common links, proposing a heuristic approach evaluated in simulations and compared with a benchmark, numerical approach, and theoretical bounds.

Related papers

• Distributed variational quantum computing with deterministic entanglement tuning [3.9169750999792092]
  Gate teleportation enables universal computation across distributed nodes.<n>We propose a distributed variational quantum computing protocol based on deterministic entanglement tuning.<n>Our results suggest a practical alternative for near-term distributed quantum applications.
  arXiv  Detail & Related papers  (2026-09-10T00:36:39Z)
• Learnable yet not simulable: a quantum resource theory of learning models [57.695822250391906]
  It remains unclear which quantum resource governs the classical learnability of quantum circuits.<n>We study the expectation-value functions of families of tunable quantum circuits.<n>These results establish a quantitative resource-theoretic framework for delineating the boundary between classical simulation and learning.
  arXiv  Detail & Related papers  (2026-08-03T14:48:03Z)
• Bridge the Gap between Classical and Quantum Neural Networks with Residual Connections [0.0]
  We introduce a Hybrid Quantum Residual Network (HQRN) to bridge the gap between classical and quantum residual learning.<n>Our results bridge the gap between classical and quantum residual learning, paving a scalable pathway for deep quantum architectures.
  arXiv  Detail & Related papers  (2026-04-17T02:07:10Z)
• 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)
• In situ quantum verification of polarization-stabilized optical channels [0.712813885457233]
  We introduce a novel in situ benchmarking approach that augments a classical polarization tracking system.<n>The method uses the reconstructed map both to validate the classical compensation and to expose noise sources it fails to capture.<n>Our results should unlock new opportunities for in situ channel characterization in quantum-classical coexistence networks.
  arXiv  Detail & Related papers  (2025-10-30T00:19:59Z)
• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• Distributing quantum correlations through local operations and classical resources [0.0]
  Global quantum correlations, as characterized by the discord, can be distributed to quantum memories using a mixed state of information carriers.<n>We show that even more discord can be generated when the resource state undergoes correlated dephasing noise.
  arXiv  Detail & Related papers  (2024-08-10T08:42:06Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• Quantum-classical distance as a tool to design optimal chiral quantum walk [0.0]
  Continuous-time quantum walks (CTQWs) provide a valuable model for quantum transport, universal quantum computation and quantum spatial search. We argue that the quantum-classical distance, a figure of merit introduced to capture the difference in dynamics between a CTQW and its classical counterpart, guides the optimization of parameters of the Hamiltonian.
  arXiv  Detail & Related papers  (2021-06-22T11:38:58Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)

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.