- Open Access
Fast-forwardability of qubit-mapped fermion models based on Cartan decomposition
Phys. Rev. Research 8, 033251 – Published 1 September, 2026
DOI: https://doi.org/10.1103/zzry-8h81
Abstract
We study the Hamiltonian algebra of qubit-mapped interacting fermion models and their fast-forwardability. We prove that the dimension of the Hamiltonian algebra of the fermion model with single-site Coulomb interaction is bounded from below by the exponential function of the number of sites, and the circuit depth of the Cartan-based fast-forwarding method for such a model also exhibits the same scaling. We apply this proposition to the Anderson impurity model and the Hubbard model and show that the dimension of the Hamiltonian algebra of these models scales exponentially with the number of sites. These behaviors of the Hamiltonian algebras imply that, under fermion-qubit mappings that map Majorana operators to single-term Pauli strings, the qubit models obtained from these fermion models cannot be efficiently simulated using the Cartan-based fast-forwarding method.
Physics Subject Headings (PhySH)
Article Text
References (53)
- A. Aspuru-Guzik, A. D. Dutoi, P. J. Love, and M. Head-Gordon, Simulated quantum computation of molecular energies, Science 309, 1704 (2005).
- Y. Cao, J. Romero, J. P. Olson, M. Degroote, P. D. Johnson, M. Kieferová, I. D. Kivlichan, T. Menke, B. Peropadre, N. P. D. Sawaya, S. Sim, L. Veis, and A. Aspuru-Guzik, Quantum chemistry in the age of quantum computing, Chem. Rev. 119, 10856 (2019).
- B. Bauer, S. Bravyi, M. Motta, and G. K.-L. Chan, Quantum algorithms for quantum chemistry and quantum materials science, Chem. Rev. 120, 12685 (2020).
- S. McArdle, S. Endo, A. Aspuru-Guzik, S. C. Benjamin, and X. Yuan, Quantum computational chemistry, Rev. Mod. Phys. 92, 015003 (2020).
- M. Motta and J. E. Rice, Emerging quantum computing algorithms for quantum chemistry, WIREs Comput. Mol. Sci. 12, e1580 (2022).
- D. Herman, C. Googin, X. Liu, A. Galda, I. Safro, Y. Sun, M. Pistoia, and Y. Alexeev, A survey of quantum computing for finance, arXiv:2201.02773.
- A. Bouland, W. van Dam, H. Joorati, I. Kerenidis, and A. Prakash, Prospects and challenges of quantum finance, arXiv:2011.06492.
- R. P. Feynman, Simulating physics with computers, Int. J. Theor. Phys. 21, 467 (1982).
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2010).
- H. F. Trotter, On the product of semi-groups of operators, Proc. Am. Math. Soc. 10, 545 (1959).
- M. Suzuki, Generalized Trotter’s formula and systematic approximants of exponential operators and inner derivations with applications to many-body problems, Commun. Math. Phys. 51, 183 (1976).
- S. Lloyd, Universal quantum simulators, Science 273, 1073 (1996).
- A. T. Sornborger and E. D. Stewart, Higher-order methods for simulations on quantum computers, Phys. Rev. A 60, 1956 (1999).
- Y. Li and S. C. Benjamin, Efficient variational quantum simulator incorporating active error minimization, Phys. Rev. X 7, 021050 (2017).
- X. Yuan, S. Endo, Q. Zhao, Y. Li, and S. C. Benjamin, Theory of variational quantum simulation, Quantum 3, 191 (2019).
- K. Heya, K. M. Nakanishi, K. Mitarai, Z. Yan, K. Zuo, Y. Suzuki, T. Sugiyama, S. Tamate, Y. Tabuchi, K. Fujii, and Y. Nakamura, Subspace variational quantum simulator, Phys. Rev. Res. 5, 023078 (2023).
- S. Endo, J. Sun, Y. Li, S. C. Benjamin, and X. Yuan, Variational quantum simulation of general processes, Phys. Rev. Lett. 125, 010501 (2020).
- M. Benedetti, M. Fiorentini, and M. Lubasch, Hardware-efficient variational quantum algorithms for time evolution, Phys. Rev. Res. 3, 033083 (2021).
- S.-H. Lin, R. Dilip, A. G. Green, A. Smith, and F. Pollmann, Real- and imaginary-time evolution with compressed quantum circuits, PRX Quantum 2, 010342 (2021).
- N. F. Berthusen, T. V. Trevisan, T. Iadecola, and P. P. Orth, Quantum dynamics simulations beyond the coherence time on noisy intermediate-scale quantum hardware by variational Trotter compression, Phys. Rev. Res. 4, 023097 (2022).
- K. Mizuta, Y. O. Nakagawa, K. Mitarai, and K. Fujii, Local variational quantum compilation of large-scale Hamiltonian dynamics, PRX Quantum 3, 040302 (2022).
- Y. Akahoshi, R. Toshio, J. Fujisaki, H. Oshima, S. Sato, and K. Fujii, Compilation of Trotter-based time evolution for partially fault-tolerant quantum computing architecture, PRX Quantum 6, 040319 (2025).
- S. Kanasugi, S. Tsutsui, Y. O. Nakagawa, K. Maruyama, H. Oshima, and S. Sato, Computation of Green’s function by local variational quantum compilation, Phys. Rev. Res. 5, 033070 (2023).
- S. Kanasugi, Y. Hidaka, Y. O. Nakagawa, S. Tsutsui, N. Matsumoto, K. Maruyama, H. Oshima, and S. Sato, Subspace-based local compilation of variational quantum circuits for large-scale quantum many-body simulation, Phys. Rev. Res. 7, 023298 (2025).
- E. Campbell, Random compiler for fast Hamiltonian simulation, Phys. Rev. Lett. 123, 070503 (2019).
- G. H. Low and I. L. Chuang, Hamiltonian simulation by qubitization, Quantum 3, 163 (2019).
- R. Babbush, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, A. Paler, A. Fowler, and H. Neven, Encoding electronic spectra in quantum circuits with linear T complexity, Phys. Rev. X 8, 041015 (2018).
- Y. Atia and D. Aharonov, Fast-forwarding of Hamiltonians and exponentially precise measurements, Nat. Commun. 8, 1572 (2017).
- N.-H. Chia, K.-M. Chung, Y.-C. Hsieh, H.-H. Lin, Y.-T. Lin, and Y.-C. Shen, On the impossibility of general parallel fast-forwarding of Hamiltonian simulation, in Proceedings of the 38th Computational Complexity Conference (CCC '2023), Warwick United Kingdom, LIPIcs Vol. 264 (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2023), pp. 33:1–33:45.
- S. Gu, R. D. Somma, and B. Şahinoğlu, Fast-forwarding quantum evolution, Quantum 5, 577 (2021).
- D. W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders, Efficient quantum algorithms for simulating sparse Hamiltonians, Commun. Math. Phys. 270, 359 (2007).
- K. H. Lim, T. Haug, L. C. Kwek, and K. Bharti, Fast-forwarding with NISQ processors without feedback loop, Quantum Sci. Technol. 7, 015001 (2022).
- Y. Dong and L. Lin, Multi-level quantum signal processing with applications to ground state preparation using fast-forwarded Hamiltonian evolution, arXiv:2406.02086.
- C. Cîrstoiu, Z. Holmes, J. Iosue, L. Cincio, P. J. Coles, and A. Sornborger, Variational fast forwarding for quantum simulation beyond the coherence time, npj Quantum Inf. 6, 82 (2020).
- J. Gibbs, K. Gili, Z. Holmes, B. Commeau, A. Arrasmith, L. Cincio, P. J. Coles, and A. Sornborger, Long-time simulations for fixed input states on quantum hardware, npj Quantum Inf. 8, 135 (2022).
- B. Commeau, M. Cerezo, Z. Holmes, L. Cincio, P. J. Coles, and A. Sornborger, Variational Hamiltonian diagonalization for dynamical quantum simulation, arXiv:2009.02559.
- E. Kökcü, T. Steckmann, Y. Wang, J. K. Freericks, E. F. Dumitrescu, and A. F. Kemper, Fixed depth Hamiltonian simulation via Cartan decomposition, Phys. Rev. Lett. 129, 070501 (2022).
- D. d’Alessandro, Introduction to Quantum Control and Dynamics (Chapman and Hall/CRC, Boca Raton, FL, 2021).
- R. Wiersema, E. Kökcü, A. F. Kemper, and B. N. Bakalov, Classification of dynamical Lie algebras of 2-local spin systems on linear, circular and fully connected topologies, npj Quantum Inf. 10, 110 (2024).
- E. Kökcü, R. Wiersema, A. F. Kemper, and B. N. Bakalov, Classification of dynamical Lie algebras generated by spin interactions on undirected graphs, arXiv:2409.19797.
- S. Helgason, Differential geometry, lie groups, and symmetric spaces, CRM Proceedings & Lecture Notes (American Mathematical Society, Providence, RI, 2001).
- H. N. S. Earp and J. K. Pachos, A constructive algorithm for the Cartan decomposition of SU(), J. Math. Phys. 46, 082108 (2005).
- J. M. Lee, Introduction to smooth manifolds, Graduate Texts in Mathematics, 2nd ed. (Springer, New York, NY, 2012), Vol. 218.
- S. B. Bravyi and A. Y. Kitaev, Fermionic quantum computation, Ann. Phys. (NY) 298, 210 (2002).
- J. T. Seeley, M. J. Richard, and P. J. Love, The Bravyi-Kitaev transformation for quantum computation of electronic structure, J. Chem. Phys. 137, 224109 (2012).
- K. Setia and J. D. Whitfield, Bravyi-Kitaev superfast simulation of electronic structure on a quantum computer, J. Chem. Phys. 148, 164104 (2018).
- C. Derby, J. Klassen, J. Bausch, and T. Cubitt, Compact fermion to qubit mappings, Phys. Rev. B 104, 035118 (2021).
- Z. Jiang, A. Kalev, W. Mruczkiewicz, and H. Neven, Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning, Quantum 4, 276 (2020).
- A. Miller, Z. Zimborás, S. Knecht, S. Maniscalco, and G. García-Pérez, Bonsai algorithm: Grow your own fermion-to-qubit mappings, PRX Quantum 4, 030314 (2023).
- Y. Liu, K. Yao, J. Hong, J. Froustey, E. Rrapaj, C. Iancull, G. Li, and Y. Shi, Hatt: Hamiltonian adaptive ternary tree for optimizing fermion-to-qubit mapping, in 2025 IEEE International Symposium on High Performance Computer Architecture (HPCA) (IEEE, Piscataway, NJ, 2025), p. 143.
- T. Steckmann, T. Keen, E. Kökcü, A. F. Kemper, E. F. Dumitrescu, and Y. Wang, Mapping the metal-insulator phase diagram by algebraically fast-forwarding dynamics on a cloud quantum computer, Phys. Rev. Res. 5, 023198 (2023).
- S. Helgason, Differential geometry, lie groups, and symmetric spaces, Graduate Studies in Mathematics (American Mathematical Society, Providence, RI, 2001), Vol. 34.
- A. W. Knapp, Lie groups beyond an introduction, Progress in Mathematics, 2nd ed. (Birkhäuser, Boston, MA, 2002), Vol. 140.