Variational quantum Gibbs state preparation with a truncated Taylor series

• URL: http://arxiv.org/abs/2005.08797v2
• Date: Sun, 21 Nov 2021 01:52:46 GMT
• Title: Variational quantum Gibbs state preparation with a truncated Taylor series
• Authors: Youle Wang, Guangxi Li, Xin Wang
• Abstract summary: 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.
• Score: 8.467503414303637
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The preparation of quantum Gibbs state is an essential part of quantum computation and has wide-ranging applications in various areas, including quantum simulation, quantum optimization, and quantum machine learning. In this paper, we propose variational hybrid quantum-classical algorithms for quantum Gibbs state preparation. We first utilize a truncated Taylor series to evaluate the free energy and choose the truncated free energy as the loss function. Our protocol then trains the parameterized quantum circuits to learn the desired quantum Gibbs state. Notably, this algorithm can be implemented on near-term quantum computers equipped with parameterized quantum circuits. By performing numerical experiments, we show that shallow parameterized circuits with only one additional qubit can be trained to prepare the Ising chain and spin chain Gibbs states with a fidelity higher than 95%. In particular, for the Ising chain model, we find that a simplified circuit ansatz with only one parameter and one additional qubit can be trained to realize a 99% fidelity in Gibbs state preparation at inverse temperatures larger than 2.

Related papers

• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem. We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions. We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Quantum Thermal State Preparation [39.91303506884272]
  We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations. We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states. Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
  arXiv  Detail & Related papers  (2023-03-31T17:29:56Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Generating Approximate Ground States of Molecules Using Quantum Machine Learning [2.1286051580524523]
  We propose using a generative quantum machine learning model to prepare quantum states at arbitrary points on the potential energy surface. Our approach uses a classical neural network to convert the nuclear coordinates of a molecule into quantum parameters of a variational quantum circuit. We show that gradient evaluation is efficient and numerically demonstrate our method's ability to prepare wavefunctions on the PES of hydrogen chains, water, and beryllium hydride.
  arXiv  Detail & Related papers  (2022-10-11T14:45:07Z)
• An Amplitude-Based Implementation of the Unit Step Function on a Quantum Computer [0.0]
  We introduce an amplitude-based implementation for approximating non-linearity in the form of the unit step function on a quantum computer. We describe two distinct circuit types which receive their input either directly from a classical computer, or as a quantum state when embedded in a more advanced quantum algorithm.
  arXiv  Detail & Related papers  (2022-06-07T07:14:12Z)
• Natural parameterized quantum circuit [0.0]
  We introduce the natural parameterized quantum circuit (NPQC) that can be initialised with a Euclidean quantum geometry. For a general class of quantum circuits, the NPQC has the minimal quantum Cram'er-Rao bound. Our results can be used to enhance currently available quantum processors.
  arXiv  Detail & Related papers  (2021-07-29T14:54:04Z)
• 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.