Adaptive variational algorithms for quantum Gibbs state preparation
- URL: http://arxiv.org/abs/2203.12757v1
- Date: Wed, 23 Mar 2022 22:54:19 GMT
- Title: Adaptive variational algorithms for quantum Gibbs state preparation
- Authors: Ada Warren, Linghua Zhu, Nicholas J. Mayhall, Edwin Barnes, Sophia E.
Economou
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The preparation of Gibbs thermal states is an important task in quantum
computation with applications in quantum simulation, quantum optimization, and
quantum machine learning. However, many algorithms for preparing Gibbs states
rely on quantum subroutines which are difficult to implement on near-term
hardware. Here, we address this by (i) introducing 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. To verify the effectiveness
of our approach, we numerically demonstrate that our algorithm can prepare
high-fidelity Gibbs states across a broad range of temperatures and for a
variety of Hamiltonians.
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) - Variational Quantum Algorithms for Gibbs State Preparation [0.0]
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.
arXiv Detail & Related papers (2023-05-28T12:47:29Z) - 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) - 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 practical potentials of quantum auto-encoder with
advantages [92.19792304214303]
Quantum auto-encoder (QAE) is a powerful tool to relieve the curse of dimensionality encountered in quantum physics.
We prove that QAE can be used to efficiently calculate the eigenvalues and prepare the corresponding eigenvectors of a high-dimensional quantum state.
We devise three effective QAE-based learning protocols to solve the low-rank state fidelity estimation, the quantum Gibbs state preparation, and the quantum metrology tasks.
arXiv Detail & Related papers (2021-06-29T14:01:40Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - 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) - Variational quantum Gibbs state preparation with a truncated Taylor
series [8.467503414303637]
We propose variational hybrid quantum-classical algorithms for quantum Gibbs state preparation.
Notably, this algorithm can be implemented on near-term quantum computers equipped with parameterized quantum circuits.
arXiv Detail & Related papers (2020-05-18T15:17:09Z) - 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.