{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:50:24Z","timestamp":1774367424327,"version":"3.50.1"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T00:00:00Z","timestamp":1695859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2023,9,28]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/3626570.3626597","type":"journal-article","created":{"date-parts":[[2023,10,2]],"date-time":"2023-10-02T22:16:57Z","timestamp":1696285017000},"page":"75-77","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning-based Optimal Quantum Switch Scheduling"],"prefix":"10.1145","volume":"51","author":[{"given":"Jiatai","family":"Huang","sequence":"first","affiliation":[{"name":"Tsinghua University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longbo","family":"Huang","sequence":"additional","affiliation":[{"name":"Tsinghua University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,10,2]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Queue scheduling with adversarial bandit learning. arXiv preprint arXiv:2303.01745","author":"Huang J.","year":"2023","unstructured":"J. Huang, L. Golubchik, and L. Huang. Queue scheduling with adversarial bandit learning. arXiv preprint arXiv:2303.01745, 2023."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1561\/1300000001"},{"key":"e_1_2_1_3_1","volume-title":"On the capacity region of a quantum switch with entanglement purification. arXiv preprint arXiv:2212.01463","author":"Panigrahy D. T. N.","year":"2022","unstructured":"D. T. N. Panigrahy, T. Vasantam and L. Tassiulas. On the capacity region of a quantum switch with entanglement purification. arXiv preprint arXiv:2212.01463, 2022."},{"key":"e_1_2_1_4_1","volume-title":"Full exploitation of limited memory in quantum entanglement switching. arXiv preprint arXiv:2304.10602","author":"Promponas V. V. P.","year":"2023","unstructured":"V. V. P. Promponas and L. Tassiulas. Full exploitation of limited memory in quantum entanglement switching. arXiv preprint arXiv:2304.10602, 2023."},{"key":"e_1_2_1_5_1","volume-title":"Stability analysis of a quantum network with max-weight scheduling. In arXiv:2106.00831","author":"Towsley T. V. D.","year":"2021","unstructured":"T. V. D. Towsley. Stability analysis of a quantum network with max-weight scheduling. In arXiv:2106.00831, 2021."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/QCE53715.2022.00060"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626570.3626597","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626570.3626597","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:45Z","timestamp":1750178205000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626570.3626597"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,28]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,9,28]]}},"alternative-id":["10.1145\/3626570.3626597"],"URL":"https:\/\/doi.org\/10.1145\/3626570.3626597","relation":{},"ISSN":["0163-5999"],"issn-type":[{"value":"0163-5999","type":"print"}],"subject":[],"published":{"date-parts":[[2023,9,28]]},"assertion":[{"value":"2023-10-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}