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

arXiv:2407.19903 · IEEE Communications Letters

On the Capacity of the Quantum Switch With and Without Entanglement Decoherence

Víctor Valls, Panagiotis Promponas, Leandros Tassiulas

Published Jun 28, 2023• 4 citations
arXivHTMLPDF

Abstract

This letter studies the capacity of the quantum switch for two decoherence models: when link-level entanglements last (i) for a time slot, or (ii) until they are used to serve a request (i.e., there is no decoherence). The two models are important as they set lower and upper bounds on the capacity region for any other decoherence model. The letter’s contributions are to characterize the switch capacity region for both decoherence models and to propose throughput-optimal policies based on gradient descent.

DOI
10.1109/lcomm.2023.3290684

Related papers

Optimal Scheduling in a Quantum Switch: Capacity and Throughput Optimality

Sanidhay Bhambay, Thirupathaiah Vasantam, Neil Walton

With a growing number of quantum networks in operation, there is a pressing need for performance analysis of quantum switching technologies. A quantum switch establishes, distributes, and maintains entanglements across a network. In contrast to a classical switching fabric, a quantum switch is a two-sided queueing network. The switch generates Link-Level Entanglements (LLEs) across links that connect users to the switch, which are then fused to process the network's entanglement requests. First, we characterize the capacity region that is defined as the set of entanglement request rates for which there exists a scheduling policy stabilizing the system. We then show that a sequence of Max-Weight policies that we propose achieve throughput optimality in the asymptotic sense. Our proof techniques analyse a two-time scale separation phenomenon at the fluid scale for a general switch topology. This allows us to demonstrate that the optimal fluid dynamics are given by a scheduling algorithm that solves a certain average reward Markov Decision Process.

arXiv:2501.05380•ACM SIGMETRICS Performance Evaluation Review•Jun 16, 2025•9 citations

A throughput optimal scheduling policy for a quantum switch

Thirupathaiah Vasantam, Don Towsley

We study a quantum switch that creates shared end-to-end entangled quantum states to multiple sets of users that are connected to it. Each user is connected to the switch via an optical link across which bipartite Bell-state entangled states are generated in each time-slot with certain probabilities, and the switch merges entanglements of links to create end-to-end entanglements for users. One qubit of an entanglement of a link is stored at the switch and the other qubit of the entanglement is stored at the user corresponding to the link. Assuming that qubits of entanglements of links decipher after one time-slot, we characterize the capacity region, which is defined as the set of arrival rates of requests for end-to-end entanglements for which there exists a scheduling policy that stabilizes the switch. We propose a Max-Weight scheduling policy and show that it stabilizes the switch for all arrival rates that lie in the capacity region. We also provide numerical results to support our analysis.

arXiv:2206.03205•Quantum Computing, Communication, and Simulation•Mar 2, 2022•31 citations

Optimal Scheduling in a Quantum Switch: Capacity and Throughput Optimality

Sanidhay Bhambay, Thirupathaiah Vasantam, Neil Walton

With a growing number of quantum networks in operation, there is a pressing need for performance analysis of quantum switching technologies. A quantum switch establishes, distributes, and maintains entanglements across a network. In contrast to a classical switching fabric, a quantum switch is a two-sided queueing network. The switch generates Link-Level Entanglements (LLEs) across links that connect users to the switch, which are then fused to process the network's entanglement requests. First, we characterize the capacity region that is defined as the set of entanglement request rates for which there exists a scheduling policy stabilizing the system. We then show that a sequence of Max-Weight policies that we propose achieve throughput optimality in the asymptotic sense. Our proof techniques analyse a two-time scale separation phenomenon at the fluid scale for a general switch topology. This allows us to demonstrate that the optimal fluid dynamics are given by a scheduling algorithm that solves a certain average reward Markov Decision Process.

ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)•Jun 4, 2025•18 citations

On the Capacity Region of a Quantum Switch with Entanglement Purification

Nitish K. Panigrahy, Thirupathaiah Vasantam, Don Towsley +1 more

Quantum switches are envisioned to be an integral component of future entanglement distribution networks. They can provide high quality entanglement distribution service to end-users by performing quantum operations such as entanglement swapping and entanglement purification. In this work, we characterize the capacity region of such a quantum switch under noisy channel transmissions and imperfect quantum operations. We express the capacity region as a function of the channel and network parameters (link and entanglement swap success probability), entanglement purification yield and application level parameters (target fidelity threshold). In particular, we provide necessary conditions to verify if a set of request rates belong to the capacity region of the switch. We use these conditions to find the maximum achievable end-to-end user entanglement generation throughput by solving a set of linear optimization problems. We develop a max-weight scheduling policy and prove that the policy stabilizes the switch for all feasible request arrival rates. As we develop scheduling policies, we also generate new results for computing the conditional yield distribution of different classes of purification protocols. The conclusions obtained in this work can yield useful guidelines for subsequent quantum switch designs.

