On the Capacity Region of a Quantum Switch with Entanglement
Purification
- URL: http://arxiv.org/abs/2212.01463v1
- Date: Fri, 2 Dec 2022 21:55:02 GMT
- Title: On the Capacity Region of a Quantum Switch with Entanglement
Purification
- Authors: Nitish K. Panigrahy, Thirupathaiah Vasantam, Don Towsley, Leandros
Tassiulas
- Abstract summary: Quantum switches are envisioned to be an integral component of future entanglement distribution networks.
We characterize the capacity region of such a quantum switch under noisy channel transmissions and imperfect quantum operations.
- Score: 17.138781986444222
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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. From
numerical experiments, we discover that performing link-level entanglement
purification followed by entanglement swaps provides a larger capacity region
than doing entanglement swaps followed by end-to-end entanglement purification.
The conclusions obtained in this work can yield useful guidelines for
subsequent quantum switch designs.
Related papers
- 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) - Optimal resource requirements for connected quantum sub-networks [1.619107149276392]
This work describes a scalable approach for building large quantum networks by connecting quantum sub-networks.
We derive a set of equations whose solutions give the optimal values of average network parameters that meet threshold requirements.
Our results present a pathway for calculating optimal resource requirements in quantum sub-networks interconnected to form the global quantum internet.
arXiv Detail & Related papers (2025-02-20T09:20:55Z) - Capacity-Achieving Entanglement Purification Protocol for Pauli Dephasing Channel [1.6632263048576381]
A simple entanglement swapping protocol via a central node is not effective against the Pauli dephasing channel.
This highlights the importance of purifying distributed Bell states before performing entanglement swapping.
We introduce an entanglement purification protocol assisted by two-way classical communication that not only purifies the states but also achieves the channel capacities.
arXiv Detail & Related papers (2024-11-21T20:41:16Z) - Interfacing Gottesman-Kitaev-Preskill Qubits to Quantum Memories [3.152708951218456]
We propose an interface between quantum memories and GKP qubit states based on a cavity-mediated controlled displacement gate.
We extend this protocol to demonstrate the creation of GKP cluster states by avoiding the requirement of ancillary optical quadrature-squeezed light.
arXiv Detail & Related papers (2024-06-06T17:23:54Z) - 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) - Entanglement Distribution in Quantum Repeater with Purification and
Optimized Buffer Time [53.56179714852967]
We explore entanglement distribution using quantum repeaters with optimized buffer time.
We observe that increasing the number of memories on end nodes leads to a higher entanglement distribution rate per memory.
When imperfect operations are considered, however, we make the surprising observation that the per-memory entanglement rate decreases with increasing number of memories.
arXiv Detail & Related papers (2023-05-23T23:23:34Z) - Scaling Limits of Quantum Repeater Networks [62.75241407271626]
Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing.
Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability.
In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
arXiv Detail & Related papers (2023-05-15T14:57:01Z) - Optimal Entanglement Distillation Policies for Quantum Switches [0.64265933507484]
In an entanglement distribution network, the function of a quantum switch is to generate elementary entanglement with its clients followed by entanglement swapping.
We consider a discrete-time model for a quantum switch that attempts generation of fresh elementary entanglement with clients in each time step.
We focus on establishing the value of entanglement distillation of the stored Bell pairs prior to entanglement swapping in presence of their inevitable aging.
arXiv Detail & Related papers (2023-05-11T13:52:49Z) - Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes.
We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee.
Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
arXiv Detail & Related papers (2023-04-10T07:16:51Z) - Adaptive, Continuous Entanglement Generation for Quantum Networks [59.600944425468676]
Quantum networks rely on entanglement between qubits at distant nodes to transmit information.
We present an adaptive scheme that uses information from previous requests to better guide the choice of randomly generated quantum links.
We also explore quantum memory allocation scenarios, where a difference in latency performance implies the necessity of optimal allocation of resources for quantum networks.
arXiv Detail & Related papers (2022-12-17T05:40:09Z) - A Quantum Optimal Control Problem with State Constrained Preserving
Coherence [68.8204255655161]
We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels.
We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
arXiv Detail & Related papers (2022-03-24T21:31:34Z) - Entanglement Swapping in Quantum Switches: Protocol Design and Stability
Analysis [14.638996634412976]
Quantum switches are critical components in quantum networks, distributing maximally entangled pairs among end nodes by entanglement swapping.
In this work, we design protocols that schedule entanglement swapping operations in quantum switches.
arXiv Detail & Related papers (2021-10-08T13:24:29Z)
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.