Solving the homogeneous Bethe-Salpeter equation with a quantum annealer

• URL: http://arxiv.org/abs/2406.18669v2
• Date: Fri, 30 Aug 2024 14:17:02 GMT
• Title: Solving the homogeneous Bethe-Salpeter equation with a quantum annealer
• Authors: Filippo Fornetti, Alex Gnech, Tobias Frederico, Francesco Pederiva, Matteo Rinaldi, Alessandro Roggero, Giovanni Salme', Sergio Scopetta, Michele Viviani,
• Abstract summary: The homogeneous Bethe-Salpeter equation (hBSE) was solved for the first time by using a D-Wave quantum annealer. A broad numerical analysis of the proposed algorithms was carried out using both the proprietary simulated-anneaing package and the D-Wave Advantage 4.1 system.
• Score: 34.173566188833156
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The homogeneous Bethe-Salpeter equation (hBSE), describing a bound system in a genuinely relativistic quantum-field theory framework, was solved for the first time by using a D-Wave quantum annealer. After applying standard techniques of discretization, the hBSE, in ladder approximation, can be formally transformed in a generalized eigenvalue problem (GEVP), with two square matrices: one symmetric and the other non symmetric. The latter matrix poses the challenge of obtaining a suitable formal approach for investigating the non symmetric GEVP by means of a quantum annealer, i.e to recast it as a quadratic unconstrained binary optimization problem. A broad numerical analysis of the proposed algorithms, applied to matrices of dimension up to 64, was carried out by using both the proprietary simulated-anneaing package and the D-Wave Advantage 4.1 system. The numerical results very nicely compare with those obtained with standard classical algorithms, and also show interesting scalability features.

Related papers

• Optimizing Unitary Coupled Cluster Wave Functions on Quantum Hardware: Error Bound and Resource-Efficient Optimizer [0.0]
  We study the projective quantum eigensolver (PQE) approach to optimizing unitary coupled cluster wave functions on quantum hardware. The algorithm uses projections of the Schr"odinger equation to efficiently bring the trial state closer to an eigenstate of the Hamiltonian. We present numerical evidence of superiority over both the optimization introduced in arXiv:2102.00345 and VQE optimized using the Broyden Fletcher Goldfarb Shanno (BFGS) method.
  arXiv  Detail & Related papers  (2024-10-19T15:03:59Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• Efficient classical algorithms for simulating symmetric quantum systems [4.416367445587541]
  We show that classical algorithms can efficiently emulate quantum counterparts given certain classical descriptions of the input. Specifically, we give classical algorithms that calculate ground states and time-evolved expectation values for permutation-invariantians specified in the symmetrized Pauli basis.
  arXiv  Detail & Related papers  (2022-11-30T13:53:16Z)
• Manifold Gaussian Variational Bayes on the Precision Matrix [70.44024861252554]
  We propose an optimization algorithm for Variational Inference (VI) in complex models. We develop an efficient algorithm for Gaussian Variational Inference whose updates satisfy the positive definite constraint on the variational covariance matrix. Due to its black-box nature, MGVBP stands as a ready-to-use solution for VI in complex models.
  arXiv  Detail & Related papers  (2022-10-26T10:12:31Z)
• Preentangling Quantum Algorithms -- the Density Matrix Renormalization Group-assisted Quantum Canonical Transformation [0.0]
  We propose the use of parameter-free preentanglers as initial states for quantum algorithms. We find this strategy to require significantly less parameters than corresponding generalized unitary coupled cluster circuits.
  arXiv  Detail & Related papers  (2022-09-15T07:35:21Z)
• Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization [44.96576908957141]
  We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linear iterations problems on quantum computers.
  arXiv  Detail & Related papers  (2022-03-23T18:00:03Z)
• Bernstein-Greene-Kruskal approach for the quantum Vlasov equation [91.3755431537592]
  The one-dimensional stationary quantum Vlasov equation is analyzed using the energy as one of the dynamical variables. In the semiclassical case where quantum tunneling effects are small, an infinite series solution is developed.
  arXiv  Detail & Related papers  (2021-02-18T20:55:04Z)
• Simulating Many-Body Systems with a Projective Quantum Eigensolver [0.0]
  We present a new hybrid quantum-classical algorithm for optimizing unitary coupled-cluster wave functions. We also introduce a selected variant of PQE (SPQE) that uses an adaptive ansatz built from arbitrary-order particle-hole operators.
  arXiv  Detail & Related papers  (2021-01-31T00:31:12Z)
• The quantum marginal problem for symmetric states: applications to variational optimization, nonlocality and self-testing [0.0]
  We present a method to solve the quantum marginal problem for symmetric $d$-level systems. We illustrate the applicability of the method in central quantum information problems with several exemplary case studies.
  arXiv  Detail & Related papers  (2020-01-13T18:20:53Z)

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.