Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

Age of Quantum Information: Fidelity-Aware Teleportation Scheduling

Truman Welling, Aylin Yener

Published Jun 1, 2026• 0 citations
Publisher

Abstract

Age of Information (AoI) is a well-studied freshness metric of classical information. Motivated by fundamental differences between classical and quantum information, this paper studies transmission scheduling of quantum status updates using the quantum teleportation protocol, in an effort to define the age of quantum information. Specifically, we consider a time-slotted formulation where entanglement is distributed and an update arrives independently with fixed probability in each slot, which we analyze using a Markov decision process. We characterize the scheduling policy that minimizes a fidelity-aware age penalty function and show that it has a threshold structure.

DOI
10.1109/isit62367.2026.11653667

Related papers

Age of Entanglement in Satellite Repeater Chains with Intermittent Availability

Elif Tuğçe Ceran

Timely availability of high-fidelity entanglement is essential for emerging quantum networks. This paper introduces the Age of Entanglement (AoE) as a novel performance metric that captures the freshness of bipartite entanglement under continuous distribution in quantum repeater chains. AoE extends classical Age of Information (AoI)-based metrics to quantum networking by capturing storage, decoherence, and probabilistic entanglement generation and swapping. We study a satellite-assisted quantum repeater network in which entangled pairs are generated probabilistically, stored in quantum memories that suffer from decoherence, and combined to form end-to-end entangled links. Satellite-ground connectivity is intermittent and modeled as a two-state Markov chain. The resulting AoE minimization problem is formulated as an infinite-horizon Markov decision process (MDP), where control actions determine when to generate, store, or swap entangled pairs under stochastic link availability and memory degradation. Using relative value iteration, we characterize AoE-optimal policies and evaluate their performance numerically. Our results highlight the impact of decoherence, imperfect operations, and visibility dynamics, and show that the proposed dynamic policies significantly outperform swap-as-soon-as-possible and greedy entanglement generation strategies. Our results provide practical design and control guidelines for satellite-enabled quantum repeater chains supporting continuous entanglement distribution.

arXiv:2602.23985•IEEE Conference on Computer Communications (INFOCOM)•May 18, 2026•2 citations

Age-Based Scheduling for a Memory-Constrained Quantum Switch

Stavros Mitrolaris, Subhankar Banerjee, Sennur Ulukus

In a time-slotted system, we study the problem of scheduling multipartite entanglement requests in a quantum switch with a finite number of quantum memory registers. Specifically, we consider probabilistic link-level entanglement (LLE) generation for each user, probabilistic entanglement swapping, and one-slot decoherence. To evaluate the performance of the proposed scheduling policies, we introduce a novel age-based metric, coined age of entanglement establishment (AoEE). We consider two families of low-complexity policies for which we obtain closed-form expressions for their corresponding AoEE performance. Optimizing over each family, we obtain two policies. Further, we propose one more low-complexity policy and provide its performance guarantee. Finally, we numerically compare the performance of the proposed policies.

arXiv:2601.11698•IEEE Conference on Computer Communications (INFOCOM)•May 18, 2026•3 citations

Role of Error Syndromes in Teleportation Scheduling

Aparimit Chandra, Filip Rozpędek, Don Towsley

Quantum teleportation enables quantum information transmission, but requires distribution of entangled resource states. Unfortunately, decoherence, caused by environmental interference during quantum state storage, can degrade quantum states, leading to entanglement loss in the resource state and re-duction of the fidelity of the teleported information. In this work, we investigate the use of error correction and error syndrome information in scheduling teleportation at a quantum network node in the presence of multiple teleportation requests and a finite rate of remote entanglement distribution. Specifically, we focus on the scenario where stored qubits undergo decoherence over time due to imperfect memories. To protect the qubits from the resulting errors, we employ quantum encodings, and the stored qubits undergo repeated error correction, generating error syndromes in each round. These error syndromes can provide additional benefits, as they can be used to calculate qubit-specific error likelihoods, which can then be utilized to make better scheduling decisions. By integrating error correction techniques into the scheduling process, our goal is to minimize errors and decoherence effects, thereby enhancing the fidelity and efficiency of teleportation in a quantum network setting.

arXiv:2408.04536•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•1 citation

Asynchronous quantum computation through port-based teleportation

Chloe Kim, Eric Chitambar, Felix Leditzky