arXiv:2212.01463•IEEE Conference on Computer Communications (INFOCOM)•May 17, 2023•57 citations

On the Capacity Region of Bipartite and Tripartite Entanglement Switching and Key Distribution

Gayane Vardoyan, Saikat Guha, Philippe Nain +1 more

We study a quantum switch serving a set of users. The function of the switch is to convert bipartite entanglement generated over individual links connecting each user to the switch, into bipartite or tripartite entangled states among (pairs or groups of) users at the highest possible rates at a fixed ratio. Such entanglement can then be converted to quantum-secure shared secret bits among pairs or triples of users using E91-like Quantum Key Distribution (QKD) protocols. The switch can store a certain number of qubits in a quantum memory for a certain length of time, and can make two-qubit Bell-basis measurements or three-qubit GHZ-basis projective measurements on qubits held in the memory. We model a set of randomized switching policies. Discovering that some are better than others, we present analytical results for the case where the switch stores one qubit per user at a given time step, and find that the best policies outperform a time division multiplexing (TDM) policy for sharing the switch between bipartite and tripartite entanglement generation. This performance improvement decreases as the number of users grows. The model is easily augmented to study the capacity region in the presence of qubit decoherence, obtaining similar results. Moreover, decoherence appears to have little effect on capacity. We also study a smaller class of policies when the switch can store two qubits per user. The full manuscript can be found at https://arxiv.org/abs/1901.06786.

•Aug 26, 2019•1 citation

Optimal Entanglement Distillation Policies for Quantum Switches

Vivek Kumar, Nitish Kumar Chandra, Kaushik P. Seshadreesan +2 more

The quantum switch is a vital component for the development of the quantum internet. In an entanglement distribution network, the function of a quantum switch is to generate elementary entanglement with its clients followed by entanglement swapping to distribute end-to-end entanglement of sufficiently high fidelity between clients. The threshold on entanglement fidelity is any quality of service requirement specified by the clients as dictated by the application they run on the network. We consider a discrete time model for a quantum switch that attempts generation of fresh elementary entanglement with clients in each time step in the form of maximally entangled qubit pairs, or Bell pairs, which succeed probabilistically; the successfully generated Bell pairs are stored in noisy quantum memories until they can be swapped. We focus on establishing the value of entanglement distillation of the stored Bell pairs prior to entanglement swapping in presence of their inevitable aging, i.e., decoherence: For a simple instance of a switch with two clients, an exponential decay of entanglement fidelity, and a wellknown probabilistic but heralded two-to-one distillation protocol, given a threshold end-to-end entanglement fidelity, we use the Markov Decision Processes framework to identify the optimal action policy - to wait, to distill, or to swap that maximizes throughput. We compare the switch's performance under the optimal distillation-enabled policy with that excluding distillation. Simulations of the two policies demonstrate the improvements that are possible in principle via optimal use of distillation with respect to average throughput, average fidelity and jitter of end-to-end entanglement, as functions of fidelity threshold. Our model thus helps capture the role of entanglement distillation in mitigating the effects of decoherence in a quantum switch in an entanglement distribution network, adding to the growing literature on quantum switches.

