- Physical Review Journals
All JournalsPhysics Magazine

Physical Review Research

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Quantum circuit compilation with quantum computers

Davide Rattacaso1,2, Daniel Jaschke1,2,3, Marco Ballarin1,2, Ilaria Siloi1,2, and Simone Montangero1,2

PDF

Phys. Rev. Research 7, 033268 – Published 22 September, 2025

DOI: https://doi.org/10.1103/hcz4-nv2y

Abstract

Compilation optimizes quantum algorithms’ performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quantum algorithms to perform compilation via quantum computers, paving the way for a quantum advantage in compilation. We demonstrate the effectiveness of this approach via quantum and simulated annealing-based compilation: We successfully compile a Trotterized Hamiltonian simulation with up to 64 qubits and 64 time steps and a quantum Fourier transform with up to 40 qubits and 771 time steps. We show that, for a translationally invariant circuit, the compilation results in a fidelity gain that grows extensively in the size of the input circuit, outperforming any local or quasilocal compilation approach.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (85)

  1. F. T. Chong, D. Franklin, and M. Martonosi, Programming languages and compiler design for realistic quantum hardware, Nature (London) 549, 180 (2017).
  2. M. Maronese, L. Moro, L. Rocutto, and E. Prati, Quantum compiling, in Quantum Computing Environments, edited by S. S. Iyengar, M. Mastriani, and K. L. Kumar (Springer, Cham, Switzerland, 2022), pp. 39–74.
  3. L. Schmid, D. F. Locher, M. Rispler, S. Blatt, J. Zeiher, M. Müller, and R. Wille, Computational capabilities and compiler development for neutral atom quantum processors—Connecting tool developers and hardware experts, Quantum Sci. Technol. 9, 033001 (2024).
  4. A. Botea, A. Kishimoto, and R. Marinescu, On the complexity of quantum circuit compilation, in Proceedings of the Eleventh International Symposium on Combinatorial Search (SoCS 2018) (AAAI Press, Washington, DC, 2018), pp. 138–142.
  5. M. Saeedi, R. Wille, and R. Drechsler, Synthesis of quantum circuits for linear nearest neighbor architectures, Quantum Inf. Proc. 10, 355 (2010).
  6. Y. Nam, N. J. Ross, Y. Su, A. M. Childs, and D. Maslov, Automated optimization of large quantum circuits with continuous parameters, npj Quantum Inf. 4, 23 (2018).
  7. W. Finigan, M. Cubeddu, T. Lively, J. Flick, and P. Narang, Qubit allocation for noisy intermediate-scale quantum computers, arXiv:1810.08291.
  8. G. Li, Y. Ding, and Y. Xie, Tackling the qubit mapping problem for NISQ-era quantum devices, in Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS '19) (ACM, New York, 2019), pp. 1001–1014.
  9. R. Wille, L. Burgholzer, and A. Zulehner, Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H operations, in Proceedings of the 56th Annual Design Automation Conference 2019 (ACM, New York, 2019), pp. 1–6.
  10. Y. Shi, N. Leung, P. Gokhale, Z. Rossi, D. I. Schuster, H. Hoffmann, and F. T. Chong, Optimized compilation of aggregated instructions for realistic quantum computers, in Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems (ACM, New York, NY, 2019), pp. 1031–1044.
  11. S. Sivarajah, S. Dilkes, A. Cowtan, W. Simmons, A. Edgington, and R. Duncan, t|ket〉: A retargetable compiler for NISQ devices, Quantum Sci. Technol. 6, 014003 (2021).
  12. X. Zhou, S. Li, and Y. Feng, Quantum circuit transformation based on simulated annealing and heuristic search, IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 39, 4683 (2020).
  13. T. Fösel, M. Y. Niu, F. Marquardt, and L. Li, Quantum circuit optimization with deep reinforcement learning, arXiv:2103.07585.
  14. E. Peters, P. Shyamsundar, A. C. Y. Li, and G. Perdue, Qubit assignment using time reversal, PRX Quantum 3, 040333 (2022).
  15. C. Campbell, F. T. Chong, D. Dahl, P. Frederick, P. Goiporia, P. Gokhale, B. Hall, S. Issa, E. Jones, S. Lee, A. Litteken, V. Omole, D. Owusu-Antwi, M. A. Perlin, R. Rines, K. N. Smith, N. Goss, A. Hashim, R. Naik, and E. Younis et al., Superstaq: Deep optimization of quantum programs, in 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), Bellevue, WA (IEEE, Piscataway, NJ, 2023), pp. 1020–1032.
  16. E. Younis, K. Sen, K. Yelick, and C. Iancu, QFAST: Conflating search and numerical optimization for scalable quantum circuit synthesis, in 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), Broomfield, CO (IEEE, Piscataway, NJ, 2021), pp. 232–243.
  17. D. Kremer, V. Villar, H. Paik, I. Duran, I. Faro, and J. Cruz-Benito, Practical and efficient quantum circuit synthesis and transpiling with reinforcement learning, arXiv:2405.13196.
  18. C. McKeever and M. Lubasch, Classically optimized Hamiltonian simulation, Phys. Rev. Res. 5, 023146 (2023).
  19. Y. Kikuchi, C. McKeever, L. Coopmans, M. Lubasch, and M. Benedetti, Realization of quantum signal processing on a noisy quantum computer, npj Quantum Inf. 9, 93 (2023).
  20. C. McKeever and M. Lubasch, Towards adiabatic quantum computing using compressed quantum circuits, PRX Quantum 5, 020362 (2024).
  21. Y. Ding, P. Gokhale, S. F. Lin, R. Rines, T. Propson, and F. T. Chong, Systematic crosstalk mitigation for superconducting qubits via frequency-aware compilation, in 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO), Los Alamitos, CA (IEEE, Piscataway, NJ, 2020), pp. 201–214.
  22. P. Baßler, M. Zipper, C. Cedzich, M. Heinrich, P. H. Huber, M. Johanning, and M. Kliesch, Synthesis of and compilation with time-optimal multiqubit gates, Quantum 7, 984 (2023).
  23. D. Jaschke, A. Pagano, S. Weber, and S. Montangero, Ab initio tree-tensor-network digital twin for quantum computer benchmarking in 2D, Quantum Sci. Technol. 9, 035055 (2024).
  24. D. B. Tan, D. Bluvstein, M. D. Lukin, and J. Cong, Compiling quantum circuits for dynamically field-programmable neutral atoms array processors, Quantum 8, 1281 (2024).
  25. J. M. Baker, A. Litteken, C. Duckering, H. Hoffman, H. Bernien, and F. T. Chong, Exploiting long-distance interactions and tolerating atom loss in neutral atom quantum architectures, in Proceedings of the 48th Annual International Symposium on Computer Architecture (ISCA '21) (IEEE Press, Piscataway, NJ, 2021), pp. 818–831.
  26. V. A. Alfred, S. L. Monica, and D. U. Jeffrey, Compilers principles, Techniques and Tools (Pearson Education, Upper Saddle River, NJ, 2007).
  27. S. Ebadi et al., Quantum optimization of maximum independent set using Rydberg atom arrays, Science 376, 1209 (2022).
  28. T. Albash and D. A. Lidar, Demonstration of a scaling advantage for a quantum annealer over simulated annealing, Phys. Rev. X 8, 031016 (2018).
  29. M. Cain, S. Chattopadhyay, J.-G. Liu, R. Samajdar, H. Pichler, and M. D. Lukin, Quantum speedup for combinatorial optimization with flat energy landscapes, arXiv:2306.13123.
  30. T. Kadowaki and H. Nishimori, Quantum annealing in the transverse Ising model, Phys. Rev. E 58, 5355 (1998).
  31. E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem, Science 292, 472 (2001).
  32. G. E. Santoro, R. Martonak, E. Tosatti, and R. Car, Theory of quantum annealing of an Ising spin glass, Science 295, 2427 (2002).
  33. P. Hauke, H. G. Katzgraber, W. Lechner, H. Nishimori, and W. D. Oliver, Perspectives of quantum annealing: Methods and implementations, Rep. Prog. Phys. 83, 054401 (2020).
  34. T. Albash and D. A. Lidar, Adiabatic quantum computation, Rev. Mod. Phys. 90, 015002 (2018).
  35. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Quantum computation by adiabatic evolution, arXiv:quant-ph/0001106.
  36. J. Werschnik and E. K. U. Gross, Quantum optimal control theory, J. Phys. B: At. Mol. Opt. Phys. 40, R175 (2007).
  37. C. Brif, R. Chakrabarti, and H. Rabitz, Control of quantum phenomena: Past, present, and future, New J. Phys. 12, 075008 (2010).
  38. D. Dong and I. R. Petersen, Quantum control theory and applications: A survey, IET Control Theory Appl. 4, 2651 (2010).
  39. P. Doria, T. Calarco, and S. Montangero, Optimal control technique for many-body quantum dynamics, Phys. Rev. Lett. 106, 190501 (2011).
  40. T. Caneva, T. Calarco, and S. Montangero, Chopped random-basis quantum optimization, Phys. Rev. A 84, 022326 (2011).
  41. S. Lloyd and S. Montangero, Information theoretical analysis of quantum optimal control, Phys. Rev. Lett. 113, 010502 (2014).
  42. C. P. Koch, U. Boscain, T. Calarco, G. Dirr, S. Filipp, S. J. Glaser, R. Kosloff, S. Montangero, T. Schulte-Herbrüggen, D. Sugny, and F. K. Wilhelm, Quantum optimal control in quantum technologies. Strategic report on current status, visions and goals for research in Europe, EPJ Quantum Technol. 9, 19 (2022).
  43. E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm, arXiv:1411.4028.
  44. Z. Wang, S. Hadfield, Z. Jiang, and E. G. Rieffel, Quantum approximate optimization algorithm for MaxCut: A fermionic view, Phys. Rev. A 97, 022304 (2018).
  45. E. Farhi and A. W. Harrow, Quantum supremacy through the quantum approximate optimization algorithm, arXiv:1602.07674.
  46. L. Zhou, S.-T. Wang, S. Choi, H. Pichler, and M. D. Lukin, Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices, Phys. Rev. X 10, 021067 (2020).
  47. K. Blekos, D. Brand, A. Ceschini, C.-H. Chou, R.-H. Li, K. Pandya, and A. Summer, A review on quantum approximate optimization algorithm and its variants, Phys. Rep. 1068, 1 (2024).
  48. J. Haegeman, C. Lubich, I. Oseledets, B. Vandereycken, and F. Verstraete, Unifying time evolution and optimization with matrix product states, Phys. Rev. B 94, 165116 (2016).
  49. U. Schollwöck, The density-matrix renormalization group, Rev. Mod. Phys. 77, 259 (2005).
  50. U. Schollwöck, The density-matrix renormalization group in the age of matrix product states, Ann. Phys. 326, 96 (2011).
  51. R. Orús, A practical introduction to tensor networks: Matrix product states and projected entangled pair states, Ann. Phys. 349, 117 (2014).
  52. M. C. Bañuls, Tensor network algorithms: A route map, Annu. Rev. Condens. Matter Phys. 14, 173 (2023).
  53. S. Montangero, Introduction to Tensor Network Methods (Springer, Cham, Switzerland, 2018).
  54. P. Silvi, F. Tschirsich, M. Gerster, J. Jünemann, D. Jaschke, M. Rizzi, and S. Montangero, The tensor networks anthology: Simulation techniques for many-body quantum lattice systems, SciPost Phys. Lect. Notes 8, 1 (2019).
  55. D. Rattacaso, D. Jaschke, M. Ballarin, I. Siloi, and S. Montangero, Quantum algorithms for equational reasoning, arXiv:2508.21122.
  56. A. Clément, N. Heurtel, S. Mansfield, S. Perdrix, and B. Valiron, A complete equational theory for quantum circuits, in 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (ACM, New York, 2023), pp. 1–13.
  57. A. Clément, N. Delorme, and S. Perdrix, Minimal equational theories for quantum circuits, in Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS ’24) (ACM, New York, 2024), pp. 271–2714.
  58. S. Lloyd, Universal quantum simulators, Science 273, 1073 (1996).
  59. D. Aharonov and A. Ta-Shma, Adiabatic quantum state generation and statistical zero knowledge, in Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC’03 (Association for Computing Machinery, New York, 2003), pp. 20–29.
  60. F. Baccari, D. Bacilieri, M. Ballarin, F. P. Barone, F. Campaioli, A. G. Catalano, G. Cataldi, A. Coppi, A. Costantini, A. Datta, A. De Girolamo, D. Jaschke, S. B. Kožić, G. Magnifico, C. Mordini, S. Montangero, S. Notarnicola, A. Pagano, L. Pavesic, D. Rattacaso, M. Rigobello, N. Reini, S. Scarlatella, I. Siloi, P. Silvi, M. Tesoro, G. Torre, and D. Wanisch, “Quantum TEA: qtealeaves (2025)”, Zenodo, https://doi.org/10.5281/zenodo.10498928.
  61. M. Ballarin, Quantum computer simulation via tensor networks, Master’s thesis, Università degli Studi di Padova, 2021.
  62. M. Ballarin, P. Silvi, S. Montangero, and D. Jaschke, Optimal sampling of tensor networks targeting wave function’s fast decaying tails, Quantum 9, 1714 (2025).
  63. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by simulated annealing, Science 220, 671 (1983).
  64. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, 2011).
  65. M. Ballarin, F. P. Barone, A. Coppi, D. Jaschke, S. Montangero, G. Muñoz Menés, D. Rattacaso, and N. Reini, “Quantum TEA: qmatchatea (2025)”, Zenodo, https://doi.org/10.5281/zenodo.11619265.
  66. Y. Zhou, E. M. Stoudenmire, and X. Waintal, What limits the simulation of quantum computers? Phys. Rev. X 10, 041038 (2020).
  67. E. Farhi, J. Goldstone, and S. Gutmann, Quantum adiabatic evolution algorithms versus simulated annealing, arXiv:quant-ph/0201031.
  68. T. Caneva, T. Calarco, R. Fazio, G. E. Santoro, and S. Montangero, Speeding up critical system dynamics through optimized evolution, Phys. Rev. A 84, 012312 (2011).
  69. J. J. Wallman and J. Emerson, Noise tailoring for scalable quantum computation via randomized compiling, Phys. Rev. A 94, 052325 (2016).
  70. M. Mariantoni, H. Wang, T. Yamamoto, M. Neeley, R. C. Bialczak, Y. Chen, M. Lenander, E. Lucero, A. D. O’Connell, D. Sank, M. Weides, J. Wenner, Y. Yin, J. Zhao, A. N. Korotkov, A. N. Cleland, and J. M. Martinis, Implementing the quantum von Neumann architecture with superconducting circuits, Science 334, 61 (2011).
  71. V. Giovannetti, S. Lloyd, and L. Maccone, Quantum random access memory, Phys. Rev. Lett. 100, 160501 (2008).
  72. M. Bukov, A. G. R. Day, P. Weinberg, A. Polkovnikov, P. Mehta, and D. Sels, Broken symmetry in a two-qubit quantum control landscape, Phys. Rev. A 97, 052114 (2018).
  73. M. Larocca, P. M. Poggi, and D. A. Wisniacki, Quantum control landscape for a two-level system near the quantum speed limit, J. Phys. A: Math. Theor. 51, 385305 (2018).
  74. M. Bukov, A. G. R. Day, D. Sels, P. Weinberg, A. Polkovnikov, and P. Mehta, Reinforcement learning in different phases of quantum control, Phys. Rev. X 8, 031086 (2018).
  75. A. G. R. Day, M. Bukov, P. Weinberg, P. Mehta, and D. Sels, Glassy phase of optimal quantum control, Phys. Rev. Lett. 122, 020601 (2019).
  76. D. Rattacaso, M. Ballarin, D. Jaschke, I. Siloi, and S. Montangero, “VulQano: Quantum-inspired compiler for quantum circuits (2024)”, Zenodo, https://doi.org/10.5281/zenodo.12571338.
  77. D. Rattacaso, M. Ballarin, D. Jaschke, I. Siloi, and S. Montangero, Datasets, figures, and simulation scripts for “Quantum circuit compilation with quantum computers” (v1.0.0) [Data set], Zenodo, https://doi.org/10.5281/zenodo.12759815.
  78. A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, Elementary gates for quantum computation, Phys. Rev. A 52, 3457 (1995).
  79. M. Khazali and K. Mølmer, Fast multiqubit gates by adiabatic evolution in interacting excited-state manifolds of Rydberg atoms and superconducting circuits, Phys. Rev. X 10, 021054 (2020).
  80. G. Lami, P. Torta, G. E. Santoro, and M. Collura, Quantum annealing for neural network optimization problems: A new approach via tensor network simulations, SciPost Phys. 14, 117 (2023).
  81. A. J. Daley, Quantum trajectories and open many-body quantum systems, Adv. Phys. 63, 77 (2014).
  82. J. Chen, E. M. Stoudenmire, and S. R. White, Quantum Fourier transform has small entanglement, PRX Quantum 4, 040318 (2023).
  83. D. Jaschke and S. Montangero, Is quantum computing green? An estimate for an energy-efficiency quantum advantage, Quantum Sci. Technol. 8, 025001 (2023).
  84. S. Heußen, D. F. Locher, and M. Müller, Measurement-free fault-tolerant quantum error correction in near-term devices, PRX Quantum 5, 010333 (2024).
  85. S. Veroni, M. Müller, and G. Giudice, Optimized measurement-free and fault-tolerant quantum error correction for neutral atoms, Phys. Rev. Res. 6, 043253 (2024).

Outline

Information

Phys. Rev. Research 7, 033268– Published 22 September, 2025
  • Received 1 October 2024
  • Accepted 20 August 2025
Crossmark - Check for updates button
Creative Commons Logo

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation