| [1] Shor, P.W., Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM review, 1999. 41(2): p. 303-332.[2] Cao, Y., et al., Quantum chemistry in the age of quantum computing. Chemical reviews, 2019. 119(19): p. 10856-10915.[3] Huang, H., K. Bharti and P. Rebentrost, Near-term quantum algorithms for linear systems of equations. arXiv preprint arXiv:1909.07344, 2019.[4] Leibfried D, Blatt R, Monroe C. Quantum dynamics of single trapped ions[J]. Rev Mod Phys, 2003, 75: 281- 324[5] Krantz P. Kjaergaard M, Yan F. A quantum engineer’s guide to superconducting qubits[J]. Appl Phys Rev, 2019, 6: 021318[6] Qubit architecture with high coherence and fast tunable coupling[J]. Physical Review Letters, 2014, 113(22):220502.[7] Rodney Van Meter. Quantum networking. John Wiley & Sons, 2014.[8] De Almeida, A.A., G.W. Dueck and A.C. Da Silva. Finding optimal qubit permutations for IBM's quantum computer architectures. in Proceedings of the 32nd Symposium on Integrated Circuits and Systems Design. 2019.[9] Murali, P., et al. Full-stack, real-system quantum computer studies: Architectural comparisons and design insights. in 2019 ACM/IEEE 46th Annual International Symposium on Computer Architecture (ISCA). 2019: IEEE.[10] SHEN Mingyan, CHENG Xueyun, GUAN Zhijin,et al. A Realization Method of Two-Dimensional Nearest Neighbor for Quantum Circuit[J].Chinese Journal of Quantum Electronics, 2019, 36(4). 476-482沈鸣燕, 程学云, 管致锦,等. 一种量子线路二维近邻实现方法[J]. 量子电子学报, 2019, 36(4). 476-482[11] WANG Yizhen, GUAN Zhijin, GUAN Haiyu Linear nearest neighbor synthesis algorithm of quantum circuits based on pre-evaluation[J].Chinese Journal of Quantum Electronics 2021, 38(1): 75-85.王艺臻, 管致锦, 管海宇. 基于预评价的量子电路线性最近邻综合算法[J]. 量子电子学报, 2021, 38(1): 75-85[12] 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.[13] 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.[14] Guerreschi, G.G. and J. Park, Two-step approach to scheduling quantum circuits. Quantum Science and Technology, 2018. 3(4): p. 045003.[15] Tannu S S，Qureshi M K. Not all qubits are created equal: a case for variability-aware policies for NISQ-era quantum computers[C]//Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems. New York:ACM.2019: 987-999.[16] Andrew W Cross, Lev S Bishop, John A Smolin, and Jay M Gambetta. Open quantum assembly language. arXiv preprint arXiv:1707.03429, 2017.[17] Nishio S，Pan Y，Satoh T，et al. Extracting success from ibm’s 20-qubit machines using error-aware compilation[J]. ACM Journal on Emerging Technologies in Computing Systems ，2020，16(3): 1-25.[18] https://github.com/iic-jku/ibm_qx_mapping/tree/master/examples[19] https://quantum-computing.ibm.com/ |
