Skip to main content

Advertisement

Springer Nature Link
Log in

Qubit Mapping Based on Tabu Search

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The goal of qubit mapping is to map a logical circuit to a physical device by introducing additional gates as few as possible in an acceptable amount of time. We present an effective approach called Tabu Search Based Adjustment (TSA) algorithm to construct the mappings. It consists of two key steps: one is making use of a combined subgraph isomorphism and completion to initialize some candidate mappings, and the other is dynamically modifying the mappings by TSA. Our experiments show that, compared with state-of-the-art methods, TSA can generate mappings with a smaller number of additional gates and have better scalability for large-scale circuits.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Shor P W. Algorithms for quantum computation: Discrete logarithms and factoring. In Proc. the 35th Annual Symposium on Foundations of Computer Science, Nov. 1994, pp.124–134. DOI: https://doi.org/10.1109/SFCS.1994.365700.

  2. Grover L K. A fast quantum mechanical algorithm for database search. In Proc. the 28th Annual ACM Symposium on the Theory of Computing, Jul. 1996, pp.212–219. DOI: https://doi.org/10.1145/237814.237866.

  3. Harrow A W, Hassidim A, Lloyd S. Quantum algorithm for linear systems of equations. Physical Review Letters, 2009, 103(15): 150502. DOI: https://doi.org/10.1103/PhysRevLett.103.150502.

    Article  MathSciNet  Google Scholar 

  4. Arute F, Arya K, Babbush R et al. Quantum supremacy using a programmable superconducting processor. Nature, 2019, 574(7779): 505–510. DOI: https://doi.org/10.1038/s41586-019-1666-5.

    Article  Google Scholar 

  5. Almudever C G, Lao L L, Wille R, Guerreschi G G. Realizing quantum algorithms on real quantum computing devices. In Proc. the 23rd Conference on Design, Automation and Test in Europe, Mar. 2020, pp.864–872. DOI: https://doi.org/10.23919/DATE48585.2020.9116240.

  6. Reagor M, Pfaff W, Axline C et al. Quantum memory with millisecond coherence in circuit QED. Physical Review B, 2016, 94(1): 014506. DOI: https://doi.org/10.1103/PhysRevB.94.014506.

    Article  Google Scholar 

  7. Sun S X, Luo Q. In-memory subgraph matching: An in-depth study. In Proc. the 2020 ACM SIGMOD International Conference on Management of Data, Jun. 2020, pp.1083–1098. DOI: https://doi.org/10.1145/3318464.3380581.

  8. Siraichi M Y, dos Santos V F, Collange C, Pereira F M Q. Qubit allocation. In Proc. the 2018 International Symposium on Code Generation and Optimization, Feb. 2018, pp.113–125. DOI: https://doi.org/10.1145/3168822.

  9. Glover F. Tabu search-part II. ORSA Journal on Computing, 1990, 2(1): 4–32. DOI: https://doi.org/10.1287/ijoc.2.1.4.

    Article  Google Scholar 

  10. Zulehner A, Paler A, Wille R. An efficient methodology for mapping quantum circuits to the IBM QX architectures. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2019, 38(7): 1226–1236. DOI: https://doi.org/10.1109/TCAD.2018.2846658.

    Article  Google Scholar 

  11. Li G S, Ding Y F, Xie Y. Tackling the qubit mapping problem for NISQ-era quantum devices. In Proc. the 24th International Conference on Architectural Support for Programming Languages and Operating Systems, Apr. 2019, pp.1001–1014. DOI: https://doi.org/10.1145/3297858.3304023.

  12. Li S J, Zhou X Z, Feng Y. Qubit mapping based on subgraph isomorphism and filtered depth-limited search. IEEE Transactions on Computers, 2021, 70(11): 1777–1788. DOI: https://doi.org/10.1109/TC.2020.3023247.

    Article  MathSciNet  Google Scholar 

  13. Zhu P C, Guan Z J, Cheng X Y. A dynamic look-ahead heuristic for the qubit mapping problem of NISQ computers. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2020, 39(12): 4721–4735. DOI: https://doi.org/10.1109/TCAD.2020.2970594.

    Article  Google Scholar 

  14. Cai S W, Su K L. Local search for Boolean Satisfiability with configuration checking and subscore. Artificial Intelligence, 2013, 204: 75–98. DOI: https://doi.org/10.1016/j.artmt.2013.09.001.

    Article  Google Scholar 

  15. Paler A. On the influence of initial qubit placement during NISQ circuit compilation. In Proc. the 1st International Workshop on Quantum Technology and Optimization Problems, Mar. 2019, pp.207–217. DOI: https://doi.org/10.1007/9783-030-14082-318.

  16. Kissinger A, van de Griend A M. CNOT circuit extraction for topologically-constrained quantum memories. Quantum Information and Computation, 2020, 20(7/8): 581–596. DOI: https://doi.org/10.26421/QIC20.7-8-4.

    Article  MathSciNet  Google Scholar 

  17. Nash B, Gheorghiu V, Mosca M. Quantum circuit optimizations for NISQ architectures. Quantum Science and Technology, 2020, 5(2): 025010. DOI: https://doi.org/10.1088/2058-9565/ab79b1.

    Article  Google Scholar 

  18. Venturelli D, Do M, Rieffel E, Frank J. Temporal planning for compilation of quantum approximate optimization circuits. In Proc. the 26th International Joint Conference on Artificial Intelligence, Aug. 2017, pp.4440–4446.

  19. Bernal D E, Booth K E C, Dridi R, Alghassi H, Tayur S, Venturelli D. Integer programming techniques for minor-embedding in quantum annealers. In Proc. the 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Sept. 2020, pp.112–129. DOI: https://doi.org/10.1007/978-3-030-58942-4_8.

  20. de Almeida A A A, Dueck G W, da Silva A C R. Finding optimal qubit permutations for IBM’s quantum computer architectures. In Proc. the 32nd Symposium on Integrated Circuits and Systems Design, 2019, Article No. 13. DOI: https://doi.org/10.1145/3338852.3339829.

  21. Wille R, Burgholzer L, Zulehner A. Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H operations. In Proc. the 56th Annual Design Automation Conference 2019, Jun. 2019, Article No. 142. DOI: https://doi.org/10.1145/3316781.3317859.

  22. Shafaei A, Saeedi M, Pedram M. Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures. In Proc. the 50th Annual Design Automation Conference, May 2013, Article No. 41. DOI: https://doi.org/10.1145/2463209.2488785.

  23. Guerreschi G G, Park J. Two-step approach to scheduling quantum circuits. Quantum Science and Technology, 2018, 3(4): 045003. DOI: https://doi.org/10.1088/2058-9565/aacf0b.

    Article  Google Scholar 

  24. Matsuo A, Yamashita S. An efficient method for quantum circuit placement problem on a 2-D grid. In Proc. the 11th International Conference on Reversible Computation, Jun. 2019, pp.162–168. DOI: https://doi.org/10.1007/978-3-030-21500-2_10.

  25. Cowtan A, Dilkes S, Duncan R, Krajenbrink A, Simmons W, Sivarajah S. On the qubit routing problem. In Proc. the 14th Conference on the Theory of Quantum Computation, Communication and Cryptography, May 2019, Article No. 5. DOI: https://doi.org/10.4230/LIPIcs.TQC.2019.5.

  26. Zhou X Z, Li S J, Feng Y. Quantum circuit transformation based on simulated annealing and heuristic search. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2020, 39(12): 4683–4694. DOI: https://doi.org/10.1109/TCAD.2020.2969647.

    Article  Google Scholar 

  27. Tannu S S, Qureshi M K. Not all qubits are created equal: A case for variability-aware policies for NISQ-era quantum computers. In Proc. the 24th International Conference on Architectural Support for Programming Languages and Operating Systems, Apr. 2019, pp.987–999. DOI: https://doi.org/10.1145/3297858.3304007.

  28. Lao L L, van Someren H, Ashraf I, Almudever C G. Timing and resource-aware mapping of quantum circuits to superconducting processors. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2022, 41(2): 359–371. DOI: https://doi.org/10.1109/TCAD.2021.3057583.

    Article  Google Scholar 

  29. Guerreschi G G. Scheduler of quantum circuits based on dynamical pattern improvement and its application to hardware design. arXiv: 1912.00035, 2019. https://arxiv.org/abs/1912.00035, Mar. 2024.

  30. Nielsen M A, Chuang I L. Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, 2010.

  31. Barenco A, Bennett C H, Cleve R, DiVincenzo D P, Margolus N, Shor P, Sleator T, Smolin J A, Weinfurter H. Elementary gates for quantum computation. Physical Review A, 1995, 52(5): 3457–3467. DOI: https://doi.org/10.1103/PhysRevA.52.3457.

    Article  Google Scholar 

  32. Mottonen M, Vartiainen J J. Decompositions of general quantum gates. Frontiers in Artificial Intelligence and Applications, 2005, 57(8): 1263–1270. DOI: https://doi.org/10.1103/PhysRevLett.93.130502.

    Google Scholar 

  33. Cross A, Javadi-Abhari A, Alexander T et al. Open-QASM 3: A broader and deeper quantum assembly language. ACM Transactions on Quantum Computing, 2022, 3(3): 12. DOI: https://doi.org/10.1145/3505636.

    Article  Google Scholar 

  34. Floyd R W. Algorithm 97: Shortest path. Communications of the ACM, 1962, 5(6): 345. DOI: https://doi.org/10.1145/367766.368168.

    Article  Google Scholar 

  35. Wille R, Große D, Teuber L, Dueck G W, Drechsler R. Revlib: An online resource for reversible functions and reversible circuits. In Proc. the 38th International Symposium on Multiple Valued Logic, May 2008, pp.220–225. DOI: https://doi.org/10.1109/ISMVL.2008.43.

