Emulation of large-scale qubit registers with a phase space approach

• URL: http://arxiv.org/abs/2602.10830v1
• Date: Wed, 11 Feb 2026 13:16:25 GMT
• Title: Emulation of large-scale qubit registers with a phase space approach
• Authors: Christian de Correc, Denis Lacroix, Corentin Bertrand,
• Abstract summary: A phase-space approach is used and benchmarked for the simulation of the continuous-time evolution of large registers of qubits.<n>We benchmark the method on the $k$-local transverse-field Ising model (TFIM)
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A phase-space approach is used and benchmarked for the simulation of the continuous-time evolution of large registers of qubits. It is based on a statistical ensemble of independent mean-field trajectories, where mean-field is introduced at the level of the qubits, substituting quantum fluctuations/correlations with classical ones. The approach only involves at worse a quadratic cost in the system size, allowing to simulate up to several thousands of qubits on a classical computer. It provides qualitatively accurate description of one-qubit observables evolutions, making it a useful reference in comparison to techniques limited to small qubit numbers. The predictive power is however less robust for multi-qubits observables. We benchmark the method on the $k$-local transverse-field Ising model (TFIM), considering a large variety of systems ranging from local to all-to-all interactions, and from weak to strong coupling regimes, with up to 2000 qubits. To showcase the versatility of the approach, simulations on 2D and 3D Ising models are also made.

Related papers

• Discrete Bridges for Mutual Information Estimation [48.80678813569798]
  We leverage the discrete state space formulation of bridge matching models to address the estimation of the mutual information between discrete random variables.<n>By neatly framing MI estimation as a domain transfer problem, we construct a Discrete Bridge Mutual Information (DBMI) estimator suitable for discrete data.<n>We showcase the performance of our estimator on two MI estimation settings: low-dimensional and image-based.
  arXiv  Detail & Related papers  (2026-02-09T16:55:09Z)
• Analog quantum simulation of the Lipkin-Meshkov-Glick model in a transmon qudit [0.3372751145910977]
  We present an experimental realization of the Lipkin-Meshkov-Glick (LMG) model using an analog simulator based on a single superconducting transmon qudit with up to $d = 9$ levels.<n>This is accomplished by moving to a rotated frame in which evolution under any time-dependent local field and one-axis twisting can be realized.<n>We provide a detailed study of five finite-size precursors of quantum criticality in the LMG model.
  arXiv  Detail & Related papers  (2025-12-04T20:30:07Z)
• Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers [0.6536048280842786]
  We develop randomized quantum algorithms to simulate quantum collision models, also known as repeated interaction schemes.<n>Our methods can leverage quantum collision models for both Markovian and non-Markovian dynamics on early fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2025-04-30T12:09:54Z)
• Augmenting Simulated Noisy Quantum Data Collection by Orders of Magnitude Using Pre-Trajectory Sampling with Batched Execution [47.60253809426628]
  We present the Pre-Trajectory Sampling technique, increasing efficiency and utility of trajectory simulations by tailoring error types.<n>We generate massive datasets of one trillion and one million shots, respectively.
  arXiv  Detail & Related papers  (2025-04-22T22:36:18Z)
• Sports-Traj: A Unified Trajectory Generation Model for Multi-Agent Movement in Sports [53.637837706712794]
  We propose a Unified Trajectory Generation model, UniTraj, that processes arbitrary trajectories as masked inputs.<n>Specifically, we introduce a Ghost Spatial Masking (GSM) module, embedded within a Transformer encoder, for spatial feature extraction.<n>We benchmark three practical sports datasets, Basketball-U, Football-U, and Soccer-U, for evaluation.
  arXiv  Detail & Related papers  (2024-05-27T22:15:23Z)
• Message-Passing Neural Quantum States for the Homogeneous Electron Gas [41.94295877935867]
  We introduce a message-passing-neural-network-based wave function Ansatz to simulate extended, strongly interacting fermions in continuous space. We demonstrate its accuracy by simulating the ground state of the homogeneous electron gas in three spatial dimensions.
  arXiv  Detail & Related papers  (2023-05-12T04:12:04Z)
• A framework for efficient ab initio electronic structure with Gaussian Process States [0.0]
  We present a framework for the efficient simulation of realistic fermionic systems with modern machine learning inspired representations of quantum many-body states. We show competitive accuracy for systems with up to 64 electrons, including a simplified (yet fully ab initio) model of the Mott transition in three-dimensional hydrogen.
  arXiv  Detail & Related papers  (2023-02-02T13:40:38Z)
• Identification of quantum entanglement with Siamese convolutional neural networks and semi-supervised learning [0.0]
  Quantum entanglement is a fundamental property commonly used in various quantum information protocols and algorithms. In this study, we use deep convolutional NNs, a type of supervised machine learning, to identify quantum entanglement for any bi Partition in a 3-qubit system.
  arXiv  Detail & Related papers  (2022-10-13T23:17:55Z)
• Holographic quantum simulation of entanglement renormalization circuits [14.385064176392595]
  Current noisy quantum computers are limited to tens of qubits. With the technique of holographic quantum simulation, a $D$-dimensional system can be simulated with a $Drm -1$-dimensional subset of qubits.
  arXiv  Detail & Related papers  (2022-03-02T05:58:19Z)
• Benchmarking a novel efficient numerical method for localized 1D Fermi-Hubbard systems on a quantum simulator [0.0]
  We show that a quantum simulator can be used to in-effect solve for the dynamics of a many-body system. We use a neutral-atom Fermi-Hubbard quantum simulator with $L_textexpsimeq290$ lattice sites to benchmark its performance. We derive a simple prediction of the behaviour of interacting Bloch oscillations for spin-imbalanced Fermi-Hubbard systems.
  arXiv  Detail & Related papers  (2021-05-13T16:03:11Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.