Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
132 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits (2210.01306v5)

Published 4 Oct 2022 in quant-ph, cs.AR, and cs.ET

Abstract: Qubit Mapping is a critical aspect of implementing quantum circuits on real hardware devices. Currently, the existing algorithms for qubit mapping encounter difficulties when dealing with larger circuit sizes involving hundreds of qubits. In this paper, we introduce an innovative qubit mapping algorithm, Duostra, tailored to address the challenge of implementing large-scale quantum circuits on real hardware devices with limited connectivity. Duostra operates by efficiently determining optimal paths for double-qubit gates and inserting SWAP gates accordingly to implement the double-qubit operations on real devices. Together with two heuristic scheduling algorithms, the Limitedly-Exhausitive (LE) Search and the Shortest-Path (SP) Estimation, it yields results of good quality within a reasonable runtime, thereby striving toward achieving quantum advantage. Experimental results showcase our algorithm's superiority, especially for large circuits beyond the NISQ era. For example, on large circuits with more than 50 qubits, we can reduce the mapping cost on an average 21.75% over the virtual best results among QMAP, t|ket>, Qiskit and SABRE. Besides, for mid-size circuits such as the SABRE-large benchmark, we improve the mapping costs by 4.5%, 5.2%, 16.3%, 20.7%, and 25.7%, when compared to QMAP, TOQM, t|ket>, Qiskit, and SABRE, respectively.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (70)
  1. Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, 2010.
  2. Principles of quantum communication theory: A modern approach. arXiv preprint arXiv:2011.04672, 2020.
  3. Quantum cryptography and its applications over the internet. IEEE Network, 29(5):64–69, September 2015.
  4. Guest column: A survey of quantum learning theory. SIGACT News, 48(2):41–67, June 2017.
  5. Peter W. Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proc. Annual Symposium on Foundations of Computer Science, pages 124–134, 1994.
  6. Peter W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484–1509, 1997.
  7. Shor’s discrete logarithm quantum algorithm for elliptic curves. Quantum Information & Computation, 3(4):317–344, July 2003.
  8. IBM. IBM quantum, 2021.
  9. Qubit allocation. In Proc. International Symposium on Code Generation and Optimization, pages 113–125, 2018.
  10. Quantum circuit placement. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 27(4):752–763, 2008.
  11. Synthesis of quantum circuits for linear nearest neighbor architectures. Quantum Information Processing, 10(3):355–377, 2011.
  12. Linear nearest neighbor synthesis of reversible circuits by graph partitioning. arXiv preprint arXiv:1112.0564, 2011.
  13. Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures. In Proc. ACM/IEEE Design Automation Conference (DAC), pages 1–6, 2013.
  14. Qubit placement to minimize communication overhead in 2D quantum architectures. In Proc. IEEE Asia and South Pacific Design Automation Conference (ASP-DAC), pages 495–500, 2014.
  15. Optimal SWAP gate insertion for nearest neighbor quantum circuits. In Proc. IEEE Asia and South Pacific Design Automation Conference (ASP-DAC), pages 489–494, 2014.
  16. Exact reordering of circuit lines for nearest neighbor quantum architectures. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 33(12):1818–1831, December 2014.
  17. Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits. In Proc. IEEE Asia and South Pacific Design Automation Conference, pages 178–183, 2015.
  18. Layout optimization for quantum circuits with linear nearest neighbor architectures. IEEE Circuits Syst. Mag., 16(2):62–74, 2016.
  19. 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), pages 292–297, January 2016.
  20. Comparing and integrating constraint programming and temporal planning for quantum circuit compilation. In Proc. International Conference on Automated Planning and Scheduling, volume 28, pages 366–374, 2018.
  21. CNOT gate mappings to Clifford+T circuits in IBM architectures. In 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL), pages 7–12, May 2019.
  22. Compiling quantum circuits to realistic hardware architectures using temporal planners. Quantum Science and Technology, 3(2):025004, April 2018.
  23. An efficient methodology for mapping quantum circuits to the IBM QX architectures. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 38(7):1226–1236, 2018.
  24. Compiling SU(4) quantum circuits to IBM QX architectures. In Proceedings of the 24th Asia and South Pacific Design Automation Conference, pages 185–190, January 2019.
  25. Reducing the overhead of mapping quantum circuits to IBM Q system. In 2019 IEEE International Symposium on Circuits and Systems (ISCAS), pages 1–5, May 2019.
  26. On optimal subarchitectures for quantum circuit mapping. ACM Transactions on Quantum Computing, 4(4):1–20, 2023.
  27. MQT QMAP: efficient quantum circuit mapping. In Proceedings of the 2023 International Symposium on Physical Design, pages 198–204, 2023.
  28. Tackling the qubit mapping problem for NISQ-era quantum devices. In Proc. International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 1001–1014, 2019.
  29. A dynamic look-ahead heuristic for the qubit mapping problem of NISQ computers. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 39(12):4721–4735, December 2020.
  30. Quantum circuit transformation based on Tabu search. arXiv preprint arXiv:2011.04672, August 2021.
  31. Two-step approach to scheduling quantum circuits. Quantum Science and Technology, 3(4):045003, 2018.
  32. 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, pages 1–6, 2019.
  33. Optimal layout synthesis for quantum computing. In Proceedings of the 39th International Conference on Computer-Aided Design (ICCAD), pages 1–9, 2020.
  34. Optimal qubit mapping with simultaneous gate absorption. In 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD), pages 1–8, November 2021.
  35. Scalable optimal layout synthesis for nisq quantum processors. In 2023 60th ACM/IEEE Design Automation Conference (DAC), pages 1–6, 2023.
  36. Qubit mapping and routing via MaxSAT. In 2022 55th IEEE/ACM International Symposium on Microarchitecture (MICRO), pages 1078–1091, October 2022.
  37. Codar: A contextual duration-aware qubit mapping for various NISQ devices. In Proc. ACM/IEEE Design Automation Conference (DAC), pages 1–6, 2020.
  38. Time-optimal qubit mapping. In Proc. ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 360–374, 2021.
  39. Timing and resource-aware mapping of quantum circuits to superconducting processors. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 41(2):359–371, February 2022.
  40. Franc Brglez. A neutral netlist of 10 combinational benchmark circuits and a target translator in Fortran. In Proc. International Symposium on Circuits and Systems, 1985, 1985.
  41. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1(1):269–271, December 1959.
  42. Robert W Floyd. Algorithm 97: shortest path. Communications of the ACM, 5(6):345, 1962.
  43. t|ket⟩: a retargetable compiler for NISQ devices. Quantum Science and Technology, 6(1):014003, January 2021.
  44. Qiskit: An open-source framework for quantum computing. Accessed on: Mar, 16, 2019.
  45. Topological and subsystem codes on low-degree graphs with flag qubits. Physical Review X, 10(1):011022, 2020.
  46. IBM. The IBM Quantum heavy hex lattice, 2021.
  47. Efficient decomposition methods for controlled-R n using a single ancillary qubit. Scientific reports, 8(1):5445, 2018.
  48. RevLib: An online resource for reversible functions and reversible circuits. In 38th International Symposium on Multiple Valued Logic (ismvl 2008), pages 220–225, 2008.
  49. Aleks Kissinger and John van de Wetering. PyZX: Large scale automated diagrammatic reasoning. In Bob Coecke and Matthew Leifer, editors, Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019, volume 318 of Electronic Proceedings in Theoretical Computer Science, pages 229–241, 2020.
  50. VeriQBench: A benchmark for multiple types of quantum Circuits. arXiv preprint arXiv:2206.10880, 2022.
  51. VERIFICATION GROUP and others. ABC: a system for sequential synthesis and verification, release 70930, 2007.
  52. Qasmbench: A low-level quantum benchmark suite for nisq evaluation and simulation. ACM Transactions on Quantum Computing, 2022.
  53. A case for multi-programming quantum computers. In Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture, pages 291–303, October 2019.
  54. Not all qubits are created equal: a case for variability-aware policies for NISQ-era quantum computers. In Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 987–999, April 2019.
  55. Noise-adaptive compiler mappings for noisy intermediate-scale quantum computers. In Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 1015–1029, April 2019.
  56. Qubits’ mapping and routing for NISQ on variability of quantum gates. Quantum Information Processing, 19(10):378, October 2020.
  57. A hardware-aware heuristic for the qubit mapping problem in the NISQ era. IEEE Transactions on Quantum Engineering, 1:1–14, 2020.
  58. ADAPT: Mitigating idling errors in qubits via adaptive dynamical decoupling. In MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture, pages 950–962, October 2021.
  59. JigSaw: Boosting fidelity of NISQ programs via measurement subsetting. In MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture, pages 937–949, October 2021.
  60. Demonstration of quantum volume 64 on a superconducting quantum computing system. Quantum Science and Technology, 6(2):025020, April 2021.
  61. Suppression of qubit crosstalk in a tunable coupling superconducting circuit. Phys. Rev. Applied, 12(5):054023, November 2019.
  62. 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, pages 1001–1016, March 2020.
  63. Systematic crosstalk mitigation for superconducting qubits via frequency-aware compilation. In 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO), pages 201–214, October 2020.
  64. Simultaneous execution of quantum circuits on current and near-future NISQ systems. IEEE Transactions on Quantum Engineering, 3:1–10, 2022.
  65. Exploiting quantum teleportation in quantum circuit mapping. In Proceedings of the 26th Asia and South Pacific Design Automation Conference, pages 792–797, January 2021.
  66. Using reinforcement learning to perform qubit routing in quantum compilers. ACM Transactions on Quantum Computing, 3(2):1–25, June 2022.
  67. Circuit transformations for quantum architectures. In Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC), 2019.
  68. Quantum circuit compilers using gate commutation rules. In Proceedings of the 24th Asia and South Pacific Design Automation Conference, pages 191–196, January 2019.
  69. Optimization of quantum circuit mapping using gate transformation and commutation. Integration, 70:43–50, January 2020.
  70. 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), pages 709–725, April 2022.
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now