Skip to main content
SpringerLink
Log in

BQA: a high-performance quantum circuits scheduling strategy based on heuristic search

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Quantum computing is currently a research hotspot in both academia and industry. The inherent parallelism of quantum computers and the resulting powerful computing power will bring new solutions to many problems that are difficult for classical computers. However, due to the limitations of technical conditions, it is difficult to achieve full direct coupling of all qubits on a quantum chip. When compiling a quantum circuit onto a physical chip, it is necessary to ensure those two-qubit gates act on pairs of directly coupled qubits by inserting SWAP gates. It will cause great additional cost when a large number of SWAP gates are inserted, leading to the execution time of quantum circuits longer. In this paper, we designed a strategy based on the business of each individual qubit to insert SWAP gates, named Busy-Qubits-Avoid Strategy. On the one hand, we try to hide the time overhead incurred by the inserted SWAP gates by exploiting the uneven distribution of quantum gates over qubits. On the other hand, we also expect the inserted SWAP gates to make as little negative impact on subsequent two-qubit gates as possible. We designed a heuristic function which takes into account both of these points. Compared with Sabre and tket, we achieved a better effect. In addition, as the number of two-qubit gates increases, better optimization results will be achieved. This implies higher execution efficiency and lower decoherence error rate.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Data availability

Not applicable.

