Chinese Journal of Quantum Electronics, Volume. 41, Issue 4, 626(2024)
Research on quantum circuit mapping based on dynamic look‑ahead depth
[1] Shor P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J]. SIAM Journal on Computing, 26, 1484-1509(1997).
[2] Grover L K. A fast quantum mechanical algorithm for database search[C], 212-219(1996).
[3] Peruzzo A, McClean J, Shadbolt P et al. A variational eigenvalue solver on a photonic quantum processor[J]. Nature Communications, 5, 4213(2014).
[4] Tannu S S, Qureshi M K. Not all qubits are created equal: A case for variability-aware policies for NISQ-era quantum computers[C], 987-999(2019).
[5] Cao Y D, Romero J, Olson J P et al. Quantum chemistry in the age of quantum computing[J]. Chemical Reviews, 119, 10856-10915(2019).
[6] Niu S Y, 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, 1, 3101614(2020).
[7] Rahman M M, Dueck G W, Chattopadhyay A et al. Integrated synthesis of linear nearest neighbor ancilla-free MCT circuits[C], 144-149(2016).
[8] Saki A A, Alam M, Ghosh S. QURE: qubit re-allocation in noisy intermediate-scale quantum computers[C], 1-6(2019).
[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, 38, 1226-1236(2019).
[10] Guerreschi G G, Park J. Two-step approach to scheduling quantum circuits[J]. Quantum Science and Technology, 3, 045003(2018).
[11] Liu L, Dou X L. QuCloud: A new qubit mapping mechanism for multi-programming quantum computing in cloud environment[C], 167-178(2021).
[12] Siraichi M Y, dos Santos V F, Collange C et al. Qubit allocation[C], 113-125(2018).
[13] Miller D M, Soeken M, Drechsler R. Mapping NCV circuits to optimized Clifford+T circuits[C], 163-175(2014).
[14] Li G S, Ding Y F, Xie Y. Tackling the qubit mapping problem for NISQ-era quantum devices[C], 1001-1014(2019).
[15] Floyd R W. Algorithm 97: Shortest path[J]. Communications of the ACM, 5, 345(1962).
[16] Zhu P C, Guan Z J, Cheng X Y. 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, 39, 4721-4735(2020).
Get Citation
Copy Citation Text
Kexin CAO, Xinyu CHEN, Mingqiang ZHU, Xiang LI, Xueyun CHENG, Zhijin GUAN. Research on quantum circuit mapping based on dynamic look‑ahead depth[J]. Chinese Journal of Quantum Electronics, 2024, 41(4): 626
Category:
Received: Jul. 11, 2022
Accepted: --
Published Online: Jan. 8, 2025
The Author Email: