Sunghye Park
ABSTRACT
This paper presents an efficient qubit-mapping method that redesigns a quantum circuit to overcome the limitations of qubit connectivity. We propose a recursive graph-isomorphism search to generate the scalable initial mapping. In the main mapping, we use an adaptive look-ahead window search to resolve the connectivity constraint within a short runtime. Compared with the state-of-the-art method [15], our proposed method reduced the number of additional gates by 23% on average and the runtime by 68% for the three largest benchmark circuits. Furthermore, our method improved circuit stability by reducing the circuit depth and thus can be a step forward towards fault tolerance.
- Michael A Nielsen and Isaac Chuang. 2002. Quantum computation and quantum information. (2002).Google Scholar
- Peter W Shor. 1999. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM review, 41, 2, 303--332.Google Scholar
- Lov K Grover. 1996. A fast quantum mechanical algorithm for database search. In Proc. of STOC, 212--219.Google ScholarDigital Library
- Benjamin P Lanyon, James D Whitfield, Geoff G Gillett, Michael E Goggin, Marcelo P Almeida, Ivan Kassal, Jacob D Biamonte, Masoud Mohseni, Ben J Powell, Marco Barbieri, et al. 2010. Towards quantum chemistry on a quantum computer. Nature chemistry, 2, 2, 106--111.Google Scholar
- Carlos A Pérez-Delgado and Pieter Kok. 2011. Quantum computers: definition and implementations. Physical Review A, 83, 1, 012303.Google Scholar
- Chris Lomont. 2004. The hidden subgroup problem-review and open problems. arXiv preprint quant-ph/0411037.Google Scholar
- IBM. 2019. IBM Q Experience Device. https://www.reasearch.ibm.com/ibm-q/technology/experience/ [Online].Google Scholar
- Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando GSL Brandao, David A Buell, et al. 2019. Quantum supremacy using a programmable superconducting processor. Nature, 574, 7779, 505--510.Google Scholar
- IBM. 2019. Cramming more power into a quantum device. https://www.ibm.com/blogs/research/2019/03/power-quantum-device/ [Online].Google Scholar
- John Preskill. 2018. Quantum computing in the nisq era and beyond. Quantum, 2, 79.Google ScholarCross Ref
- Marcos Yukio Siraichi, Vinícius Fernandes dos Santos, Caroline Collange, and Fernando Magno Quintão Pereira. 2018. Qubit allocation. In Proc. CGO, 113--125.Google Scholar
- Robert Wille, Lukas Burgholzer, and Alwin Zulehner. 2019. Mapping quantum circuits to ibm qx architectures using the minimal number of swap and h operations. In Proc. DAC. IEEE, 1--6.Google ScholarDigital Library
- Toshinari Itoko, Rudy Raymond, Takashi Imamichi, and Atsushi Matsuo. 2020. Optimization of quantum circuit mapping using gate transformation and commutation. Integration, 70, 43--50.Google ScholarDigital Library
- Gushu Li, Yufei Ding, and Yuan Xie. 2019. Tackling the qubit mapping problem for nisq-era quantum devices. In Proc. ASPLOS, 1001--1014.Google ScholarDigital Library
- Pengcheng Zhu, Zhijin Guan, and Xueyun Cheng. 2020. A dynamic look-ahead heuristic for the qubit mapping problem of nisq computers. IEEE TCAD, 39, 12, 4721--4735.Google Scholar
- Alireza Shafaei, Mehdi Saeedi, and Massoud Pedram. 2014. Qubit placement to minimize communication overhead in 2d quantum architectures. In Proc. ASPDAC. IEEE, 495--500.Google ScholarCross Ref
- Siyuan Niu, Adrien Suau, Gabriel Staffelbach, and Aida Todri-Sanial. 2020. A hardware-aware heuristic for the qubit mapping problem in the nisq era. IEEE TQE, 1, 1--14.Google Scholar
- Chi Zhang, Yanhao Chen, Yuwei Jin, Wonsun Ahn, Youtao Zhang, and Eddy Z Zhang. 2020. A depth-aware swap insertion scheme for the qubit mapping problem. arXiv preprint arXiv:2002.07289.Google Scholar
- Alwin Zulehner, Alexandru Paler, and Robert Wille. 2018. An efficient methodology for mapping quantum circuits to the ibm qx architectures. IEEE TCAD, 38, 7, 1226--1236.Google Scholar
- James A McHugh. 1990. Algorithmic graph theory. Volume 68056. Citeseer.Google Scholar
- László Babai. 2016. Graph isomorphism in quasipolynomial time. In Proc. STOC, 684--697.Google Scholar
Recommendations
Time-optimal Qubit mapping
ASPLOS '21: Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating SystemsRapid progress in the physical implementation of quantum computers gave birth to multiple recent quantum machines implemented with superconducting technology. In these NISQ machines, each qubit is physically connected to a bounded number of neighbors. ...
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
ASPLOS '19: Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating SystemsA massive gap exists between current quantum computing (QC) prototypes, and the size and scale required for many proposed QC algorithms. Current QC implementations are prone to noise and variability which affect their reliability, and yet with less than ...
Comments