Abstract In standard quantum teleportation, the receiver must wait for a classical message from the sender before subsequently processing the transmitted quantum information. However, in port-based teleportation (PBT), this local processing can begin before the classical message is received, thereby allowing for asynchronous quantum information processing. Motivated by resource-theoretic considerations and practical applications, we propose different communication models that progressively allow for more powerful decoding strategies while still permitting asynchronous distributed quantum computation, a salient feature of standard PBT. Specifically, we consider PBT protocols augmented by free classical processing and/or different forms of quantum pre-processing, and we investigate the maximum achievable teleportation fidelities under such operations. Our analysis focuses specifically on the PBT power of isotropic states, bipartite graph states, and symmetrized EPR states, and we compute tight bounds on the optimal teleportation fidelities for such states. We finally show that, among this hierarchy of communication models consistent with asynchronous quantum information processing, the strongest resource theory is equally as powerful as any one-way teleportation protocol for surpassing the classical teleportation threshold. Thus, a bipartite state can break the one-way classical teleportation threshold if and only if it can be done using the trivial decoding map of discarding subsystems.

arXiv:2504.12945•New Journal of Physics•Feb 24, 2026•2 citations

Numerology-Aware Quantum Teleportation Scheduling Considering Data-Qubit Fidelity Decay

Wei-Chia Hsieh, Juliette Chou Le Touze, Jian-Jhih Kuo +1 more

Entanglement generation and swapping are key techniques for enabling long-distance quantum communication, allowing the creation of end-to-end entangled pairs and making teleportation between non-adjacent nodes possible. However, fidelity loss and decoherence effects must be carefully considered, as they can degrade the quality of the transmitted data. Swapping operations inherently reduce fidelity, while the data to be teleported may also suffer decoherence during the wait for an end-to-end entangled pair to be established. Although the former issue is frequently examined in existing literature, the latter (i.e., decoherence of waiting data) remains largely overlooked. Together, these effects pose significant scheduling challenges. To address this, we formulate a novel optimization problem, termed DAFSP, and propose a separation-oracle-based algorithm, DORA, which achieves a bi-criteria approximation ratio of (O(1),O(log|V||T|)). Finally, simulation results manifest that DORA can notably outperform existing approaches, achieving an average improvement of 495% in the sum of expected overall fidelity.

International Conference on Communications•May 24, 2026•0 citations

On the design and analysis of near-term quantum network protocols using Markov decision processes

Sumeet Khatri

The quantum internet is one of the frontiers of quantum information science. It will revolutionize the way we communicate and do other tasks, and it will allow for tasks that are not possible using the current, classical internet. The backbone of a quantum internet is entanglement distributed globally in order to allow for such novel applications to be performed over long distances. Experimental progress is currently being made to realize quantum networks on a small scale, but much theoretical work is still needed in order to understand how best to distribute entanglement, especially with the limitations of near-term quantum technologies taken into account. This work provides an initial step toward this goal. In this work, we lay out a theory of near-term quantum networks based on Markov decision processes (MDPs), and we show that MDPs provide a precise and systematic mathematical framework to model protocols for near-term quantum networks that is agnostic to the specific implementation platform. We start by simplifying the MDP for elementary links introduced in prior work and by providing new results on policies for elementary links in the steady-state (infinite-time) limit. Then, we show how the elementary link MDP can be used to analyze a complete quantum network protocol. We then provide an extension of the MDP formalism to two elementary links. Here, as new results, we derive linear programing relaxations that allow us to obtain optimal steady-state policies with respect to the expected fidelity and waiting time of the end-to-end link.