References

  1. Feynman RP (1982) Simulating physics with computers. Int J Theor Phys 21:467–488. https://doi.org/10.1007/BF02650179

    Article  MathSciNet  Google Scholar 

  2. Gill SS, Kumar A, Singh H, Singh M, Kaur K, Usman M, Buyya R (2022) Quantum computing: a taxonomy, systematic review and future directions. Softw: Pract Exp 52:66–114. https://doi.org/10.1002/spe.3039

    Article  Google Scholar 

  3. Fedorov AK, Gisin N, Beloussov SM, Lvovsky AI (2022) Quantum computing at the quantum advantage threshold: a down-to-business review. arXiv:2203.17181https://doi.org/10.48550/arXiv.2203.17181

  4. Egger DJ, Gambella C, Marecek J, McFaddin S, Mevissen M, Raymond R, Simonetto A, Woerner S, Yndurain E (2020) Quantum computing for finance: state-of-the-art and future prospects. IEEE Trans Quant Eng 1:1–24. https://doi.org/10.1109/TQE.2020.3030314

    Article  Google Scholar 

  5. Biamonte J, Wittek P, Pancotti N, Rebentrost P, Wiebe N, Lloyd S (2017) Quantum machine learning. Nature 549:195–202. https://doi.org/10.1038/nature23474

    Article  Google Scholar 

  6. Cao Y, Romero J, Olson JP, Degroote M, Johnson PD, Kieferová M, Kivlichan ID, Menke T, Peropadre B, Sawaya NPD, Sim S, Veis L, Aspuru-Guzik A (2019) Quantum chemistry in the age of quantum computing. Chem Rev 119:10856–10915. https://doi.org/10.1021/acs.chemrev.8b00803

    Article  Google Scholar 

  7. Clarke SJ (2020) Quantum computing: a mathematical analysis of shor’s algorithm. arXiv:1601.07195https://doi.org/10.48550/arXiv.1601.07195

  8. Orús R, Mugel S, Lizaso E (2019) Quantum computing for finance: overview and prospects. Rev Phys 4:100028. https://doi.org/10.1016/j.revip.2019.100028

    Article  Google Scholar 

  9. Rahaman M, Islam MM (2016) An overview on quantum computing as a service (qcaas): probability or possibility. Int J Math Sci Comput (IJMSC) 2:16–22. https://doi.org/10.5815/ijmsc.2016.01.02

    Article  Google Scholar 

  10. Aleksandrowicz G, Alexander T, Barkoutsos P, Bello L et al (2019) Qiskit: an Open-source Framework for Quantum Computing. Qiskit Res Commun. https://doi.org/10.5281/zenodo.2562111

  11. Cirq Developers (2021) Cirq. Zenodo. https://doi.org/10.5281/zenodo.6599601. See full list of authors on Github: https://github.com/quantumlib/Cirq/graphs/contributors

  12. Smelyanskiy M, Sawaya NPD, Aspuru-Guzik A (2016) qhipster: The quantum high performance software testing environment. arXiv:1601.07195https://doi.org/10.48550/arXiv.1601.07195

  13. Niu S, Suau A, Staffelbach G, Todri-Sanial A (2020) A hardware-aware heuristic for the qubit mapping problem in the nisq era. IEEE Trans Quant Eng 1:1–14. https://doi.org/10.1109/TQE.2020.3026544

    Article  Google Scholar 

  14. Matsuo A, Hattori W, Yamashita S (2019) Reducing the overhead of mapping quantum circuits to ibm q system. In: 2019 IEEE International Symposium on Circuits and Systems (ISCAS), pp 1–5. https://doi.org/10.1109/ISCAS.2019.8702439

  15. Siraichi MY, Santos VFd, Collange C, Pereira FMQ (2018) Qubit allocation. In: Proceedings of the 2018 International Symposium on Code Generation and Optimization, pp 113–125. https://doi.org/10.1145/3168822

  16. Veldhorst M, Yang C, Hwang J, Huang W, Dehollain J, Muhonen J, Simmons S, Laucht A, Hudson F, Itoh KM et al (2015) A two-qubit logic gate in silicon. Nature 526:410–414. https://doi.org/10.1038/nature15263

    Article  Google Scholar 

  17. Wille R, Keszocze O, Walter M, Rohrs P, Chattopadhyay A, Drechsler R (2016) Look-Ahead Schemes for Nearest Neighbor Optimization of 1d and 2d Quantum Circuits. In: 2016 21st Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 292–297. https://doi.org/10.1109/ASPDAC.2016.7428026

  18. Kole A, Datta K, Sengupta I (2016) A heuristic for linear nearest neighbor realization of quantum circuits by swap gate insertion using \(n\)-gate lookahead. IEEE J merg Select Top Circ Syst 6:62–72. https://doi.org/10.1109/JETCAS.2016.2528720

    Article  Google Scholar 

  19. Cowtan A, Dilkes S, Duncan R, Krajenbrink A, Simmons W, Sivarajah S (2019) On the qubit routing problem. arXiv preprint arXiv:1902.08091

  20. Molavi A, Xu A, Diges M, Pick L, Tannu S, Albarghouthi A (2022) Qubit mapping and routing via maxsat. In: 2022 55th IEEE/ACM International Symposium on Microarchitecture (MICRO), pp 1078–1091. IEEE

  21. Wilmott CM, Wild PR (2012) On a generalized quantum swap gate. Int J Quant Inform 10(03):1250034. https://doi.org/10.1142/S0219749912500347

    Article  Google Scholar 

  22. Bapat A, Childs AM, Gorshkov AV, Schoute E (2023) Advantages and limitations of quantum routing. PRX Quant 4(1):010313

    Article  Google Scholar 

  23. Li G, Ding Y, Xie Y (2019) Tackling the Qubit Mapping Problem for Nisq-Era Quantum Devices. In: Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems. ASPLOS ’19, pp 1001–1014. Association for Computing Machinery, New York, NY, USA. https://doi.org/10.1145/3297858.3304023

  24. Sivarajah S, Dilkes S, Cowtan A, Simmons W, Edgington A, Duncan R (2020) t-ket>: a retargetable compiler for nisq devices. Quant Sci Technol 6(1):014003. https://doi.org/10.1088/2058-9565/ab8e92

    Article  Google Scholar 

  25. Liu L, Dou X (2021) Qucloud: a new qubit mapping mechanism for multi-programming quantum computing in cloud environment. In: 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA), pp 167–178. https://doi.org/10.1109/HPCA51647.2021.00024

  26. Wille R, Burgholzer L, Zulehner A (2019) Mapping quantum circuits to ibm qx architectures using the minimal number of swap and h operations. In: Proceedings of the 56th Annual Design Automation Conference 2019, pp 1–6. https://doi.org/10.1145/3316781.3317859

  27. Zhang C, Hayes AB, Qiu L, Jin Y, Chen Y, Zhang EZ (2021) Time-Optimal Qubit Mapping. In: Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, pp 360–374. https://doi.org/10.1145/3445814.3446706

  28. Pozzi MG, Herbert SJ, Sengupta A, Mullins RD (2022) Using reinforcement learning to perform qubit routing in quantum compilers. ACM Trans Quant Comput. https://doi.org/10.1145/3520434

  29. Nannicini G, Bishop LS, Günlük O, Jurcevic P (2022) Optimal qubit assignment and routing via integer programming. ACM Trans Quant Comput. https://doi.org/10.1145/3544563

    Article  Google Scholar 

  30. Liu J, Li P, Zhou H (2022) Not all swaps have the same cost: A case for optimization-aware qubit routing. In: 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA), pp 709–725. https://doi.org/10.1109/HPCA53966.2022.00058

  31. Banerjee A, Liang X, Tohid R (2022) Locality-aware qubit routing for the grid architecture. In: 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp 607–613. IEEE

  32. Lye A, Wille R, Drechsler R (2015) Determining the Minimal Number of Swap Gates for Multi-Dimensional Nearest Neighbor Quantum Circuits. In: The 20th Asia and South Pacific Design Automation Conference, pp 178–183. https://doi.org/10.1109/ASPDAC.2015.7059001

  33. Nielsen MA, Chuang IL (2010) Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press. https://doi.org/10.1017/CBO9780511976667

  34. Barenco A, Bennett CH, Cleve R, DiVincenzo DP, Margolus N, Shor P, Sleator T, Smolin JA, Weinfurter H (1995) Elementary gates for quantum computation. Phys Rev A 52:3457–3467. https://doi.org/10.1103/PhysRevA.52.3457

    Article  Google Scholar 

  35. Williams CP (2011) Explorations in Quantum Computing. Springer. https://doi.org/10.1007/978-1-84628-887-6

Download references

Funding

Not applicable.

Author information

Authors and Affiliations

  1. The 32nd Research Institute of China Electronics Technology Group Corporation, Shanghai, 201808, China

    Xin-miao Chen, Shi Wang, Yong-jin Ye, Yong-zheng Wu & Bo Jiang

Authors
  1. Xin-miao Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shi Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yong-jin Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yong-zheng Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Bo Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

X-mC comes up with the idea, design experiments, and complete thesis writing. X-mC and SW wrote the main manuscript text. Y-zW is responsible for project management. BJ provided financial support. All authors reviewed the manuscript.

Corresponding author

Correspondence to Xin-miao Chen.

Ethics declarations

Ethical approval

Not applicable.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, Xm., Wang, S., Ye, Yj. et al. BQA: a high-performance quantum circuits scheduling strategy based on heuristic search. J Supercomput 80, 10172–10189 (2024). https://doi.org/10.1007/s11227-023-05848-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-023-05848-2

Keywords

Search

Navigation