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
  • Editors' Suggestion
  • Open Access

Scalable simulation of quantum many-body dynamics with or-represented quantum algebra

Lukas Broers1,*, Rong-Yang Sun1,2, and Seiji Yunoki1,3,4,5

  • *Contact author: Lukas.broers@riken.jp

Phys. Rev. Applied 26, 024046 – Published 18 August, 2026

DOI: https://doi.org/10.1103/y8ft-m61w

Abstract

High-performance numerical methods are essential not only for advancing quantum many-body physics but also for enabling integration with emerging quantum computing platforms. We present a scalable, general-purpose parallel algorithm for quantum simulations based on or-represented quantum algebra (ORQA). This framework applies to arbitrary spin systems and naturally integrates with quantum circuit simulation in the Heisenberg picture, making it particularly relevant to recent large-scale experiments on superconducting qubit processors [Y. Kim et al. Nature (London) 618, 500 (2023)]. As a benchmark, we simulate the kicked Ising model on a 127-qubit heavy-hexagon lattice, tracking the time evolution of local magnetization using up to 1×1012 Pauli strings. Executed on the supercomputer Fugaku, our simulations exhibit strong scaling up to 217 parallel processes with near-linear communication overhead. These results establish ORQA as a practical and high-performance tool for quantum many-body dynamics and highlight its potential for integration into hybrid quantum-classical computational frameworks, complementing recent advances in tensor network and surrogate simulation techniques.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (33)

  1. F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell et al., Quantum supremacy using a programmable superconducting processor, Nature (London) 574, 505 (2019).
  2. Y. A. Liu, X. L. Liu, F. N. Li, H. Fu, Y. Yang, J. Song, P. Zhao, Z. Wang, D. Peng, H. Chen, C. Guo, H. Huang, W. Wu, and D. Chen, Closing the ”quantum supremacy” gap: Achieving real-time simulation of a random quantum circuit using a new Sunway supercomputer, in Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC ’21 (Association for Computing Machinery, New York, NY, USA, 2021).
  3. Y. Kim, A. Eddins, S. Anand, K. X. Wei, E. van den Berg, S. Rosenblatt, H. Nayfeh, Y. Wu, M. Zaletel, K. Temme, and A. Kandala, Evidence for the utility of quantum computing before fault tolerance, Nature (London) 618, 500 (2023).
  4. R. Acharya, D. A. Abanin, L. Aghababaie-Beni, I. Aleiner, T. I. Andersen, M. Ansmann, F. Arute, K. Arya, A. Asfaw, N. Astrakhantsev et al., Quantum error correction below the surface code threshold, Nature (London) 638, 920 (2025).
  5. J. Preskill, Quantum computing in the NISQ era and beyond, Quantum 2, 79 (2018).
  6. K. Bharti, A. Cervera-Lierta, T. H. Kyaw, T. Haug, S. Alperin-Lea, A. Anand, M. Degroote, H. Heimonen, J. S. Kottmann, T. Menke, W.-K. Mok, S. Sim, L.-C. Kwek, and A. Aspuru-Guzik, Noisy intermediate-scale quantum algorithms, Rev. Mod. Phys. 94, 015004 (2022).
  7. Y. Alexeev, M. Amsler, M. A. Barroca, S. Bassini, T. Battelle, D. Camps, D. Casanova, Y. J. Choi, F. T. Chong, C. Chung et al., Quantum-centric supercomputing for materials science: A perspective on challenges and future directions, Future Gener. Comput. Syst. 160, 666 (2024).
  8. J. Robledo-Moreno, M. Motta, H. Haas, A. Javadi-Abhari, P. Jurcevic, W. Kirby, S. Martiel, K. Sharma, S. Sharma, T. Shirakawa, I. Sitdikov, R.-Y. Sun, K. J. Sung, M. Takita, M. C. Tran, S. Yunoki, and A. Mezzacapo, Chemistry beyond the scale of exact diagonalization on a quantum-centric supercomputer, Sci. Adv. 11, eadu9991 (2025).10.1126/sciadv.adu999
  9. H.-J. Liao, K. Wang, Z.-S. Zhou, P. Zhang, and T. Xiang, Simulation of IBM’s kicked Ising experiment with projected entangled pair operator, arXiv:2308.03082.
  10. M. S. Rudolph, E. Fontana, Z. Holmes, and L. Cincio, Classical surrogate simulation of quantum systems with LOWESA, arXiv:2308.09109.
  11. J. Tindall, M. Fishman, E. M. Stoudenmire, and D. Sels, Efficient tensor network simulation of IBM’s eagle kicked ising experiment, PRX Quantum 5, 010308 (2024).
  12. S. Patra, S. S. Jahromi, S. Singh, and R. Orús, Efficient tensor network simulation of IBM’s largest quantum processors, Phys. Rev. Res. 6, 013326 (2024).
  13. T. Begušić, J. Gray, and G. K.-L. Chan, Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance, Sci. Adv. 10, eadk4321 (2024).10.1126/sciadv.adk432
  14. T. Begušić, J. Gray, and G. K.-L. Chan, Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance, Sci. Adv. 10, eadk4321 (2024).10.1126/sciadv.adk432
  15. J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, Quantum machine learning, Nature (London) 549, 195 (2017).
  16. M. Cerezo, G. Verdon, H.-Y. Huang, L. Cincio, and P. J. Coles, Challenges and opportunities in quantum machine learning, Nat. Comput. Sci. 2, 567 (2022).
  17. S. R. White, Density matrix formulation for quantum renormalization groups, Phys. Rev. Lett. 69, 2863 (1992).
  18. S. Östlund and S. Rommer, Thermodynamic limit of density matrix renormalization, Phys. Rev. Lett. 75, 3537 (1995).
  19. U. Schollwöck, The density-matrix renormalization group in the age of matrix product states, Ann. Phys. (Amsterdam) 326, 96 (2011).
  20. S. Paeckel, T. Köhler, A. Swoboda, S. R. Manmana, U. Schollwöck, and C. Hubig, Time-evolution methods for matrix-product states, Ann. Phys. (Amsterdam) 411, 167998 (2019).
  21. F. Verstraete and J. I. Cirac, Renormalization algorithms for quantum-many body systems in two and higher dimensions, arXiv:Cond-Mat/0407066.
  22. F. Verstraete and J. I. Cirac, Valence-bond states for quantum computation, Phys. Rev. A 70, 060302 (2004).
  23. R. Orús, Tensor networks for complex quantum systems, Nat. Rev. Phys. 1, 538 (2019).
  24. J. I. Cirac, D. Pérez-García, N. Schuch, and F. Verstraete, Matrix product states and projected entangled pair states: Concepts, symmetries, theorems, Rev. Mod. Phys. 93, 045003 (2021).
  25. E. Fontana, M. S. Rudolph, R. Duncan, I. Rungger, and C. Cîrstoiu, Classical simulations of noisy variational quantum circuits, npj Quantum Inf. 11, 84 (2025).
  26. T. Begušić and G. K.-L. Chan, Real-time operator evolution in two and three dimensions via sparse Pauli dynamics, PRX Quantum 6, 020302 (2025).
  27. L. Broers and L. Mathey, Exclusive- or encoded algebraic structure for efficient quantum dynamics, New J. Phys. 28, 044508 (2026).
  28. N. Loizeau, J. C. Peacock, and D. Sels, Quantum many-body simulations with paulistrings.jl, SciPost Phys. Codebases 54 (2025).
  29. M. S. Rudolph, T. Jones, Y. Teng, A. Angrisani, and Z. Holmes, Pauli propagation: A computational framework for simulating quantum systems, arXiv:2505.21606.
  30. S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Phys. Rev. A 70, 052328 (2004).
  31. J. M. Chow, J. M. Gambetta, A. D. Córcoles, S. T. Merkel, J. A. Smolin, C. Rigetti, S. Poletto, G. A. Keefe, M. B. Rothwell, J. R. Rozen, M. B. Ketchen, and M. Steffen, Universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits, Phys. Rev. Lett. 109, 060501 (2012).
  32. P. Rall, D. Liang, J. Cook, and W. Kretschmer, Simulation of qubit quantum circuits via Pauli propagation, Phys. Rev. A 99, 062337 (2019).
  33. ktprime et al., Emhash—fast and memory efficient open addressing C++ flat hash table/map (2025).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation