Variational Quantum Algorithms for Gibbs State Preparation
- URL: http://arxiv.org/abs/2305.17713v2
- Date: Sun, 15 Oct 2023 14:17:00 GMT
- Title: Variational Quantum Algorithms for Gibbs State Preparation
- Authors: Mirko Consiglio
- Abstract summary: We provide a concise overview of the algorithms capable of preparing Gibbs states.
We also perform a benchmark of one of the latest variational Gibbs state preparation algorithms.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Preparing the Gibbs state of an interacting quantum many-body system on noisy
intermediate-scale quantum (NISQ) devices is a crucial task for exploring the
thermodynamic properties in the quantum regime. It encompasses understanding
protocols such as thermalization and out-of-equilibrium thermodynamics, as well
as sampling from faithfully prepared Gibbs states could pave the way to
providing useful resources for quantum algorithms. Variational quantum
algorithms (VQAs) show the most promise in effciently preparing Gibbs states,
however, there are many different approaches that could be applied to
effectively determine and prepare Gibbs states on a NISQ computer. In this
paper, we provide a concise overview of the algorithms capable of preparing
Gibbs states, including joint Hamiltonian evolution of a system-environment
coupling, quantum imaginary time evolution, and modern VQAs utilizing the
Helmholtz free energy as a cost function, among others. Furthermore, we perform
a benchmark of one of the latest variational Gibbs state preparation
algorithms, developed by Consiglio et al. (arXiv:2303.11276), by applying it to
the spin 1/2 one-dimensional $XY$ model.
Related papers
- Many-body thermal states on a quantum computer: a variational approach [0.0]
We present a hybrid quantum--classical variational quantum algorithm for the preparation of the Gibbs state of the quantum $XY$ model.
We show how the symmetries of a many-body system can be exploited to significantly reduce the exponentially increasing number of variational parameters needed in the Grover and Rudolph algorithm.
arXiv Detail & Related papers (2024-06-11T19:54:59Z) - Quantum Semidefinite Programming with Thermal Pure Quantum States [0.5639904484784125]
We show that a quantization'' of the matrix multiplicative-weight algorithm can provide approximate solutions to SDPs quadratically faster than the best classical algorithms.
We propose a modification of this quantum algorithm and show that a similar speedup can be obtained by replacing the Gibbs-state sampler with the preparation of thermal pure quantum (TPQ) states.
arXiv Detail & Related papers (2023-10-11T18:00:53Z) - Calculating the many-body density of states on a digital quantum
computer [58.720142291102135]
We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer.
We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
arXiv Detail & Related papers (2023-03-23T17:46:28Z) - Variational Gibbs State Preparation on NISQ devices [1.6600832946471173]
We propose a variational quantum algorithm (VQA) to prepare Gibbs states of a quantum many-body system.
The novelty of our VQA consists in implementing a parameterized quantum circuit acting on two distinct, yet connected, quantum registers.
We benchmark our VQA by preparing Gibbs states of the transverse field Ising and Heisenberg XXZ models and achieve remarkably high fidelities.
arXiv Detail & Related papers (2023-03-20T17:09:34Z) - TeD-Q: a tensor network enhanced distributed hybrid quantum machine
learning framework [59.07246314484875]
TeD-Q is an open-source software framework for quantum machine learning.
It seamlessly integrates classical machine learning libraries with quantum simulators.
It provides a graphical mode in which the quantum circuit and the training progress can be visualized in real-time.
arXiv Detail & Related papers (2023-01-13T09:35:05Z) - Towards Neural Variational Monte Carlo That Scales Linearly with System
Size [67.09349921751341]
Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors.
The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems.
We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
arXiv Detail & Related papers (2022-12-21T19:00:04Z) - Adaptive variational algorithms for quantum Gibbs state preparation [0.0]
We introduce an objective function that, unlike the free energy, is easily measured, and (ii) using dynamically generated, problem-tailored ans"atze.
This allows for arbitrarily accurate Gibbs state preparation using low-depth circuits.
We numerically demonstrate that our algorithm can prepare high-fidelity Gibbs states across a broad range of temperatures and for a variety of Hamiltonians.
arXiv Detail & Related papers (2022-03-23T22:54:19Z) - From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions.
For its practicability and wide-applicability, we give a brief review of typical graph learning techniques.
We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
arXiv Detail & Related papers (2022-02-19T02:56:47Z) - 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) - 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) - A Variational Quantum Algorithm for Preparing Quantum Gibbs States [0.22559617939136506]
Preparation of Gibbs distributions is an important task for quantum computation.
We present a variational approach to preparing Gibbs states that is based on minimizing the free energy of a quantum system.
arXiv Detail & Related papers (2020-01-31T20:52:50Z)
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.