Classical simulation of non-Gaussian bosonic circuits

• URL: http://arxiv.org/abs/2403.19059v1
• Date: Wed, 27 Mar 2024 23:52:35 GMT
• Title: Classical simulation of non-Gaussian bosonic circuits
• Authors: Beatriz Dias, Robert Koenig,
• Abstract summary: 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.
• Score: 0.4972323953932129
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose efficient classical algorithms which (strongly) simulate the action of bosonic linear optics circuits applied to superpositions of Gaussian states. Our approach relies on an augmented covariance matrix formalism to keep track of relative phases between individual terms in a linear combination. This yields an exact simulation algorithm whose runtime is polynomial in the number of modes and the size of the circuit, and quadratic in the number of terms in the superposition. We also present a faster approximate randomized algorithm whose runtime is linear in this number. Our main building blocks are a formula for the triple overlap of three Gaussian states and a fast algorithm for estimating the norm of a superposition of Gaussian states up to a multiplicative error. Our construction borrows from earlier work on simulating quantum circuits in finite-dimensional settings, including, in particular, fermionic linear optics with non-Gaussian initial states and Clifford computations with non-stabilizer initial states. It provides algorithmic access to a practically relevant family of non-Gaussian bosonic circuits.

Related papers

• Classical simulation and quantum resource theory of non-Gaussian optics [1.3124513975412255]
  We propose efficient algorithms for simulating Gaussian unitaries and measurements applied to non-Gaussian initial states. From the perspective of quantum resource theories, we investigate the properties of this type of non-Gaussianity measure and compute optimal decomposition for states relevant to continuous-variable quantum computing.
  arXiv  Detail & Related papers  (2024-04-10T15:53:41Z)
• Classical modelling of a lossy Gaussian bosonic sampler [0.0]
  We propose an algorithm for approximate classical simulation of a lossy GBS instance. The complexity of the algorithm is squeezing the number of modes given the number of terms is fixed. In recent experiments that claim to have demonstrated quantum advantage, these conditions are satisfied.
  arXiv  Detail & Related papers  (2024-04-01T09:19:27Z)
• 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 Markovian open quantum systems using higher-order series expansion [1.713291434132985]
  We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum systems. Our algorithm is conceptually cleaner, and it only uses simple quantum primitives without compressed encoding.
  arXiv  Detail & Related papers  (2022-12-05T06:02:50Z)
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits [68.8204255655161]
  We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems can be employed to assess the simulatability.
  arXiv  Detail & Related papers  (2022-03-21T17:57:02Z)
• High-Dimensional Sparse Bayesian Learning without Covariance Matrices [66.60078365202867]
  We introduce a new inference scheme that avoids explicit construction of the covariance matrix. Our approach couples a little-known diagonal estimation result from numerical linear algebra with the conjugate gradient algorithm. On several simulations, our method scales better than existing approaches in computation time and memory.
  arXiv  Detail & Related papers  (2022-02-25T16:35:26Z)
• Quantum Gaussian process regression [3.4501155479285326]
  The proposed quantum algorithm consists of three sub-algorithms. One is the first quantum subalgorithm to efficiently generate mean predictor. The other is to product covariance predictor with same method.
  arXiv  Detail & Related papers  (2021-06-12T07:03:27Z)
• 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)
• 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)
• Optimal Randomized First-Order Methods for Least-Squares Problems [56.05635751529922]
  This class of algorithms encompasses several randomized methods among the fastest solvers for least-squares problems. We focus on two classical embeddings, namely, Gaussian projections and subsampled Hadamard transforms. Our resulting algorithm yields the best complexity known for solving least-squares problems with no condition number dependence.
  arXiv  Detail & Related papers  (2020-02-21T17:45:32Z)
• 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.