Efficient simulation of low-entanglement bosonic Gaussian states in polynomial time

• URL: http://arxiv.org/abs/2512.10643v1
• Date: Thu, 11 Dec 2025 13:51:03 GMT
• Title: Efficient simulation of low-entanglement bosonic Gaussian states in polynomial time
• Authors: Tong Liu, Hui-Ke Jin, Tao Xiang, Hong-Hao Tu,
• Abstract summary: We present an efficient algorithm that converts pure bosonic Gaussian states into matrix product states (MPSs)<n>Our method combines a Gaussian singular value decomposition with a projected-creation-operator mapping that constructs local MPS tensors without computing hafnians.<n>The method provides a scalable classical simulation framework for bosonic Gaussian states with limited entanglement and extends the applicability of MPS-based methods to a broad range of bosonic systems.
• Score: 21.876059213677966
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Bosonic Gaussian states appear ubiquitously in quantum optics and condensed matter physics but remain difficult to simulate classically due to the hafnian bottleneck. We present an efficient algorithm that converts pure bosonic Gaussian states into matrix product states (MPSs), with a computational cost governed solely by the entanglement and not by the number of bosonic modes. Our method combines a Gaussian singular value decomposition with a projected-creation-operator mapping that constructs local MPS tensors without computing hafnians. Benchmarking on covariance matrices from the Jiuzhang 2.0 and Jiuzhang 4.0 Gaussian boson sampling experiments demonstrates substantial speedups over previous tensor-network approaches in the low-entanglement regime relevant to lossy devices. The method provides a scalable classical simulation framework for bosonic Gaussian states with limited entanglement and extends the applicability of MPS-based methods to a broad range of bosonic systems.

Related papers

• Frozen Gaussian sampling algorithms for simulating Markovian open quantum systems in the semiclassical regime [4.655774822811101]
  This paper introduces an efficient Frozen Gaussian Sampling (FGS) algorithm based on the Wigner-Fokker-Planck phase-space formulation.<n>Its sampling error is independent of the semiclassical parameter $varepsilon$, thus breaking the prohibitive computational scaling faced by grid methods in the semiclassical limit.<n>We provide compelling numerical evidence for the existence of steady states in strongly non-harmonic potentials-a regime where rigorous analytical results are currently lacking.
  arXiv  Detail & Related papers  (2025-12-16T02:21:34Z)
• Matrix product state approach to lossy boson sampling and noisy IQP sampling [0.7066293026438526]
  We develop classical algorithms for lossy boson sampling and noisy instantaneous quantum-time sampling.<n>Our algorithm offers significantly improved control over the accuracy-efficiency trade-off.<n>It further extends the applicability of MPS simulation to broader classes of noisy quantum sampling models.
  arXiv  Detail & Related papers  (2025-10-28T07:23:10Z)
• Quartic quantum speedups for community detection [84.14713515477784]
  We develop a quantum algorithm for hypergraph community detection that achieves a quartic quantum speedup.<n>Our algorithm is based on the Kikuchi method, which we extend beyond previously considered problems such as PCA and $p$XORSAT.
  arXiv  Detail & Related papers  (2025-10-09T17:35:17Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• Classical simulation of circuits with realistic odd-dimensional Gottesman-Kitaev-Preskill states [37.54293136411193]
  We propose an algorithm to simulate circuits with encoded Gottesman-Kitaev-Preskill (GKP) states.<n>Our approach is tailored to be especially effective in the most challenging but practically relevant regime.
  arXiv  Detail & Related papers  (2024-12-17T18:00:28Z)
• Classical simulation and quantum resource theory of non-Gaussian optics [1.5554979526414525]
  We propose efficient algorithms for simulating measurements applied to non-Gaussian initial states.<n>The constructions are based on decomposing the non-Gaussian states into linear combinations of Gaussian states.<n>From the perspective of quantum resource theories, we investigate the properties of this type of non-Gaussianity measure and compute optimal decompositions for states relevant to continuous-variable quantum computing.
  arXiv  Detail & Related papers  (2024-04-10T15:53:41Z)
• Classical simulation of non-Gaussian bosonic circuits [0.4972323953932129]
  We propose efficient classical algorithms to simulate bosonic linear optics circuits applied to superpositions of Gaussian states. We present an exact simulation algorithm whose runtime is in the number of modes and the size of the circuit. We also present a faster approximate randomized algorithm whose runtime is quadratic in this number.
  arXiv  Detail & Related papers  (2024-03-27T23:52:35Z)
• Classical simulation of non-Gaussian fermionic circuits [0.4972323953932129]
  We argue that this problem is analogous to that of simulating Clifford circuits with non-stabilizer initial states. Our construction is based on an extension of the covariance matrix formalism which permits to efficiently track relative phases in superpositions of Gaussian states. It yields simulation algorithms with complexity in the number of fermions, the desired accuracy, and certain quantities capturing the degree of non-Gaussianity of the initial state.
  arXiv  Detail & Related papers  (2023-07-24T16:12:29Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Plug-And-Play Learned Gaussian-mixture Approximate Message Passing [71.74028918819046]
  We propose a plug-and-play compressed sensing (CS) recovery algorithm suitable for any i.i.d. source prior. Our algorithm builds upon Borgerding's learned AMP (LAMP), yet significantly improves it by adopting a universal denoising function within the algorithm. Numerical evaluation shows that the L-GM-AMP algorithm achieves state-of-the-art performance without any knowledge of the source prior.
  arXiv  Detail & Related papers  (2020-11-18T16:40:45Z)
• Local optimization on pure Gaussian state manifolds [63.76263875368856]
  We exploit insights into the geometry of bosonic and fermionic Gaussian states to develop an efficient local optimization algorithm. The method is based on notions of descent gradient attuned to the local geometry. We use the presented methods to collect numerical and analytical evidence for the conjecture that Gaussian purifications are sufficient to compute the entanglement of purification of arbitrary mixed Gaussian states.
  arXiv  Detail & Related papers  (2020-09-24T18:00:36Z)
• Efficient construction of tensor-network representations of many-body Gaussian states [59.94347858883343]
  We present a procedure to construct tensor-network representations of many-body Gaussian states efficiently and with a controllable error. These states include the ground and thermal states of bosonic and fermionic quadratic Hamiltonians, which are essential in the study of quantum many-body systems.
  arXiv  Detail & Related papers  (2020-08-12T11:30:23Z)

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.