arXiv:2305.06804•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•12 citations
This letter studies the capacity of the quantum switch for two decoherence models: when link-level entanglements last (i) for a time slot, or (ii) until they are used to serve a request (i.e., there is no decoherence). The two models are important as they set lower and upper bounds on the capacity region for any other decoherence model. The letter’s contributions are to characterize the switch capacity region for both decoherence models and to propose throughput-optimal policies based on gradient descent.
With a growing number of quantum networks in operation, there is a pressing need for performance analysis of quantum switching technologies. A quantum switch establishes, distributes, and maintains entanglements across a network. In contrast to a classical switching fabric, a quantum switch is a two-sided queueing network. The switch generates Link-Level Entanglements (LLEs) across links that connect users to the switch, which are then fused to process the network's entanglement requests. First, we characterize the capacity region that is defined as the set of entanglement request rates for which there exists a scheduling policy stabilizing the system. We then show that a sequence of Max-Weight policies that we propose achieve throughput optimality in the asymptotic sense. Our proof techniques analyse a two-time scale separation phenomenon at the fluid scale for a general switch topology. This allows us to demonstrate that the optimal fluid dynamics are given by a scheduling algorithm that solves a certain average reward Markov Decision Process.
We study a quantum switch that creates shared end-to-end entangled quantum states to multiple sets of users that are connected to it. Each user is connected to the switch via an optical link across which bipartite Bell-state entangled states are generated in each time-slot with certain probabilities, and the switch merges entanglements of links to create end-to-end entanglements for users. One qubit of an entanglement of a link is stored at the switch and the other qubit of the entanglement is stored at the user corresponding to the link. Assuming that qubits of entanglements of links decipher after one time-slot, we characterize the capacity region, which is defined as the set of arrival rates of requests for end-to-end entanglements for which there exists a scheduling policy that stabilizes the switch. We propose a Max-Weight scheduling policy and show that it stabilizes the switch for all arrival rates that lie in the capacity region. We also provide numerical results to support our analysis.
With a growing number of quantum networks in operation, there is a pressing need for performance analysis of quantum switching technologies. A quantum switch establishes, distributes, and maintains entanglements across a network. In contrast to a classical switching fabric, a quantum switch is a two-sided queueing network. The switch generates Link-Level Entanglements (LLEs) across links that connect users to the switch, which are then fused to process the network's entanglement requests. First, we characterize the capacity region that is defined as the set of entanglement request rates for which there exists a scheduling policy stabilizing the system. We then show that a sequence of Max-Weight policies that we propose achieve throughput optimality in the asymptotic sense. Our proof techniques analyse a two-time scale separation phenomenon at the fluid scale for a general switch topology. This allows us to demonstrate that the optimal fluid dynamics are given by a scheduling algorithm that solves a certain average reward Markov Decision Process.
Quantum switches are envisioned to be an integral component of future entanglement distribution networks. They can provide high quality entanglement distribution service to end-users by performing quantum operations such as entanglement swapping and entanglement purification. In this work, we characterize the capacity region of such a quantum switch under noisy channel transmissions and imperfect quantum operations. We express the capacity region as a function of the channel and network parameters (link and entanglement swap success probability), entanglement purification yield and application level parameters (target fidelity threshold). In particular, we provide necessary conditions to verify if a set of request rates belong to the capacity region of the switch. We use these conditions to find the maximum achievable end-to-end user entanglement generation throughput by solving a set of linear optimization problems. We develop a max-weight scheduling policy and prove that the policy stabilizes the switch for all feasible request arrival rates. As we develop scheduling policies, we also generate new results for computing the conditional yield distribution of different classes of purification protocols. The conclusions obtained in this work can yield useful guidelines for subsequent quantum switch designs.
We study a quantum switch serving a set of users. The function of the switch is to convert bipartite entanglement generated over individual links connecting each user to the switch, into bipartite or tripartite entangled states among (pairs or groups of) users at the highest possible rates at a fixed ratio. Such entanglement can then be converted to quantum-secure shared secret bits among pairs or triples of users using E91-like Quantum Key Distribution (QKD) protocols. The switch can store a certain number of qubits in a quantum memory for a certain length of time, and can make two-qubit Bell-basis measurements or three-qubit GHZ-basis projective measurements on qubits held in the memory. We model a set of randomized switching policies. Discovering that some are better than others, we present analytical results for the case where the switch stores one qubit per user at a given time step, and find that the best policies outperform a time division multiplexing (TDM) policy for sharing the switch between bipartite and tripartite entanglement generation. This performance improvement decreases as the number of users grows. The model is easily augmented to study the capacity region in the presence of qubit decoherence, obtaining similar results. Moreover, decoherence appears to have little effect on capacity. We also study a smaller class of policies when the switch can store two qubits per user. The full manuscript can be found at https://arxiv.org/abs/1901.06786.
The quantum switch is a vital component for the development of the quantum internet. In an entanglement distribution network, the function of a quantum switch is to generate elementary entanglement with its clients followed by entanglement swapping to distribute end-to-end entanglement of sufficiently high fidelity between clients. The threshold on entanglement fidelity is any quality of service requirement specified by the clients as dictated by the application they run on the network. We consider a discrete time model for a quantum switch that attempts generation of fresh elementary entanglement with clients in each time step in the form of maximally entangled qubit pairs, or Bell pairs, which succeed probabilistically; the successfully generated Bell pairs are stored in noisy quantum memories until they can be swapped. We focus on establishing the value of entanglement distillation of the stored Bell pairs prior to entanglement swapping in presence of their inevitable aging, i.e., decoherence: For a simple instance of a switch with two clients, an exponential decay of entanglement fidelity, and a wellknown probabilistic but heralded two-to-one distillation protocol, given a threshold end-to-end entanglement fidelity, we use the Markov Decision Processes framework to identify the optimal action policy - to wait, to distill, or to swap that maximizes throughput. We compare the switch's performance under the optimal distillation-enabled policy with that excluding distillation. Simulations of the two policies demonstrate the improvements that are possible in principle via optimal use of distillation with respect to average throughput, average fidelity and jitter of end-to-end entanglement, as functions of fidelity threshold. Our model thus helps capture the role of entanglement distillation in mitigating the effects of decoherence in a quantum switch in an entanglement distribution network, adding to the growing literature on quantum switches.