Fast simulations of continuous-variable circuits using the coherent state decomposition

• URL: http://arxiv.org/abs/2508.06175v1
• Date: Fri, 08 Aug 2025 09:44:58 GMT
• Title: Fast simulations of continuous-variable circuits using the coherent state decomposition
• Authors: Olga Solodovnikova, Ulrik L. Andersen, Jonas S. Neergaard-Nielsen,
• Abstract summary: We present ttexttlcg_plus, an open-source Python library for the simulation of continuous-variable quantum circuits.<n>Our framework merges the linear combination of Gaussians methodology with the coherent state decomposition of arbitrary non-Gaussian states.<n>We demonstrate the utility of this methodology by optimizing the heralded preparation of a qunaught state, a crucial component for building a fault-tolerant photonic quantum computer.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present \texttt{lcg\_plus}, an open-source Python library for the simulation of continuous-variable quantum circuits with both generaldyne and photon-number-resolving detector capabilities. Our framework merges the linear combination of Gaussians methodology with the coherent state decomposition of arbitrary non-Gaussian states, forming a bridge between the Gaussian and Fock basis representations. By tracking the Wigner function, we can simulate the action of Gaussian channels and measurements on multi-mode systems in a fast and accurate numerical framework. The calculation of the quality measures of quantum states is convenient in this formalism, and we derive expressions for the analytical gradients of these measures with respect to parameterized circuit elements. We demonstrate the utility of this methodology by optimizing the heralded preparation of a qunaught state, a crucial component for building a fault-tolerant photonic quantum computer, with a Gaussian Boson sampling circuit containing inefficient components.

Related papers

• Symbolic Pauli Propagation for Gradient-Enabled Pre-Training of Quantum Circuits [0.0]
  Quantum Machine Learning models typically require expensive on-chip training procedures and often lack efficient gradient estimation methods.<n>By employing Pauli propagation, it is possible to derive a symbolic representation of observables as analytic functions of a circuit's parameters.<n>The proposed approach is demonstrated on the Variational Quantum Eigensolver for obtaining the ground state of a spin model.
  arXiv  Detail & Related papers  (2025-12-18T15:44:07Z)
• 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)
• Harmonic Path Integral Diffusion [0.4527270266697462]
  We present a novel approach for sampling from a continuous multivariate probability distribution, which may either be explicitly known (up to a normalization factor) or represented via empirical samples. Our method constructs a time-dependent bridge from a delta function centered at the origin of the state space at $t=0$, transforming it into the target distribution at $t=1$. We contrast these algorithms with other sampling methods, particularly simulated and path integral sampling, highlighting their advantages in terms of analytical control, accuracy, and computational efficiency.
  arXiv  Detail & Related papers  (2024-09-23T16:20:21Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Characterization of variational quantum algorithms using free fermions [0.0]
  We numerically study the interplay between these symmetries and the locality of the target state. We find that the number of iterations to converge to the solution scales linearly with system size.
  arXiv  Detail & Related papers  (2022-06-13T18:11:16Z)
• The vacuum provides quantum advantage to otherwise simulatable architectures [49.1574468325115]
  We consider a computational model composed of ideal Gottesman-Kitaev-Preskill stabilizer states. We provide an algorithm to calculate the probability density function of the measurement outcomes.
  arXiv  Detail & Related papers  (2022-05-19T18:03:17Z)
• Taming numerical errors in simulations of continuous variable non-Gaussian state preparation [1.2891210250935146]
  A powerful instrument for such simulation is the numerical computation in the Fock state representation. We analyze the accuracy of several currently available methods for computation of the truncated coherent displacement operator. We then employ the method in analysis of non-Gaussian state preparation scheme based on coherent displacement of a two mode squeezed vacuum with subsequent photon counting measurement.
  arXiv  Detail & Related papers  (2022-02-15T11:41:57Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)
• 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)

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.