Skip to main content
SpringerLink
Log in

Distributing Quantum Computations, by Shots

  • Conference paper
  • First Online:
Service-Oriented Computing (ICSOC 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14419))

Included in the following conference series:

  • 794 Accesses

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”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 74.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The presentation is deliberately simplified and the actual physical definitions or motivations are not discussed due to lack of space.

  2. 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. 3.

    used_computers counts the number of QPUs in the distribution and is predefined.

  4. 4.

    https://quantum-computing.ibm.com/lab/docs/iql/manage/systems/sessions/.

References

  1. Albash, T., et al.: Adiabatic quantum computation. Rev. Mod. Phys. 90(1), 015002 (2018)

    Article  MathSciNet  Google Scholar 

  2. Ayral, T., et al.: Quantum divide and compute: hardware demonstrations and noisy simulations. In: 2020 IEEE ISVLSI, pp. 138–140 (2020)

    Google Scholar 

  3. Bharti, K., et al.: Noisy intermediate-scale quantum algorithms. Rev. Mod. Phys. 94(1), 015004 (2022)

    Article  MathSciNet  Google Scholar 

  4. Bonatti, P., et al.: Answer set programming. 25 Years GULP, pp. 159–182 (2010)

    Google Scholar 

  5. Cerezo, M., et al.: Variational quantum algorithms. Nat. Rev. Phys. 3(9), 625–644 (2021)

    Article  Google Scholar 

  6. Furutanpey, A., et al.: Architectural vision for quantum computing in the edge-cloud continuum. CoRR arxiv:2305.05238 (2023)

  7. Garcia-Alonso, J., et al.: Quantum software as a service through a quantum API gateway. IEEE Internet Comput. 26(1), 34–41 (2022)

    Article  Google Scholar 

  8. Grossi, M., et al.: A serverless cloud integration for quantum computing (2021)

    Google Scholar 

  9. Hauke, P., et al.: Perspectives of quantum annealing: methods and implementations. Rep. Prog. Phys. 83(5), 054401 (2020)

    Article  MathSciNet  Google Scholar 

  10. Jaschke, D., et al.: Is quantum computing green? an estimate for an energy-efficiency quantum advantage. Quant. Sci. Technol. 8(2), 025001 (2023)

    Article  Google Scholar 

  11. Kim, Y., et al.: Evidence for the utility of quantum computing before fault tolerance. Nature 618(7965), 500–505 (2023)

    Article  Google Scholar 

  12. Ladd, T.D., et al.: Quantum computers. Nature 464(7285), 45–53 (2010)

    Article  Google Scholar 

  13. Lowe, A., et al.: Fast quantum circuit cutting with randomized measurements. Quantum 7, 934 (2023)

    Article  Google Scholar 

  14. Michielsen, K., et al.: Benchmarking gate-based quantum computers. Comput. Phys. Commun. 220, 44–55 (2017)

    Article  MathSciNet  Google Scholar 

  15. Quetschlich, N., et al.: Predicting good quantum circuit compilation options. CoRR arxiv:2210.08027 (2022)

  16. Ravi, G.S., et al.: Adaptive job and resource management for the growing quantum cloud. In: IEEE QCE, pp. 301–312 (2021)

    Google Scholar 

  17. Salm, M., et al.: The NISQ analyzer: automating the selection of quantum computers for quantum algorithms. In: SummerSOC 2020, pp. 66–85 (2020)

    Google Scholar 

  18. Salm, M., et al.: Automating the comparison of quantum compilers for quantum circuits. In: CCIS, vol. 1429, pp. 64–80 (2021)

    Google Scholar 

  19. Salm, M., et al.: Optimizing the prioritization of compiled quantum circuits by machine learning approaches. In: CCIS, vol. 1603, pp. 161–181 (2022)

    Google Scholar 

  20. Salm, M., et al.: Prioritization of compiled quantum circuits for different quantum computers. In: IEEE SANER, pp. 1258–1265 (2022)

    Google Scholar 

  21. Salm, M., et al.: How to select quantum compilers and quantum computers before compilation. In: CLOSER, pp. 172–183 (2023)

    Google Scholar 

  22. Sundaram, R.G., et al.: Efficient distribution of quantum circuits. In: LIPIcs, vol. 209, pp. 41:1–41:20 (2021)

    Google Scholar 

  23. Tang, W., et al.: Cutting quantum circuits to run on quantum and classical platforms. CoRR arxiv:2205.05836 (2022)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Pisa, Pisa, Italy

    Giuseppe Bisicchia & Antonio Brogi

  2. Quercus Software Engineering Group, University of Extremadura, Cáceres, Spain

    Jose García-Alonso & Juan M. Murillo

Authors
  1. Giuseppe Bisicchia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jose García-Alonso
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Juan M. Murillo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Antonio Brogi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giuseppe Bisicchia .

Editor information

Editors and Affiliations

  1. Sapienza University of Rome, Rome, Italy

    Flavia Monti

  2. Technical University of Munich, Garching, Germany

    Stefanie Rinderle-Ma

  3. University of Seville, Seville, Spain

    Antonio Ruiz Cortés

  4. Sun Yat-sen University, Guangzhou, China

    Zibin Zheng

  5. Sapienza University of Rome, Rome, Italy

    Massimo Mecella

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics

Search

Navigation