Classical simulation and quantum resource theory of non-Gaussian optics

• URL: http://arxiv.org/abs/2404.07115v1
• Date: Wed, 10 Apr 2024 15:53:41 GMT
• Title: Classical simulation and quantum resource theory of non-Gaussian optics
• Authors: Oliver Hahn, Ryuji Takagi, Giulia Ferrini, Hayata Yamasaki,
• Abstract summary: 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.
• Score: 1.3124513975412255
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose efficient algorithms for classically simulating Gaussian unitaries and measurements applied to non-Gaussian initial states. The constructions are based on decomposing the non-Gaussian states into linear combinations of Gaussian states. We use an extension of the covariance matrix formalism to efficiently track relative phases in the superpositions of Gaussian states. We get an exact simulation that scales quadratically with the number of Gaussian states required to represent the initial state and an approximate simulation algorithm that scales linearly with the degree. We define measures of non-Gaussianty quantifying this simulation cost, which we call the Gaussian rank and the Gaussian extent. 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.

Related papers

• 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)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• 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)
• Gaussian decomposition of magic states for matchgate computations [0.0]
  Magic states, pivotal for universal quantum computation via classically simulable Clifford gates, often undergo decomposition into resourceless stabilizer states. This approach yields three operationally significant metrics: stabilizer rank, fidelity, and extent. We extend these simulation methods to encompass matchgate circuits (MGCs), and define equivalent metrics for this setting.
  arXiv  Detail & Related papers  (2023-07-24T09:52:53Z)
• Matched entanglement witness criteria for continuous variables [11.480994804659908]
  We use quantum entanglement witnesses derived from Gaussian operators to study the separable criteria of continuous variable states. This opens a way for precise detection of non-Gaussian entanglement.
  arXiv  Detail & Related papers  (2022-08-26T03:45:00Z)
• Deterministic Gaussian conversion protocols for non-Gaussian single-mode resources [58.720142291102135]
  We show that cat and binomial states are approximately equivalent for finite energy, while this equivalence was previously known only in the infinite-energy limit. We also consider the generation of cat states from photon-added and photon-subtracted squeezed states, improving over known schemes by introducing additional squeezing operations.
  arXiv  Detail & Related papers  (2022-04-07T11:49:54Z)
• 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)
• 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.