A Systematic Literature Review on Optimization Techniques for Quantum Computing Compilers

• Camilla Vitoria Bueno da Rocha PUC Minas
• Ana Luiza Diniz Santos PUC Minas
• Matheus Alcântara Souza PUC Minas

DOI: https://doi.org/10.5753/wscad_estendido.2023.235804

Resumo

The rapid development of Quantum Computing (QC) as a promising computing paradigm has garnered significant attention for its ability to harness quantum mechanical properties for computation. With classical computing facing limitations outlined by Moore’s Law, QC emerges as a potential alternative for tackling complex computational problems. Yet, to unlock its full potential, robust and optimized compilers are pivotal, especially in addressing challenges posed by circuits with numerous qubits. In this systematic literature review, we analyze 18 articles to identify proposed optimizations for quantum compilers, exploring their applications, performance impacts, and emerging trends. Our primary goal is to offer valuable insights into the recent advancements and challenges in QC compiler optimizations. This will be achieved through the clustering of optimization groups, ultimately facilitating further progress in the development of highly optimized quantum algorithms and circuits.

Referências

Alam, M., Saki, A. A., and Ghosh, S. (2020). An efficient circuit compilation flow for quantum approximate optimization algorithm. In Design Aut. Conf., pages 1–6.

Botea, A., Kishimoto, A., and Marinescu, R. (2018). On the complexity of quantum circuit compilation. In Symp. on Combinatorial Search.

Chauhan, V. et al. (2022). Quantum computers: A review on how quantum computing can boom AI. In Int. Conf. on Adv. Comp. and Innov. Tech. in Eng., pages 559–563.

Cuomo, D. et al. (2023). Optimized compiler for distributed quantum computing. ACM Transactions on Quantum Computing, 4(2).

Ferrari, D. and Amoretti, M. (2022). Noise-adaptive quantum compilation strategies evaluated with application-motivated benchmarks. In Int. Conf. on Comp. Frontiers, page 237–243, New York. ACM.

Gokhale, P. et al. (2020). Optimized quantum compilation for near-term algorithms with openpulse. In Int. Symp. on Microarchitecture, volume 2020-October, pages 186–200.

Itoko, T. and Imamichi, T. (2020). Scheduling of operations in quantum compiler. In Int. Conf. on Quantum Comp. and Eng., pages 337–344, Los Alamitos.

Knill, E. et al. (2008). Randomized benchmarking of quantum gates. Phys. Rev. A, 77:12307.

Lella, E. et al. (2022). Cryptography in the quantum era. In Workshop on Low Temperature Electronics, pages 1–4.

Li, G., Ding, Y., and Xie, Y. (2019). Tackling the qubit mapping problem for nisqera quantum devices. In Int. Conf. on Arch. Support for Prog. Lang. and Operating Systems, pages 1001–1014. ACM.

Li, G. et al. (2022). Paulihedral: A generalized block-wise compiler optimization framework for quantum simulation kernels. In Int. Conf. on Arch. Support for Prog. Lang. and Operating Systems, page 554–569, New York, NY, USA. ACM.

Liu, J., Bello, L., and Zhou, H. (2021). Relaxed peephole optimization: A novel compiler optimization for quantum circuits. In Int. Symp. on Code Generation and Optimization, page 301–314. IEEE Press.

Liu, J., Li, P., and Zhou, H. (2022). Not all swaps have the same cost: A case for optimization-aware qubit routing. In Int. Symp. on High-Performance Comp. Arch., pages 709–725, Los Alamitos. IEEE Comp. Soc.

McCaskey, A. and Nguyen, T. (2021). A mlir dialect for quantum assembly languages. In Int. Conf. on Quantum Comp. and Eng., pages 255–264, Los Alamitos. IEEE Comp. Soc.

Murali, P. et al. (2019). Noise-adaptive compiler mappings for noisy intermediate-scale quantum computers. In Int. Conf. on Arch. Support for Prog. Lang. and Operating Systems, page 1015–1029, New York. ACM.

Nguyen, T. and McCaskey, A. (2022). Retargetable optimizing compilers for quantum accelerators via a multilevel intermediate representation. IEEE Micro, 42(05):17–33.

Nishio, S. et al. (2020). Extracting success from ibm’s 20-qubit machines using error-aware compilation. J. Emerg. Technol. Comput. Syst., 16(3).

Pozzi, M. G. et al. (2022). Using reinforcement learning to perform qubit routing in quantum compilers. ACM Transactions on Quantum Computing, 3(2).

Preskill, J. (2018). Quantum Computing in the NISQ era and beyond. Quantum, 2:79.

Qiskit (2023). Qiskit: An open-source framework for quantum computing. Available in: https://doi.org.10.5281/zenodo.2573505.

Shi, Y. et al. (2019). Optimized compilation of aggregated instructions for realistic quantum computers. In Int. Conf. on Arch. Support for Prog. Languages and Operating Systems, page 1031–1044, New York. ACM.

Siraichi, M. Y. et al. (2018). Qubit allocation. In Int. Symp. on Code Generation and Optimization, page 113–125, New York, NY, USA. ACM.

Sivarajah, S. et al. (2020). Tket: a retargetable compiler for NISQ devices. Quantum Science and Technology, 6(1):014003.

Tannu, S. S. and Qureshi, M. K. (2019). Not all qubits are created equal: A case for variability-aware policies for nisq-era quantum computers. In Int. Conf. on Arch. Support for Prog. Lang. and Operating Systems, page 987–999, New York. ACM.

Williams, R. S. (2017). What’s next? the end of moore’s law. Comp. in Science & Eng., 19(2):7–13.

Zhang, H. et al. (2023). Oneq: A compilation framework for photonic one-way quantum computation. In Int. Symp. on Comp. Arch., New York, NY, USA. ACM.

Zulehner, A. and Wille, R. (2019). Compiling su(4) quantum circuits to ibm qx architectures. In Asia and South Pacific Des. Autom. Conf., page 185–190, New York. ACM.