Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems

• URL: http://arxiv.org/abs/2604.19625v1
• Date: Tue, 21 Apr 2026 16:13:57 GMT
• Title: Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
• Abstract summary: We introduce coherent-state propagation, a computational framework for simulating bosonic systems.<n>We focus on bosonic circuits composed of linear optics augmented by Kerr nonlinearities.<n>The method works in the Schrdinger picture representing the evolving state as a superposition of coherent states.
• Score: 1.1666234644810893
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce coherent-state propagation, a computational framework for simulating bosonic systems. We focus on bosonic circuits composed of displaced linear optics augmented by Kerr nonlinearities, a universal model of bosonic quantum computation that is also physically motivated by driven Bose-Hubbard dynamics. The method works in the Schrödinger picture representing the evolving state as a sparse superposition of coherent states. We develop approximation strategies that keep the simulation cost tractable in physically relevant regimes, notably when the number of Kerr gates is small or the Kerr nonlinearities are weak, and prove rigorous guarantees for both observable estimation and sampling. In particular, bosonic circuits with logarithmically many Kerr gates admit quasi-polynomial-time classical simulation at exponentially small error in trace distance. We further identify a weak-nonlinearity regime in which the runtime is polynomial for arbitrarily small constant precision. We complement these results with numerical benchmarks on the Bose-Hubbard model with all-to-all connectivity. The method reproduces Fock-basis and matrix-product-state reference data, suggesting that it offers a useful route to the classical simulation of bosonic systems.

Related papers

• Exponentially-improved effective descriptions of physical bosonic systems [0.0]
  An effective description of a bosonic quantum system identifies the minimum finite dimension required to capture its essential dynamics.<n>This effective dimension plays an important role in the complexity of classical and quantum algorithms for learning and simulating bosonic systems.<n>We show that physical bosonic systems are significantly more well-behaved than previously assumed, allowing for efficient descriptions even at high precision.
  arXiv  Detail & Related papers  (2026-04-20T18:20:13Z)
• Quantum algorithm for dephasing of coupled systems: decoupling and IQP duality [0.0]
  We introduce a quantum algorithm for simulating unital Lindbladian dynamics by sampling unitary quantum channels without extra ancillas.<n>We show that this algorithm allows approximating general Lindbladians as well.<n>We demonstrate our approach by studying a model of bosons coupled to fermions via dephasing, which naturally arises from anharmonic effects in an electron-phonon system coupled to a bath.
  arXiv  Detail & Related papers  (2026-01-09T20:24:49Z)
• A time-marching quantum algorithm for simulation of the nonlinear Lorenz dynamics [0.0]
  We develop a quantum algorithm that implements the time evolution of a second order time-discretized version of the Lorenz model.<n> Notably, we showcase that it accurately captures the structural characteristics of the Lorenz system.
  arXiv  Detail & Related papers  (2025-06-26T15:08:00Z)
• Classical simulation of parity-preserving quantum circuits [0.0]
  We present a classical simulation method for fermionic quantum systems without loss of generality.<n>We map such circuits to a fermionic tensor network and introduce a novel decomposition of non-Matchgate gates.<n>Our algorithm significantly lowers resource requirements for simulating parity-preserving circuits while retaining high accuracy.
  arXiv  Detail & Related papers  (2025-04-27T17:42:39Z)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• Efficient measurement schemes for bosonic systems [1.4781921087738965]
  Boson is one of the most basic particles and preserves the commutation relation. We numerically test the schemes for measuring nuclei vibrations simulated using a discrete quantum computer.
  arXiv  Detail & Related papers  (2022-10-24T20:14:23Z)
• 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)
• Designing Kerr Interactions for Quantum Information Processing via Counterrotating Terms of Asymmetric Josephson-Junction Loops [68.8204255655161]
  static cavity nonlinearities typically limit the performance of bosonic quantum error-correcting codes. Treating the nonlinearity as a perturbation, we derive effective Hamiltonians using the Schrieffer-Wolff transformation. Results show that a cubic interaction allows to increase the effective rates of both linear and nonlinear operations.
  arXiv  Detail & Related papers  (2021-07-14T15:11:05Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• 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.