Efficient construction of tensor-network representations of many-body Gaussian states

• URL: http://arxiv.org/abs/2008.05243v2
• Date: Mon, 31 Aug 2020 14:33:54 GMT
• Title: Efficient construction of tensor-network representations of many-body Gaussian states
• Authors: Alexander N\"u{\ss}eler, Ish Dhand, Susana F. Huelga, Martin B. Plenio
• Abstract summary: 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.
• Score: 59.94347858883343
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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. The procedure improves computational time requirements for constructing many-body Gaussian states by up to five orders of magnitude for reasonable parameter values, thus allowing simulations beyond the range of what was hitherto feasible. Our procedure combines ideas from the theory of Gaussian quantum information with tensor-network based numerical methods thereby opening the possibility of exploiting the rich tool-kit of Gaussian methods in tensor-network simulations.

Related papers

• Efficient Hamiltonian, structure and trace distance learning of Gaussian states [2.949446809950691]
  We show that it is possible to learn the underlying interaction graph in a similar setting and sample complexity. Our results put the status of the quantum Hamiltonian learning problem for continuous variable systems in a much more advanced state.
  arXiv  Detail & Related papers  (2024-11-05T15:07:20Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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)
• 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)
• QuGIT: a numerical toolbox for Gaussian quantum states [0.0]
  QuGIT is a python numerical toolbox based on symplectic methods specialized in efficiently simulating multimode Gaussian states and operations. It provides a wide range of Gaussian operations on arbitrary Gaussian states, including unitaries, partial traces, tensor products, general-dyne measurements, conditional and unconditional dynamics.
  arXiv  Detail & Related papers  (2022-01-17T11:58:14Z)
• 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)
• Vector-valued Gaussian Processes on Riemannian Manifolds via Gauge Equivariant Projected Kernels [108.60991563944351]
  We present a recipe for constructing gauge equivariant kernels, which induce vector-valued Gaussian processes coherent with geometry. We extend standard Gaussian process training methods, such as variational inference, to this setting.
  arXiv  Detail & Related papers  (2021-10-27T13:31:10Z)
• 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)
• Simple heuristics for efficient parallel tensor contraction and quantum circuit simulation [1.4416132811087747]
  We propose a parallel algorithm for the contraction of tensor networks using probabilistic models. We apply the resulting algorithm to the simulation of random quantum circuits.
  arXiv  Detail & Related papers  (2020-04-22T23:00:42Z)

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.