Abstract
In this paper, we consider the problem of optimal scheduling for quantum switches with dynamic demand and random entanglement successes. Different from prior results that often focus on (known) fixed entanglement success probabilities, we assume zero prior knowledge about the entanglement success probabilities and allow them to vary from time to time in an adversarial manner. We propose a learning-based algorithm QSSoftMW based on the framework developed in [1], which combines adversarial learning and Lyapunov queue analysis. We show that QSSoftMW is able to automatically adapt to the changing system statistics and ensure quantum switch stability.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
