Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantum circuit scheduler for QPUs usage optimization

Published 1 Apr 2024 in cs.SE | (2404.01055v2)

Abstract: Progress in the realm of quantum technologies is paving the way for a multitude of potential applications across different sectors. However, the reduced number of available quantum computers, their technical limitations and the high demand for their use are posing some problems for developers and researchers. Mainly, users trying to execute quantum circuits on these devices are usually facing long waiting times in the tasks queues. In this context, this work propose a technique to reduce waiting times and optimize quantum computers usage by scheduling circuits from different users into combined circuits that are executed at the same time. To validate this proposal, different widely known quantum algorithms have been selected and executed in combined circuits. The obtained results are then compared with the results of executing the same algorithms in an isolated way. This allowed us to measure the impact of the use of the scheduler. Among the obtained results, it has been possible to verify that the noise suffered by executing a combination of circuits through the proposed scheduler does not critically affect the outcomes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (22)
  1. V. Hassija, V. Chamola, V. Saxena, V. Chanana, P. Parashari, S. Mumtaz, and M. Guizani, “Present landscape of quantum computing,” IET Quantum Communication, vol. 1, no. 2, pp. pp. 42–48, 2020.
  2. M. M. Islam and M. Rahaman, “A review on progress and problems of quantum computing as a service (QCaaS) in the perspective of cloud computing,” Global Journal of Computer Science and Technology, vol. 15, no. B4, pp. 23–26, 2015.
  3. J. Alvarado-Valiente, J. Romero-Álvarez, E. Moguel, J. García-Alonso, and J. M. Murillo, “Technological diversity of quantum computing providers: a comparative study and a proposal for api gateway integration,” Software Quality Journal, pp. 1–21, 2023.
  4. C. Q. Choi, “Ibm’s quantum leap: The company will take quantum tech past the 1,000-qubit mark in 2023,” IEEE Spectrum, vol. 60, no. 1, pp. 46–47, 2023.
  5. T. Ichikawa, H. Hakoshima, K. Inui, K. Ito, R. Matsuda, K. Mitarai et al., “A comprehensive survey on quantum computer usage: How many qubits are employed for what purposes?” arXiv:2307.16130, 2023.
  6. H. T. Nguyen, M. Usman, and R. Buyya, “Qfaas: A serverless function-as-a-service framework for quantum computing,” Future Generation Computer Systems, vol. 154, pp. 281–300, 2024.
  7. E. Moguel, J. Rojo, D. Valencia, J. Berrocal, J. Garcia-Alonso, and J. M. Murillo, “Quantum service-oriented computing: current landscape and challenges,” Software Quality Journal, vol. 30, no. 4, pp. 983–1002, 2022.
  8. J. Zhao, “Quantum software engineering: Landscapes and horizons,” arXiv preprint arXiv:2007.07047, 2020.
  9. A. McCaskey, E. Dumitrescu, D. Liakh, and T. Humble, “Hybrid programming for near-term quantum computing systems,” in 2018 IEEE international conference on rebooting computing (ICRC).   IEEE, 2018, pp. 1–12.
  10. G. S. Ravi, K. N. Smith, P. Gokhale, and F. T. Chong, “Quantum computing in the cloud: Analyzing job and machine characteristics,” in 2021 IEEE International Symposium on Workload Characterization (IISWC).   IEEE, 2021, pp. 39–50.
  11. J. Garcia-Alonso, J. Rojo, D. Valencia, E. Moguel, J. Berrocal, and J. M. Murillo, “Quantum software as a service through a quantum api gateway,” IEEE Internet Computing, vol. 26, no. 1, pp. 34–41, 2021.
  12. H. T. Nguyen, M. Usman, and R. Buyya, “iQuantum: A Case for Modeling and Simulation of Quantum Computing Environments,” in 2023 IEEE International Conference on Quantum Software.   Los Alamitos, CA, USA: IEEE Computer Society, 3 2023, pp. 21–30.
  13. F. Leymann and J. Barzen, “The bitter truth about gate-based quantum algorithms in the nisq era,” Quantum Science and Technology, vol. 5, no. 4, p. 044007, 2020.
  14. H. E. Brandt, “Qubit devices and the issue of quantum decoherence,” Progress in Quantum Electronics, vol. 22, pp. 257–370, 1999.
  15. P. Murali, D. C. McKay, M. Martonosi, and A. Javadi-Abhari, “Software mitigation of crosstalk on noisy intermediate-scale quantum computers,” in International Conference on Architectural Support for Programming Languages and Operating Systems, 2020, pp. 1001–1016.
  16. P. D. Nation, H. Kang, N. Sundaresan, and J. M. Gambetta, “Scalable mitigation of measurement errors on quantum computers,” PRX Quantum, vol. 2, no. 4, p. 040326, 2021.
  17. E. Wilson, S. Singh, and F. Mueller, “Just-in-time quantum circuit transpilation reduces noise,” in 2020 IEEE international conference on quantum computing and engineering (QCE).   IEEE, 2020, pp. 345–355.
  18. S. Johnstun and J.-F. Van Huele, “Understanding and compensating for noise on ibm quantum computers,” American Journal of Physics, vol. 89, no. 10, pp. 935–942, 2021.
  19. E. M. Usandizaga, T. Yue, P. Arcaini, and S. Ali, “Which quantum circuit mutants shall be used? an empirical evaluation of quantum circuit mutations,” arXiv preprint arXiv:2311.16913, 2023.
  20. R. Kaewpuang, M. Xu, D. Niyato, H. Yu, Z. Xiong, and J. Kang, “Stochastic qubit resource allocation for quantum cloud computing,” in NOMS 2023-2023 IEEE/IFIP Network Operations and Management Symposium.   IEEE, 2023, pp. 1–5.
  21. L. Chirolli and G. Burkard, “Decoherence in solid-state qubits,” Advances in Physics, vol. 57, no. 3, pp. 225–285, 2008.
  22. Y. Cai and L.-H. Lim, “Distances between probability distributions of different dimensions,” IEEE Transactions on Information Theory, vol. 68, no. 6, pp. 4020–4031, 2022.
Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.