arXiv:2207.03403•AVS Quantum Science•Sep 1, 2022•20 citations
Age of Information (AoI) is a well-studied freshness metric of classical information. Motivated by fundamental differences between classical and quantum information, this paper studies transmission scheduling of quantum status updates using the quantum teleportation protocol, in an effort to define the age of quantum information. Specifically, we consider a time-slotted formulation where entanglement is distributed and an update arrives independently with fixed probability in each slot, which we analyze using a Markov decision process. We characterize the scheduling policy that minimizes a fidelity-aware age penalty function and show that it has a threshold structure.
Timely availability of high-fidelity entanglement is essential for emerging quantum networks. This paper introduces the Age of Entanglement (AoE) as a novel performance metric that captures the freshness of bipartite entanglement under continuous distribution in quantum repeater chains. AoE extends classical Age of Information (AoI)-based metrics to quantum networking by capturing storage, decoherence, and probabilistic entanglement generation and swapping. We study a satellite-assisted quantum repeater network in which entangled pairs are generated probabilistically, stored in quantum memories that suffer from decoherence, and combined to form end-to-end entangled links. Satellite-ground connectivity is intermittent and modeled as a two-state Markov chain. The resulting AoE minimization problem is formulated as an infinite-horizon Markov decision process (MDP), where control actions determine when to generate, store, or swap entangled pairs under stochastic link availability and memory degradation. Using relative value iteration, we characterize AoE-optimal policies and evaluate their performance numerically. Our results highlight the impact of decoherence, imperfect operations, and visibility dynamics, and show that the proposed dynamic policies significantly outperform swap-as-soon-as-possible and greedy entanglement generation strategies. Our results provide practical design and control guidelines for satellite-enabled quantum repeater chains supporting continuous entanglement distribution.
In a time-slotted system, we study the problem of scheduling multipartite entanglement requests in a quantum switch with a finite number of quantum memory registers. Specifically, we consider probabilistic link-level entanglement (LLE) generation for each user, probabilistic entanglement swapping, and one-slot decoherence. To evaluate the performance of the proposed scheduling policies, we introduce a novel age-based metric, coined age of entanglement establishment (AoEE). We consider two families of low-complexity policies for which we obtain closed-form expressions for their corresponding AoEE performance. Optimizing over each family, we obtain two policies. Further, we propose one more low-complexity policy and provide its performance guarantee. Finally, we numerically compare the performance of the proposed policies.
Quantum teleportation enables quantum information transmission, but requires distribution of entangled resource states. Unfortunately, decoherence, caused by environmental interference during quantum state storage, can degrade quantum states, leading to entanglement loss in the resource state and re-duction of the fidelity of the teleported information. In this work, we investigate the use of error correction and error syndrome information in scheduling teleportation at a quantum network node in the presence of multiple teleportation requests and a finite rate of remote entanglement distribution. Specifically, we focus on the scenario where stored qubits undergo decoherence over time due to imperfect memories. To protect the qubits from the resulting errors, we employ quantum encodings, and the stored qubits undergo repeated error correction, generating error syndromes in each round. These error syndromes can provide additional benefits, as they can be used to calculate qubit-specific error likelihoods, which can then be utilized to make better scheduling decisions. By integrating error correction techniques into the scheduling process, our goal is to minimize errors and decoherence effects, thereby enhancing the fidelity and efficiency of teleportation in a quantum network setting.
Abstract In standard quantum teleportation, the receiver must wait for a classical message from the sender before subsequently processing the transmitted quantum information. However, in port-based teleportation (PBT), this local processing can begin before the classical message is received, thereby allowing for asynchronous quantum information processing. Motivated by resource-theoretic considerations and practical applications, we propose different communication models that progressively allow for more powerful decoding strategies while still permitting asynchronous distributed quantum computation, a salient feature of standard PBT. Specifically, we consider PBT protocols augmented by free classical processing and/or different forms of quantum pre-processing, and we investigate the maximum achievable teleportation fidelities under such operations. Our analysis focuses specifically on the PBT power of isotropic states, bipartite graph states, and symmetrized EPR states, and we compute tight bounds on the optimal teleportation fidelities for such states. We finally show that, among this hierarchy of communication models consistent with asynchronous quantum information processing, the strongest resource theory is equally as powerful as any one-way teleportation protocol for surpassing the classical teleportation threshold. Thus, a bipartite state can break the one-way classical teleportation threshold if and only if it can be done using the trivial decoding map of discarding subsystems.
Entanglement generation and swapping are key techniques for enabling long-distance quantum communication, allowing the creation of end-to-end entangled pairs and making teleportation between non-adjacent nodes possible. However, fidelity loss and decoherence effects must be carefully considered, as they can degrade the quality of the transmitted data. Swapping operations inherently reduce fidelity, while the data to be teleported may also suffer decoherence during the wait for an end-to-end entangled pair to be established. Although the former issue is frequently examined in existing literature, the latter (i.e., decoherence of waiting data) remains largely overlooked. Together, these effects pose significant scheduling challenges. To address this, we formulate a novel optimization problem, termed DAFSP, and propose a separation-oracle-based algorithm, DORA, which achieves a bi-criteria approximation ratio of (O(1),O(log|V||T|)). Finally, simulation results manifest that DORA can notably outperform existing approaches, achieving an average improvement of 495% in the sum of expected overall fidelity.
The quantum internet is one of the frontiers of quantum information science. It will revolutionize the way we communicate and do other tasks, and it will allow for tasks that are not possible using the current, classical internet. The backbone of a quantum internet is entanglement distributed globally in order to allow for such novel applications to be performed over long distances. Experimental progress is currently being made to realize quantum networks on a small scale, but much theoretical work is still needed in order to understand how best to distribute entanglement, especially with the limitations of near-term quantum technologies taken into account. This work provides an initial step toward this goal. In this work, we lay out a theory of near-term quantum networks based on Markov decision processes (MDPs), and we show that MDPs provide a precise and systematic mathematical framework to model protocols for near-term quantum networks that is agnostic to the specific implementation platform. We start by simplifying the MDP for elementary links introduced in prior work and by providing new results on policies for elementary links in the steady-state (infinite-time) limit. Then, we show how the elementary link MDP can be used to analyze a complete quantum network protocol. We then provide an extension of the MDP formalism to two elementary links. Here, as new results, we derive linear programing relaxations that allow us to obtain optimal steady-state policies with respect to the expected fidelity and waiting time of the end-to-end link.