Download references

Author information

Authors and Affiliations

  1. Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, 200062, China

    Hui Jiang  (蒋　慧), Yu-Xin Deng  (邓玉欣) & Ming Xu  (徐　鸣)

Authors
  1. Hui Jiang  (蒋　慧)
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu-Xin Deng  (邓玉欣)
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ming Xu  (徐　鸣)
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu-Xin Deng  (邓玉欣).

Ethics declarations

Conflict of Interest The authors declare that they have no conflict of interest.

Additional information

This work was supported by the National Natural Science Foundation of China under Grant Nos. 61832015, 62072176, 12271172 and 11871221, the Research Funds of Happiness Flower of East China Normal University under Grant No. 2020ECNU-XFZH005, the Fundamental Research Funds for the Central Universities of China under Grant No. 2021JQRH014, Shanghai Trusted Industry Internet Software Collaborative Innovation Center, and the “Digital Silk Road” Shanghai International Joint Lab of Trustworthy Intelligent Software under Grant No. 22510750100.

Hui Jiang received her B.Eng. degree in computer science and technology from Sichuan Agriculture University, Ya’an, in 2019. She is currently a Ph.D. candidate at Shanghai Key Laboratory of Trustworthy Computing, East China Normal University (EC-NU), Shanghai. Her research interests include quantum circuit compilation and optimization.

Yu-Xin Deng received his B.Eng. degree in thermal energy engineering and M.Sc. degree in computer science from Shanghai Jiao Tong University, Shanghai, in 1999 and 2002, respectively, and his Ph.D. degree in computer science from Ecole des Mines de Paris, Paris, in 2005. He is a professor of East China Normal University (ECNU), Shanghai. His research interests include concurrency theory, especially about process calculi, formal semantics of programming languages, as well as quantum computing.

Ming Xu received his B.Eng. degree in software engineering and Ph.D. degree in system sciences from East China Normal University (ECNU), Shanghai, in 2005 and 2010, respectively. He is currently an associate research professor at Shanghai Key Laboratory of Trustworthy Computing, ECNU. His research interests include computer algebra, program verification, and quantum computing.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jiang, H., Deng, YX. & Xu, M. Qubit Mapping Based on Tabu Search. J. Comput. Sci. Technol. 39, 421–433 (2024). https://doi.org/10.1007/s11390-023-2121-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-023-2121-5

Keywords