Abstract
Quantum Process Units (QPUs) are becoming more widely accessible to the public. Nonetheless, they still are very susceptible to noise and feature only a small amount of qubits, making it possible to only execute short quantum computations. Facing this problem, several approaches were proposed to make the most of the present situation, either by distributing the Quantum load, sending different Quantum programs to different QPUs or by distributing Quantum program fragments, by cutting a Quantum program into multiple smaller chunks. Here, we propose a change of perspective. Due to the probabilistic nature of Quantum Mechanics, it is usually required to iterate the execution of a Quantum program numerous times or shots. We suggest considering the shots dimension while determining how to distribute quantum computations. In this paper, we design and develop a methodology to distribute the shots of a Quantum program among many QPUs. Exploiting multiple QPUs improves the resilience to potential QPUs failures. Our solution also enables users to directly encode, through a proposed DSL, their own distribution strategies according to their needs and considered scenarios, offering an expressive and customisable approach. Finally, we showcase a prototype implementation and discuss a life-like use case that can only be addressed by relying on our approach.
This work is supported by the QSALUD project (EXP 00135977/MIG-20201059) in the lines of action of the Center for the Development of Industrial Technology (CDTI); and by the Ministry of Economic Affairs and Digital Transformation of the Spanish Government through the Quantum ENIA project call – Quantum Spain project, by the European Union through the Recovery, Transformation and Resilience Plan – NextGenerationEU within the framework of the Digital Spain 2025 Agenda, and by UNIPI PRA 2022 64 “hOlistic Sustainable Management of distributed softWARE systems” (OSMWARE) project funded by the University of Pisa, Italy. This work is also part of the Grant PID2021-1240454OB-C31 funded by MCIN/AEI/10.13039/50100011033 and by “ERDF A way of making Europe”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
The presentation is deliberately simplified and the actual physical definitions or motivations are not discussed due to lack of space.
- 2.
The full code, comprising the use cases, examples of QPUs manifest and a detailed explanation of our DSL are available at https://github.com/di-unipi-socc/QuantumBroker.
- 3.
used_computers counts the number of QPUs in the distribution and is predefined.
- 4.
References
Albash, T., et al.: Adiabatic quantum computation. Rev. Mod. Phys. 90(1), 015002 (2018)
Ayral, T., et al.: Quantum divide and compute: hardware demonstrations and noisy simulations. In: 2020 IEEE ISVLSI, pp. 138–140 (2020)
Bharti, K., et al.: Noisy intermediate-scale quantum algorithms. Rev. Mod. Phys. 94(1), 015004 (2022)
Bonatti, P., et al.: Answer set programming. 25 Years GULP, pp. 159–182 (2010)
Cerezo, M., et al.: Variational quantum algorithms. Nat. Rev. Phys. 3(9), 625–644 (2021)
Furutanpey, A., et al.: Architectural vision for quantum computing in the edge-cloud continuum. CoRR arxiv:2305.05238 (2023)
Garcia-Alonso, J., et al.: Quantum software as a service through a quantum API gateway. IEEE Internet Comput. 26(1), 34–41 (2022)
Grossi, M., et al.: A serverless cloud integration for quantum computing (2021)
Hauke, P., et al.: Perspectives of quantum annealing: methods and implementations. Rep. Prog. Phys. 83(5), 054401 (2020)
Jaschke, D., et al.: Is quantum computing green? an estimate for an energy-efficiency quantum advantage. Quant. Sci. Technol. 8(2), 025001 (2023)
Kim, Y., et al.: Evidence for the utility of quantum computing before fault tolerance. Nature 618(7965), 500–505 (2023)
Ladd, T.D., et al.: Quantum computers. Nature 464(7285), 45–53 (2010)
Lowe, A., et al.: Fast quantum circuit cutting with randomized measurements. Quantum 7, 934 (2023)
Michielsen, K., et al.: Benchmarking gate-based quantum computers. Comput. Phys. Commun. 220, 44–55 (2017)
Quetschlich, N., et al.: Predicting good quantum circuit compilation options. CoRR arxiv:2210.08027 (2022)
Ravi, G.S., et al.: Adaptive job and resource management for the growing quantum cloud. In: IEEE QCE, pp. 301–312 (2021)
Salm, M., et al.: The NISQ analyzer: automating the selection of quantum computers for quantum algorithms. In: SummerSOC 2020, pp. 66–85 (2020)
Salm, M., et al.: Automating the comparison of quantum compilers for quantum circuits. In: CCIS, vol. 1429, pp. 64–80 (2021)
Salm, M., et al.: Optimizing the prioritization of compiled quantum circuits by machine learning approaches. In: CCIS, vol. 1603, pp. 161–181 (2022)
Salm, M., et al.: Prioritization of compiled quantum circuits for different quantum computers. In: IEEE SANER, pp. 1258–1265 (2022)
Salm, M., et al.: How to select quantum compilers and quantum computers before compilation. In: CLOSER, pp. 172–183 (2023)
Sundaram, R.G., et al.: Efficient distribution of quantum circuits. In: LIPIcs, vol. 209, pp. 41:1–41:20 (2021)
Tang, W., et al.: Cutting quantum circuits to run on quantum and classical platforms. CoRR arxiv:2205.05836 (2022)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Bisicchia, G., García-Alonso, J., Murillo, J.M., Brogi, A. (2023). Distributing Quantum Computations, by Shots. In: Monti, F., Rinderle-Ma, S., Ruiz Cortés, A., Zheng, Z., Mecella, M. (eds) Service-Oriented Computing. ICSOC 2023. Lecture Notes in Computer Science, vol 14419. Springer, Cham. https://doi.org/10.1007/978-3-031-48421-6_25
Download citation
DOI: https://doi.org/10.1007/978-3-031-48421-6_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-48420-9
Online ISBN: 978-3-031-48421-6
eBook Packages: Computer ScienceComputer Science (R0)