[1] Shor?P?W.?Polynomialtime?algorithms?for?prime?factorization?and?discrete?logarithms?on?a?quantum?computer[J].?SIAM?review,?1999,?41(2):?303-332.[2] Grover L K. A fast quantum mechanical algorithm for database search[C]//Proceedings of the twenty-eighth annual ACM symposium on Theory of computing. 1996: 212-219. [3] Peruzzo A, McClean J, Shadbolt P, et al. A variational eigenvalue solver on a photonic quantum processor[J]. Nature communications, 2014, 5(1): 1-7.[4] https://quantum-computing.ibm.com/services 2022.4.20https://www.cnet.com/pictures/take-a-look-at-googles-quantum-computing-technology 2022.4.20https://www.intel.com/content/www/us/en/research/quantum-computing.html 2022.4.22https://www.originqc.com.cn 2022.4.22[5] Cao Y, Romero J, Olson J P, et al. Quantum chemistry in the age of quantum computing[J]. Chemical reviews, 2019, 119(19): 10856-10915.[6] Niu S, Suau A, Staffelbach G, et al. A hardware-aware heuristic for the qubit mapping problem in the nisq era[J]. IEEE Transactions on Quantum Engineering, 2020, 1: 1-14.[7] Rahman M M, Dueck G W, Chattopadhyay A, et al. Integrated Synthesis of Linear Nearest Neighbor Ancilla-Free MCT Circuits[C]// ISMVL 2016 IEEE International Symposium on Multiple-Valued Logic. IEEE, 2016:144-149.[8] Ash-Saki A, Alam M, Ghosh S. QURE: Qubit re-allocation in noisy intermediate-scale quantum computers[C]//Proceedings of the 56th Annual Design Automation Conference 2019. 2019: 1-6.[9] Zulehner A, Paler A, Wille R. An efficient methodology for mapping quantum circuits to the IBM QX architectures[J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2018, 38(7): 1226-1236. [10] Guerreschi G G, Park J. Two-step approach to scheduling quantum circuits[J]. Quantum Science and Technology, 2018, 3(4): 045003.[11] Siraichi M Y, Santos V F, Collange C, et al. Qubit allocation[C]//Proceedings of the 2018 International Symposium on Code Generation and Optimization. 2018: 113-125.[12] Miller?D?M,?Soeken?M,?Drechsler?R.?Mapping?NCV?circuits?to?optimized?Clifford+T?circuits[C]//International?Conference?on?Reversible?Computation.?Springer,?Cham,?2014:?163-175.[13] Li G, Ding Y, Xie Y. Tackling the qubit mapping problem for NISQ-era quantum devices[C]//Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems. 2019: 1001-1014.[14] Floyd R W. Algorithm 97: shortest path[J]. Communications of the ACM, 1962, 5(6): 345.[15] Zhu P, Guan Z, Cheng X. A dynamic look-ahead heuristic for the qubit mapping problem of nisq computers[J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2020, 39(12): 4721-4735. |