- 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

Large-scale quantum device benchmarking via LXEB with particle-number-conserving random quantum circuits

Takumi Kaneda1,*, Keisuke Fujii1,2,3, and Hiroshi Ueda2,4

  • *Contact author: u007243b@ecs.osaka-u.ac.jp
PDF

Phys. Rev. Research 8, 013082 – Published 26 January, 2026

DOI: https://doi.org/10.1103/ssrm-kddv

Abstract

Linear cross-entropy benchmarking (LXEB) with random quantum circuits is a standard method for evaluating quantum computers. However, LXEB requires classically simulating the ideal output distribution of a given quantum circuit with high numerical precision, which becomes infeasible beyond approximately 50 qubits, even on state-of-the-art supercomputers. As a result, LXEB cannot be directly applied to evaluate large-scale quantum devices, which now exceed 100 qubits and continue to grow rapidly in size. To address this limitation, we introduce a constraint known as particle-number conservation into the random quantum circuits used for benchmarking. This restriction significantly reduces the size of the Hilbert space for a fixed particle number, enabling classical simulations of circuits with over 100 qubits when the particle number is O(1). Furthermore, we propose a modified version of LXEB, called MLXEB, which enables fidelity estimation under particle-number-conserving dynamics. Through numerical simulations, we investigate the conditions under which MLXEB provides accurate fidelity estimates.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (48)

  1. A. M. Dalzell, S. McArdle, M. Berta, P. Bienias, C.-F. Chen, A. Gilyén, C. T. Hann, M. J. Kastoryano, E. T. Khabiboulline, A. Kubica, et al., Quantum Algorithms: A Survey of Applications and End-to-End Complexities (Cambridge University Press, Cambridge, 2025).
  2. 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).
  3. A. Morvan, B. Villalonga, X. Mi, S. Mandra, A. Bengtsson, P. Klimov, Z. Chen, S. Hong, C. Erickson, I. Drozdov, et al., Phase transitions in random circuit sampling, Nature (London) 634, 328 (2024).
  4. D. Gao, D. Fan, C. Zha, J. Bei, G. Cai, J. Cai, S. Cao, F. Chen, J. Chen, K. Chen, et al., Establishing a new benchmark in quantum computational advantage with 105-qubit Zuchongzhi 3.0 processor, Phys. Rev. Lett. 134, 090601 (2025).
  5. M. DeCross, R. Haghshenas, M. Liu, E. Rinaldi, J. Gray, Y. Alexeev, C. H. Baldwin, J. P. Bartolotta, M. Bohn, and E. A. Chertkov, The computational power of random quantum circuits in arbitrary geometries, Phys. Rev. X 15, 021052 (2025).
  6. 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., Google Quantum AI and Collaborators. Quantum error correction below the surface code threshold, Nature (London) 638, 920 (2025).
  7. A. Katabarwa, K. Gratsea, A. Caesura, and P. D. Johnson, Early fault-tolerant quantum computing, PRX Quantum 5, 020101 (2024).
  8. M. AbuGhanem, IBM quantum computers: Evolution, performance, and future directions, J. Supercomput. 81, 687 (2025).
  9. J. Preskill, Quantum computing in the NISQ era and beyond, Quantum 2, 79 (2018).
  10. J. Eisert, D. Hangleiter, N. Walk, I. Roth, D. Markham, R. Parekh, U. Chabaud, and E. Kashefi, Quantum certification and benchmarking, Nat. Rev. Phys. 2, 382 (2020).
  11. A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Phys. Rev. A 86, 032324 (2012).
  12. E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, J. Math. Phys. 43, 4452 (2002).
  13. Z. Zhou, A. Ji, and Y. Ding, Surface code error correction with crosstalk noise, arXiv:2503.04642.
  14. J. F. Kam, S. Gicev, K. Modi, A. Southwell, and M. Usman, Detrimental non-Markovian errors for surface code memory, Quantum Sci. Technol. 10, 035060 (2025).
  15. T. Proctor, K. Young, A. D. Baczewski, and R. Blume-Kohout, Benchmarking quantum computers, Nat. Rev. Phys. 7, 105 (2025).
  16. A. Erhard, J. J. Wallman, L. Postler, M. Meth, R. Stricker, E. A. Martinez, P. Schindler, T. Monz, J. Emerson, and R. Blatt, Characterizing large-scale quantum computers via cycle benchmarking, Nat. Commun. 10, 5347 (2019).
  17. R. Harper, S. T. Flammia, and J. J. Wallman, Efficient learning of quantum noise, Nat. Phys. 16, 1184 (2020).
  18. E. Magesan, J. M. Gambetta, and J. Emerson, Characterizing quantum gates via randomized benchmarking, Phys. Rev. A 85, 042311 (2012).
  19. E. Knill, D. Leibfried, R. Reichle, J. Britton, R. B. Blakestad, J. D. Jost, C. Langer, R. Ozeri, S. Seidelin, and D. J. Wineland, Randomized benchmarking of quantum gates, Phys. Rev. A 77, 012307 (2008).
  20. C. Dankert, R. Cleve, J. Emerson, and E. Livine, Exact and approximate unitary 2-designs and their application to fidelity estimation, Phys. Rev. A 80, 012304 (2009).
  21. E. Magesan, J. M. Gambetta, and J. Emerson, Scalable and robust randomized benchmarking of quantum processes, Phys. Rev. Lett. 106, 180504 (2011).
  22. S. T. Flammia and J. J. Wallman, Efficient estimation of Pauli channels, ACM Trans. Quantum Comput. 1, 1 (2020).
  23. R. Harper, W. Yu, and S. T. Flammia, Fast estimation of sparse quantum noise, PRX Quantum 2, 010322 (2021).
  24. S. T. Flammia and R. O'Donnell, Pauli error estimation via population recovery, Quantum 5, 549 (2021).
  25. S. T. Flammia, Averaged circuit eigenvalue sampling, in in 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022), Leibniz International Proceedings in Informatics (LIPIcs) (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022), Vol. 232, pp. 4:1–4:10.
  26. S. Boixo, S. V. Isakov, V. N. Smelyanskiy, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, Characterizing quantum supremacy in near-term devices, Nat. Phys. 14, 595 (2018).
  27. S. Mullane, Sampling random quantum circuits: A pedestrian's guide, arXiv:2007.07872.
  28. Y. Liu, M. Otten, R. Bassirianjahromi, L. Jiang, and B. Fefferman, Benchmarking near-term quantum computers via random circuit sampling, arXiv:2105.05232.
  29. J. Chen, D. Ding, C. Huang, and L. Kong, Linear cross-entropy benchmarking with Clifford circuits, Phys. Rev. A 108, 052613 (2023).
  30. B. Cheng, F. Meng, Z.-J. Zhang, and M.-H. Yung, Generalized cross-entropy benchmarking for random circuits with ergodicity, Chip 4, 100127 (2025).
  31. D. Lacroix, E. A. R. Guzman, and P. Siwach, Symmetry breaking/symmetry preserving circuits and symmetry restoration on quantum computers: A quantum many-body perspective, Eur. Phys. J. A 59, 3 (2023).
  32. P. K. Barkoutsos, J. F. Gonthier, I. Sokolov, N. Moll, G. Salis, A. Fuhrer, M. Ganzhorn, D. J. Egger, M. Troyer, A. Mezzacapo, et al., Quantum algorithms for electronic structure calculations: Particle-hole Hamiltonian and optimized wave-function expansions, Phys. Rev. A 98, 022322 (2018).
  33. J. J. Meyer, M. Mularski, E. Gil-Fuster, A. A. Mele, F. Arzani, A. Wilms, and J. Eisert, Exploiting symmetry in variational quantum machine learning, PRX Quantum 4, 010328 (2023).
  34. J. M. Arrazola, O. Di Matteo, N. Quesada, S. Jahangiri, A. Delgado, and N. Killoran, Universal quantum circuits for quantum chemistry, Quantum 6, 742 (2022).
  35. B. M. Ayeni, A bottom-up approach to constructing symmetric variational quantum circuits, arXiv:2308.08912.
  36. B. T. Gard, L. Zhu, G. S. Barron, N. J. Mayhall, S. E. Economou, and E. Barnes, Efficient symmetry-preserving state preparation circuits for the variational quantum eigensolver algorithm, npj Quantum Inf. 6, 10 (2020).
  37. A. Summer, A. Nico-Katz, S. Dooley, and J. Goold, Anomalous transport in U(1)-symmetric quantum circuits, npj Quantum Inf. (2026).
  38. H. Liu, A. Hulse, and I. Marvian, Unitary designs from random symmetric quantum circuits, arXiv:2408.14463.
  39. Y. Mitsuhashi, R. Suzuki, T. Soejima, and N. Yoshioka, Unitary designs of symmetric local random circuits, Phys. Rev. Lett. 134, 180404 (2025).
  40. N. Khaneja, R. Brockett, and S. J. Glaser, Time optimal control in spin systems, Phys. Rev. A 63, 032308 (2001).
  41. B. Kraus and J. I. Cirac, Optimal creation of entanglement using a two-qubit gate, Phys. Rev. A 63, 062309 (2001).
  42. R. Suzuki, H. Katsura, Y. Mitsuhashi, T. Soejima, J. Eisert, and N. Yoshioka, More global randomness from less random local gates, arXiv:2410.24127.
  43. A. W. Harrow and R. A. Low, Random quantum circuits are approximate 2-designs, Commun. Math. Phys. 291, 257 (2009).
  44. M. Nielsen and I. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, Cambridge, 2010).
  45. K. Mølmer, Y. Castin, and J. Dalibard, Monte Carlo wave-function method in quantum optics, J. Opt. Soc. Am. B 10, 524 (1993).
  46. H. Ueda, S. Yunoki, and T. Shimokawa, Quantum spin solver near saturation: QS3, Comput. Phys. Commun. 277, 108369 (2022).
  47. H. Ueda, D. Yamamoto, and T. Shimokawa, QS3 for Various Quantum Spin Systems, GitHub repository: QS-Cube/ED2, GitHub repository (2023), https://github.com/QS-Cube/ED2.
  48. A. Hashim, L. B. Nguyen, N. Goss, B. Marinelli, R. K. Naik, T. Chistolini, J. Hines, J. Marceaux, Y. Kim, P. Gokhale, et al., Practical introduction to benchmarking and characterization of quantum computers, PRX Quantum 6, 030202 (2025).

Outline

Information

Phys. Rev. Research 8, 013082– Published 26 January, 2026
  • Received 25 July 2025
  • Accepted 23 December 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