Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Hybrid Classical-Quantum HPC Workload (2312.04933v1)

Published 8 Dec 2023 in quant-ph and cs.DC

Abstract: A strategy for the orchestration of hybrid classical-quantum workloads on supercomputers featuring quantum devices is proposed. The method makes use of heterogeneous job launches with Slurm to interleave classical and quantum computation, thereby reducing idle time of the quantum components. To better understand the possible shortcomings and bottlenecks of such a workload, an example application is investigated that offloads parts of the computation to a quantum device. It executes on a classical HPC system, with a server mimicking the quantum device, within the MPMD paradigm in Slurm. Quantum circuits are synthesized by means of the Classiq software suite according to the needs of the scientific application, and the Qiskit Aer circuit simulator computes the state vectors. The HHL quantum algorithm for linear systems of equations is used to solve the algebraic problem from the discretization of a linear differential equation. Communication takes place over the MPI, which is broadly employed in the HPC community. Extraction of state vectors and circuit synthesis are the most time consuming, while communication is negligible in this setup. The present test bed serves as a basis for more advanced hybrid workloads eventually involving a real quantum device.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (11)
  1. A. Montanaro, “Quantum algorithms: an overview,” npj Quantum Information, vol. 2, no. 1, pp. 1–8, 2016.
  2. J. H. Davenport, J. R. Jones, and M. Thomason, “A practical overview of quantum computing: Is exascale possible?” 2023.
  3. “Slurm workload manager,” https://slurm.schedmd.com/. [Online]. Available: https://slurm.schedmd.com/
  4. T. Hoefler, T. Häner, and M. Troyer, “Disentangling hype from practicality: On realistically achieving quantum advantage,” Communications of the ACM, vol. 66, no. 5, p. 82–87, apr 2023. [Online]. Available: https://doi.org/10.1145/3571725
  5. A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,” Physical review letters, vol. 103, no. 15, p. 150502, 2009.
  6. “Classiq: Create quantum computing software without limits,” https://www.classiq.io/. [Online]. Available: https://www.classiq.io/
  7. L. S. Bishop, “Qasm 2.0: A quantum circuit intermediate representation,” in APS March Meeting Abstracts, vol. 2017, 2017, pp. P46–008.
  8. L. Dalcin and Y.-L. L. Fang, “mpi4py: Status update after 12 years of development,” Computing in Science & Engineering, vol. 23, no. 4, pp. 47–54, 2021.
  9. C. Haine, U.-U. Haus, M. Martinasso, D. Pleiter, F. Tessier, D. Sarmany, S. Smart, T. Quintino, and A. Tate, “A middleware supporting data movement in complex and software-defined storage and memory architectures,” in High Performance Computing: ISC High Performance Digital 2021 International Workshops, Frankfurt am Main, Germany, June 24–July 2, 2021, Revised Selected Papers 36.   Springer, 2021, pp. 346–357.
  10. J. Doi and H. Horii, “Cache blocking technique to large scale quantum computing simulation on supercomputers,” in 2020 IEEE International Conference on Quantum Computing and Engineering (QCE).   IEEE, 2020, pp. 212–222.
  11. C. R. Harris, K. J. Millman, S. J. van der Walt, R. Gommers, P. Virtanen, D. Cournapeau, E. Wieser, J. Taylor, S. Berg, N. J. Smith, R. Kern, M. Picus, S. Hoyer, M. H. van Kerkwijk, M. Brett, A. Haldane, J. F. del Río, M. Wiebe, P. Peterson, P. Gérard-Marchant, K. Sheppard, T. Reddy, W. Weckesser, H. Abbasi, C. Gohlke, and T. E. Oliphant, “Array programming with NumPy,” Nature, vol. 585, no. 7825, pp. 357–362, Sep 2020. [Online]. Available: https://doi.org/10.1038/s41586-020-2649-2
Citations (1)

Summary

We haven't generated a summary for this paper yet.