Variational methods for solving high dimensional quantum systems

• URL: http://arxiv.org/abs/2404.11490v1
• Date: Wed, 17 Apr 2024 15:46:27 GMT
• Title: Variational methods for solving high dimensional quantum systems
• Authors: Daming Li,
• Abstract summary: We explore the effectiveness of three variational methods for solving high-dimensional quantum systems. We apply these methods to two different quantum systems: the fermi-Hubbard model in condensed matter physics and the Schwinger model in high energy physics. We calculate the ground state of both quantum systems and compare the results obtained using the three variational methods.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Variational methods are highly valuable computational tools for solving high-dimensional quantum systems. In this paper, we explore the effectiveness of three variational methods: the density matrix renormalization group (DMRG), Boltzmann machine learning, and the variational quantum eigensolver (VQE). We apply these methods to two different quantum systems: the fermi-Hubbard model in condensed matter physics and the Schwinger model in high energy physics. To facilitate the computations on quantum computers, we map each model to a spin 1/2 system using the Jordan-Wigner transformation. This transformation allows us to take advantage of the capabilities of quantum computing. We calculate the ground state of both quantum systems and compare the results obtained using the three variational methods. By doing so, we aim to demonstrate the power and effectiveness of these variational approaches in tackling complex quantum systems.

Related papers

• Matrix Product State on a Quantum Computer [15.440058554596591]
  We propose the quantum version of matrix product state (qMPS), and develop variational quantum algorithms to prepare it in canonical forms.<n>Compared with widely used methods such as variational quantum eigensolver, this method can greatly reduce the number of qubits used in local optimization.<n>Our method holds promise for distributed quantum computing, offering possibilities for fusion of different computing systems.
  arXiv  Detail & Related papers  (2025-06-10T03:06:59Z)
• Quantum algorithms for solving a drift-diffusion equation [0.0]
  We present three quantum algorithms for solving a drift-diffusion equation.<n>They rely on a quantum linear system solver, a quantum random walk, and the quantum Fourier transform.
  arXiv  Detail & Related papers  (2025-05-27T14:09:14Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Implicit differentiation of variational quantum algorithms [0.8594140167290096]
  We show how to leverage implicit differentiation for computation through variational quantum algorithms. We explore applications in condensed matter physics, quantum machine learning, and quantum information.
  arXiv  Detail & Related papers  (2022-11-24T19:00:19Z)
• Quantum computing with differentiable quantum transforms [0.0]
  We present a framework for differentiable quantum transforms. Such transforms are metaprograms capable of manipulating quantum programs in a way that preserves their differentiability. We highlight their potential with a set of relevant examples across quantum computing.
  arXiv  Detail & Related papers  (2022-02-27T18:11:55Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• 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)
• Variational Quantum Eigensolver for SU($N$) Fermions [0.0]
  Variational quantum algorithms aim at harnessing the power of noisy intermediate-scale quantum computers. We apply the variational quantum eigensolver to study the ground-state properties of $N$-component fermions. Our approach lays out the basis for a current-based quantum simulator of many-body systems.
  arXiv  Detail & Related papers  (2021-06-29T16:39:30Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Quantum Algorithms for Solving Ordinary Differential Equations via Classical Integration Methods [1.802439717192088]
  We explore utilizing quantum computers for the purpose of solving differential equations. We devise and simulate corresponding digital quantum circuits, and implement and run a 6$mathrmth$ order Gauss-Legendre collocation method. As promising future scenario, the digital arithmetic method could be employed as an "oracle" within quantum search algorithms for inverse problems.
  arXiv  Detail & Related papers  (2020-12-17T09:49:35Z)
• Solving Quantum Master Equations with Deep Quantum Neural Networks [0.0]
  We use deep quantum feedforward neural networks capable of universal quantum computation to represent the mixed states for open quantum many-body systems. Owning to the special structure of the quantum networks, this approach enjoys a number of notable features, including the absence of barren plateaus.
  arXiv  Detail & Related papers  (2020-08-12T18:00:08Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

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.