skip to main content

Title: A throughput optimal scheduling policy for a quantum switch
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.  more » « less
Award ID(s):
Author(s) / Creator(s):
Hemmer, Philip R.; Migdall, Alan L.
Date Published:
Journal Name:
Proceedings Volume 12015, Quantum Computing, Communication, and Simulation II;
Page Range / eLocation ID:
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We study a quantum entanglement distribution switch serving a set of users in a star topology with equal-length links. The quantum switch, much like a quantum repeater, can perform entanglement swapping to extend entanglement across longer distances. Additionally, the switch is equipped with entanglement switching logic, enabling it to implement switching policies to better serve the needs of the network. In this work, the function of the switch is to create bipartite or tripartite entangled states among users at the highest possible rates at a fixed ratio. Using Markov chains, 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, and find that the best policies outperform a time division multiplexing policy for sharing the switch between bipartite and tripartite state 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 quantum state decoherence and associated cut-off times for qubit storage, obtaining similar results. Moreover, decoherence-associated quantum storage cut-off times appear to have little effect on capacity in our identical-link system. We also study a smaller class of policies when the switch stores two qubits per user. 
    more » « less
  2. In a quantum network that successfully creates links—shared Bell states between neighboring repeater nodes—with probability p in each time slot, and performs Bell State Measurements at nodes with success probability q < 1, the end-to-end entanglement generation rate drops exponentially with the distance between consumers, despite multi-path routing. If repeaters can perform multi-qubit projective measurements in the GHZ basis that succeed with probability q, the rate does not change with distance in a certain (p,q) region, but decays exponentially outside. This region where the distance-independent rate occurs is the super-critical region of a new percolation problem. We extend this GHZ protocol to incorporate a time-multiplexing blocklength k, the number of time slots over which a repeater can mix-and-match successful links to perform fusion on. As k increases, the super-critical region expands. For a given (p,q), the entanglement rate initially increases with k, and once inside the super-critical region for a high enough k, it decays as 1/k GHZ states per time slot. When memory coherence time exponentially distributed with mean μ is incorporated, it is seen that increasing k does not indefinitely increase the super-critical region; it has a hard μ-dependent limit. Finally, we find that incorporating space-division multiplexing, i.e., running the above protocol independently in up to d disconnected network regions, where d is the network’s node degree, one can go beyond the 1 GHZ state per time slot rate that the above randomized local-link-state protocol cannot surpass. As (p,q) increases, one can approach the ultimate min-cut entanglement-generation capacity of d GHZ states per slot. 
    more » « less
  3. Abstract

    We develop a protocol for entanglement generation in the quantum internet that allows a repeater node to usen-qubit Greenberger-Horne-Zeilinger (GHZ) projective measurements that can fusensuccessfully entangledlinks, i.e., two-qubit entangled Bell pairs shared acrossnnetwork edges, incident at that node. Implementingn-fusion, forn ≥ 3, is in principle not much harder than 2-fusions (Bell-basis measurements) in solid-state qubit memories. If we allow even 3-fusions at the nodes, we find—by developing a connection to a modified version of the site-bond percolation problem—that despite lossy (hence probabilistic) link-level entanglement generation, and probabilistic success of the fusion measurements at nodes, one can generate entanglement between end parties Alice and Bob at a rate that stays constant as the distance between them increases. We prove that this powerful network property is not possible to attain with any quantum networking protocol built with Bell measurements and multiplexing alone. We also design a two-party quantum key distribution protocol that converts the entangled states shared between two nodes into a shared secret, at a key generation rate that is independent of the distance between the two parties.

    more » « less
  4. Real-time and reliable communication is essential for industrial wireless sensor-actuator networks. To this end, researchers have proposed a wide range of transmission scheduling techniques. However, these methods usually employ a link-centric policy which allocates a fixed number of retransmissions for each link of a flow. The lack of flexibility of this approach is problematic because failures do not occur uniformly across links and link quality changes over time. In this paper, we propose a flow-centric policy to flexibly and dynamically reallocate retransmissions among the links of a multi-hop flow at runtime. This contribution is complemented by a method for determining the number of retransmissions necessary to achieve a user-specified reliability level under two failures models that capture the common wireless properties of industrial environments. We demonstrate the effectiveness of flow centric policies using empirical evaluations and trace-driven simulations. Testbed experiments indicate a flow-centric policy can provide higher reliability than a link-centric policy because of its flexibility. Trace-driven experiments compare link-centric and flow-centric policies under the two reliability models. Results indicate that when the two approaches are configured to achieve the same reliability level, a flow-centric approach increases the median real-time capacity by as much as 1.42 times and reduces the end-to-end response times by as much as 2.63 times. 
    more » « less
  5. Abstract

    Quantum key distribution (QKD) has established itself as a groundbreaking technology, showcasing inherent security features that are fundamentally proven. Qubit-based QKD protocols that rely on binary encoding encounter an inherent constraint related to the secret key capacity. This limitation restricts the maximum secret key capacity to one bit per photon. On the other hand, qudit-based QKD protocols have their advantages in scenarios where photons are scarce and noise is present, as they enable the transmission of more than one secret bit per photon. While proof-of-principle entangled-based qudit QKD systems have been successfully demonstrated over the years, the current limitation lies in the maximum distribution distance, which remains at 20 km fiber distance. Moreover, in these entangled high-dimensional QKD systems, the witness and distribution of quantum steering have not been shown before. Here we present a high-dimensional time-bin QKD protocol based on energy-time entanglement that generates a secure finite-length key capacity of 2.39 bit/coincidences and secure cryptographic finite-length keys at 0.24 Mbits s−1in a 50 km optical fiber link. Our system is built entirely using readily available commercial off-the-shelf components, and secured by nonlocal dispersion cancellation technique against collective Gaussian attacks. Furthermore, we set new records for witnessing both energy-time entanglement and quantum steering over different fiber distances. When operating with a quantum channel loss of 39 dB, our system retains its inherent characteristic of utilizing large-alphabet. This enables us to achieve a secure key rate of 0.30 kbits s−1and a secure key capacity of 1.10 bit/coincidences, considering finite-key effects. Our experimental results closely match the theoretical upper bound limit of secure cryptographic keys in high-dimensional time-bin QKD protocols (Moweret al2013Phys. Rev.A87062322; Zhanget al2014Phys. Rev. Lett.112120506), and outperform recent state-of-the-art qubit-based QKD protocols in terms of secure key throughput using commercial single-photon detectors (Wengerowskyet al2019Proc. Natl Acad. Sci.1166684; Wengerowskyet al2020npj Quantum Inf.65; Zhanget al2014Phys. Rev. Lett.112120506; Zhanget al2019Nat. Photon.13839; Liuet al2019Phys. Rev. Lett.122160501; Zhanget al2020Phys. Rev. Lett.125010502; Weiet al2020Phys. Rev.X10031030). The simple and robust entanglement-based high-dimensional time-bin protocol presented here provides potential for practical long-distance quantum steering and QKD with multiple secure bits-per-coincidence, and higher secure cryptographic keys compared to mature qubit-based QKD protocols.

    more » « less