A binary integer programming-based method for qubit mapping in sparse architectures (original) (raw)

References

  1. Almeida, A.A.A., Dueck, G.W., Silva, A.C.R.: Finding optimal qubit permutations for IBM’s quantum computer architectures. In: Proceedings of the 32nd Symposium on Integrated Circuits and Systems Design. SBCCI’19, pp. 1–6. ACM, Sao Paulo, Brazil (2019). https://doi.org/10.1145/3338852.3339829
  2. Benioff, P.: The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by turing machines. J. Stat. Phys. 22, 563–591 (1980). https://doi.org/10.1007/BF01011339
    Article MathSciNet MATH Google Scholar
  3. Bernal, D.E., Booth, K.E.C., Dridi, R., Alghassi, H., Tayur, S.R., Venturelli, D.: Integer programming techniques for minor-embedding in quantum annealers. In: Proceedings of the 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 112–129. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-58942-4_8
  4. Cowtan, A., Dilkes, S., Duncan, R., Krajenbrink, A., Simmons, W., Sivarajah, S.: On the qubit routing problem. In: Proceedings of the 14th Conference on the Theory of Quantum Computation, Communication and Cryptography. LIPIcs, vol. 135, pp. 1–32. Dagstuhl, Germany (2019). https://doi.org/10.4230/LIPIcs.TQC.2019.5
  5. Debnath, S., Linke, N.M., Figgatt, C., Landsman, K.A., Wright, K., Monroe, C.: Demonstration of a small programmable quantum computer with atomic qubits. Nature 536(7614), 63–66 (2016). https://doi.org/10.1038/nature18648
    Article Google Scholar
  6. Gray, F.: Pulse Code Communication, US (1953)
  7. Jiang, H., Deng, Y., Xu, M.: Qubit mapping based on Tabu search. J. Comput. Sci. Technol. 39(2), 421–433 (2023). https://doi.org/10.1007/s11390-023-2121-5
    Article MATH Google Scholar
  8. Jiang, H., Li, D., Deng, Y., Xu, M.: A pattern matching-based framework for quantum circuit rewriting. J. Comput. Sci. Technol. (2024). https://doi.org/10.1007/s11390-024-2726-3
    Article MATH Google Scholar
  9. Koch, J., Yu, T.M., Gambetta, J., Houck, A.A., Schuster, D.I., Majer, J., Blais, A., Devoret, M.H., Girvin, S.M., Schoelkopf, R.J.: Charge-insensitive qubit design derived from the cooper pair box. Phys. Rev. A 76, 042319 (2007). https://doi.org/10.1103/PhysRevA.76.042319
    Article MATH Google Scholar
  10. Lao, L., Someren, H., Ashraf, I., Almudever, C.G.: Timing and resource-aware mapping of quantum circuits to superconducting processors. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 41(2), 359–371 (2021). https://doi.org/10.1109/TCAD.2021.3057583
    Article Google Scholar
  11. Li, G., Ding, Y., Xie, Y.: Tackling the qubit mapping problem for NISQ-era quantum devices. In: Proceedings of the 24th International Conference on Architectural Support for Programming Languages and Operating Systems. ASPLOS’19, pp. 1001–1014. ACM, New York (2019).https://doi.org/10.1145/3297858.3304023
  12. Li, S., Zhou, X., Feng, Y.: Qubit mapping based on subgraph isomorphism and filtered depth-limited search. IEEE Trans. Comput. 70(11), 1777–1788 (2021). https://doi.org/10.1109/TC.2020.3023247
    Article MathSciNet MATH Google Scholar
  13. Liu, L., Dou, X.: 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), Seoul, Korea (South), pp. 167–178 (2021). https://doi.org/10.1109/HPCA51647.2021.00024
  14. Molavi, A., Xu, A., Diges, M., Pick, L., Tannu, S.S., Albarghouthi, A.: Qubit mapping and routing via maxsat. In: 55th IEEE/ACM International Symposium on Microarchitecture, pp. 1078–1091. IEEE, Chicago, Illinois (2022). https://doi.org/10.1109/MICRO56248.2022.00077
  15. Murali, P., Mckay, D.C., Martonosi, M., Javadi-Abhari, A.: Software mitigation of crosstalk on noisy intermediate-scale quantum computers. In: Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems. ASPLOS’20, pp. 1001–1016. ACM, New York (2020). https://doi.org/10.1145/3373376.3378477
  16. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th edn. Cambridge University Press, Cambridge (2011)
    MATH Google Scholar
  17. Paler, A.: On the influence of initial qubit placement during nisq circuit compilation. In: Feld, S., Linnhoff-Popien, C. (eds.) Quantum Technology and Optimization Problems, pp. 207–217. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-14082-3_18
    Chapter MATH Google Scholar
  18. Siraichi, M.Y., Santos, V.F., Collange, C., Pereira, F.M.Q.: Qubit allocation. In: Proceedings of the 2018 International Symposium on Code Generation and Optimization. CGO 2018, pp. 113–125. ACM, New York (2018). https://doi.org/10.1145/3168822
  19. Venturelli, D., Do, M., Rieffel, E.G., Frank, J.: Temporal planning for compilation of quantum approximate optimization circuits. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, pp. 4440–4446 (2017). https://doi.org/10.24963/ijcai.2017/620
  20. Wille, R., Burgholzer, L., Zulehner, A.: 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. DAC’19, pp. 1–6. ACM, New York (2019). https://doi.org/10.1145/3316781.3317859
  21. Wille, R., Groe, D., Teuber, L., Dueck, G.W., Drechsler, R.: Revlib: An online resource for reversible functions and reversible circuits. In: Proceedings of the 38th International Symposium on Multiple Valued Logic. ISMVL’08, pp. 220–225. IEEE Computer Society, Dallas (2008). https://doi.org/10.1109/ISMVL.2008.43
  22. Zhang, C., Hayes, A.B., Qiu, L., Jin, Y., Chen, Y., Zhang, E.Z.: Time-optimal qubit mapping. In: Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems. ASPLOS’21, pp. 360–374. ACM, New York (2021). https://doi.org/10.1145/3445814.3446706
  23. Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Qin, J., Wu, D., Ding, X., Hu, Y., Hu, P., Yang, X.-Y., Zhang, W.-J., Li, H., Li, Y., Jiang, X., Gan, L., Yang, G., You, L., Wang, Z., Li, L., Liu, N.-L., Lu, C.-Y., Pan, J.-W.: Quantum computational advantage using photons. Science 370(6523), 1460–1463 (2020). https://doi.org/10.1126/science.abe8770
    Article Google Scholar
  24. Zhou, X., Li, S., Feng, Y.: Quantum circuit transformation based on simulated annealing and heuristic search. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(12), 4683–4694 (2020). https://doi.org/10.1109/TCAD.2020.2969647
    Article MATH Google Scholar
  25. Zhu, P., Guan, Z., Cheng, X.: A dynamic look-ahead heuristic for the qubit mapping problem of NISQ computers. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(12), 4721–4735 (2020). https://doi.org/10.1109/TCAD.2020.2970594
    Article MATH Google Scholar
  26. Zulehner, A., Paler, A., Wille, R.: An efficient methodology for mapping quantum circuits to the IBM QX architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 38(7), 1226–1236 (2019). https://doi.org/10.1109/TCAD.2018.2846658
    Article MATH Google Scholar

Download references