Large-Scale Quantum Device Benchmarking via LXEB with Particle-Number-Conserving Random Quantum Circuits

• URL: http://arxiv.org/abs/2505.10820v3
• Date: Wed, 23 Jul 2025 09:29:31 GMT
• Title: Large-Scale Quantum Device Benchmarking via LXEB with Particle-Number-Conserving Random Quantum Circuits
• Authors: Takumi Kaneda, Keisuke Fujii, Hiroshi Ueda,
• Abstract summary: We introduce a constraint known as particle-number conservation into the random quantum circuits used for benchmarking.<n>This reduces the size of the Hilbert space for a fixed particle number, enabling classical simulations of circuits with over 100 qubits.<n>We propose a modified version of LXEB, called MLXEB, which enables fidelity estimation under particle-number-conserving dynamics.
• Score: 0.8009842832476994
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Quantum block Krylov subspace projector algorithm for computing low-lying eigenenergies [0.0]
  QBKSP is a multireference quantum Lanczos method designed to accurately compute low-lying eigenenergies, including degenerate ones, of quantum systems.<n>We present three compact quantum circuits tailored to different problem settings for evaluating the required expectation values.
  arXiv  Detail & Related papers  (2025-06-11T17:47:22Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• State of practice: evaluating GPU performance of state vector and tensor network methods [2.4851820343103035]
  This article investigates the limits of current state-of-the-art simulation techniques on a test bench made of eight widely used quantum subroutines.<n>We highlight how to select the best simulation strategy, obtaining a speedup of up to an order of magnitude.
  arXiv  Detail & Related papers  (2024-01-11T09:22:21Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Forward and Backward Constrained Bisimulations for Quantum Circuits using Decision Diagrams [3.788308836856851]
  We develop efficient methods for the simulation of quantum circuits on classic computers. In particular, we show that constrained bisimulation can boost decision-diagram-based quantum circuit simulation by several orders of magnitude.
  arXiv  Detail & Related papers  (2023-08-18T12:40:47Z)
• Classical Chaos in Quantum Computers [39.58317527488534]
  Current-day quantum processors, comprising 50-100 qubits, operate outside the range of quantum simulation on classical computers. We demonstrate that the simulation of classical limits can be a potent diagnostic tool potentially mitigating this problem. We find that classical and quantum simulations lead to similar stability metrics in systems with $mathcalO$ transmons.
  arXiv  Detail & Related papers  (2023-04-27T18:00:04Z)
• Simulating large-size quantum spin chains on cloud-based superconducting quantum computers [0.46040036610482665]
  We report on cloud simulations performed on several of IBM's superconducting quantum computers. We find that the ground-state energies extracted from realizations reach the expected values to within errors that are small. By using a 102-qubit system, we have been able to successfully apply up to 3186 CNOT gates in a single circuit.
  arXiv  Detail & Related papers  (2022-07-20T15:55:29Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage [6.019061613604927]
  We present an efficient classical algorithm that, with 1 GPU within 2s, yields high XEB values, namely 2-12% of those obtained in experiments. By identifying and exploiting several vulnerabilities of the XEB, we achieve high XEB values without full simulation of quantum circuits.
  arXiv  Detail & Related papers  (2021-12-03T00:37:10Z)
• Multi-Tensor Contraction for XEB Verification of Quantum Circuits [0.0]
  We present a multi-tensor contraction algorithm for speeding up the calculations of XEB for quantum circuits. If the algorithm was implemented on the Summit supercomputer, we estimate that for the supremacy (20 cycles) circuits, it would only cost 7.5 days.
  arXiv  Detail & Related papers  (2021-08-12T11:15:49Z)
• Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale [57.84751206630535]
  We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework. The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators. By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
  arXiv  Detail & Related papers  (2021-04-21T13:26:42Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.