Algorithm for initializing a generalized fermionic Gaussian state on a quantum computer

• URL: http://arxiv.org/abs/2105.13047v2
• Date: Tue, 3 Aug 2021 08:24:50 GMT
• Title: Algorithm for initializing a generalized fermionic Gaussian state on a quantum computer
• Authors: Michael P. Kaicher, Simon B. J\"ager, Frank K. Wilhelm
• Abstract summary: We present explicit expressions for the central piece of a variational method developed by Shi et al. We derive iterative analytical expressions for the evaluation of expectation values of products of fermionic creation and subroutine operators. We present a simple gradient-descent-based algorithm that can be used as an optimization in combination with imaginary time evolution.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present explicit expressions for the central piece of a variational method developed by Shi et al. which extends variational wave functions that are efficiently computable on classical computers beyond mean-field to generalized Gaussian states [1]. In particular, we derive iterative analytical expressions for the evaluation of expectation values of products of fermionic creation and annihilation operators in a Grassmann variable-free representation. Using this result we find a closed expression for the energy functional and its gradient of a general fermionic quantum many-body Hamiltonian. We present a simple gradient-descent-based algorithm that can be used as an optimization subroutine in combination with imaginary time evolution, which by construction guarantees a monotonic decrease of the energy in each iteration step. Due to the simplicity of the quantum circuit implementing the variational state Ansatz, the results of the algorithms discussed here and in [1] could serve as an improved, beyond mean-field initial state in quantum computation. [1] Tao Shi, Eugene Demler, and J. Ignacio Cirac. Variational study of fermionic and bosonic systems with non-gaussian states: Theory and applications. Annals of Physics, 390: 245-302, 2018.

Related papers

• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Quantum Simulation of Nonlinear Dynamical Systems Using Repeated Measurement [42.896772730859645]
  We present a quantum algorithm based on repeated measurement to solve initial-value problems for nonlinear ordinary differential equations. We apply this approach to the classic logistic and Lorenz systems in both integrable and chaotic regimes.
  arXiv  Detail & Related papers  (2024-10-04T18:06:12Z)
• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• Quantum-Assisted Hilbert-Space Gaussian Process Regression [0.0]
  We propose a space approximation-based quantum algorithm for Gaussian process regression. Our method consists of a combination of classical basis function expansion with quantum computing techniques.
  arXiv  Detail & Related papers  (2024-02-01T12:13:35Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• 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)
• Quantum gradient descent algorithms for nonequilibrium steady states and linear algebraic systems [0.17188280334580192]
  gradient descent is a key ingredient in variational quantum algorithms and machine learning tasks. We present approaches to simulate the nonequilibrium steady states of Markovian open quantum many-body systems. We adapt the quantum gradient descent algorithm to solve linear algebra problems including linear systems of equations and matrix-vector multiplications.
  arXiv  Detail & Related papers  (2022-04-15T01:20:33Z)
• Using gradient-based algorithms to determine ground state energies on a quantum computer [0.0]
  Variational algorithms are promising candidates to be implemented on near-term quantum computers. We study how different methods for obtaining the gradient, specifically the finite-difference and the parameter-shift rule, are affected by shot noise and noise of the quantum computer.
  arXiv  Detail & Related papers  (2021-09-17T09:12:43Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• 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)
• Measuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule [0.0]
  We study the problem of estimating the gradient of the function to be optimized directly from quantum measurements. We derive a mathematically exact formula that provides an algorithm for estimating the gradient of any multi-qubit parametric quantum evolution. Our algorithm continues to work, although with some approximations, even when all the available quantum gates are noisy.
  arXiv  Detail & Related papers  (2020-05-20T18:24:11Z)

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.