Efficient classical simulation of large-scale unitary cluster Jastrow circuits

• URL: http://arxiv.org/abs/2607.21337v1
• Date: Thu, 23 Jul 2026 14:07:35 GMT
• Title: Efficient classical simulation of large-scale unitary cluster Jastrow circuits
• Abstract summary: Recent experiments on quantum computers have challenged the limits of classical computation in chemistry.<n>Many experiments have utilized the unitary cluster Jastrow ansatz, a quantum circuit inspired by the unitary coupled cluster ansatz.<n>We present a time classical algorithm to compute the energy of any single-layer unitary cluster Jastrow circuit.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent experiments on quantum computers have challenged the limits of classical computation in chemistry, simulating ground states of strongly correlated molecules. Many of these experiments have utilized the unitary cluster Jastrow ansatz, a quantum circuit inspired by the unitary coupled cluster ansatz that can be tailored to current quantum hardware. Notably, the largest experiment in Sci. Adv. 11, 25 (2025) executed a quantum circuit with 77 qubits and 10,570 gates on an IBM quantum computer and performed classical post-processing with up to 6400 nodes on Fugaku to compute ground state energies better than Hartree-Fock. In this work, we present a polynomial time classical algorithm to compute the energy of any single-layer unitary cluster Jastrow circuit, independent of locality constraints for quantum hardware. Our algorithm can reproduce the largest experiment from Sci. Adv. 11, 25 (2025) in less than a minute on a laptop, and through circuit optimization enabled by fast simulation we achieve a lower ground state energy than the experiment.

Related papers

• Scalable Simulation of Quantum Many-Body Dynamics with Or-Represented Quantum Algebra [0.0]
  We present a scalable and general-purpose parallel algorithm for quantum simulations based on or-represented quantum algebra (ORQA)<n>We simulate the kicked Ising model on a 127-qubit heavy-hexagon lattice, tracking the time evolution of local magnetization using up to one trillion Pauli strings.
  arXiv  Detail & Related papers  (2025-06-16T08:41:54Z)
• Establishing a New Benchmark in Quantum Computational Advantage with 105-qubit Zuchongzhi 3.0 Processor [65.64902746326833]
  Zuchongzhi 3.0 is a superconducting quantum computer prototype, comprising 105 qubits.<n>Experiments with an 83-qubit, 32-cycle random circuit sampling on Zuchongzhi 3.0 highlight its superior performance, achieving one million samples in just a few hundred seconds.
  arXiv  Detail & Related papers  (2024-12-16T16:11:26Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Chemistry Beyond the Scale of Exact Diagonalization on a Quantum-Centric Supercomputer [2.562863293556441]
  A universal quantum computer can simulate diverse quantum systems, with electronic structure for chemistry offering challenging problems around the hundred-qubit mark.<n>Here, we demonstrate the use of classical distributed computing to offload all but an intrinsically quantum component of a workflow for electronic structure simulations.<n>Our results suggest that, for current error rates, a quantum-centric supercomputing architecture can tackle challenging chemistry problems beyond sizes amenable to exact diagonalization.
  arXiv  Detail & Related papers  (2024-05-08T14:08:07Z)
• 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)
• Fast classical simulation of evidence for the utility of quantum computing before fault tolerance [0.0]
  We show that a classical algorithm based on sparse Pauli dynamics can efficiently simulate quantum circuits studied in a recent experiment on 127 qubits of IBM's Eagle processor. Our simulations on a single core of a laptop are orders of magnitude faster than the reported walltime of the quantum simulations, and are in good agreement with the zero-noise extrapolated experimental results.
  arXiv  Detail & Related papers  (2023-06-28T17:08:00Z)
• 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)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Simulating the Sycamore quantum supremacy circuits [7.15956388718641]
  We propose a general tensor network method for simulating quantum circuits. As an application, we study the sampling problem of Google's Sycamore circuits.
  arXiv  Detail & Related papers  (2021-03-04T14:55:15Z)
• Classical Simulation of Quantum Supremacy Circuits [11.913526591569632]
  It is believed that random quantum circuits are difficult to simulate classically. In this work, we present a network-based classical simulation algorithm. We estimate that our simulator can perform this task in less than 20 days.
  arXiv  Detail & Related papers  (2020-05-14T07:57:38Z)

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.