Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction

• URL: http://arxiv.org/abs/2310.07617v2
• Date: Thu, 18 Jul 2024 11:03:03 GMT
• Title: Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction
• Authors: Ivan Medina, Alexandre Drinko, Guilherme I. Correr, Pedro C. Azado, Diogo O. Soares-Pinto,
• Abstract summary: 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.
• Score: 39.58317527488534
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries (QB). In this context, one of the main figures of merit is the ergotropy, which measures the maximal amount of energy (as work) that can be extracted from the quantum source by means of unitary operations. 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. This assumption, in general, fails in practice since the operations that can be done are limited and depend on the quantum hardware (experimental platform) one has available. In this work, we propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm. In this approach, we explicitly take into account a limited set of unitaries by using the hardware efficient asatz (HEA) class of parameterized quantum circuits. As a QB we use an one-dimensional spin chain described by a family of paradigmatic first neighbor Hamiltonians such as the $XXX$,$XXZ$, $XYZ$, $XX$, $XY$ and transverse Ising models. By building our parameterized quantum circuits assuming that different types of connectivity may be available depending on the quantum hardware, we numerically compare the efficiency of work extraction for each model. Our results show that the best efficiency is generally obtained with quantum circuits that have connectivity between first neighbor spins.

Related papers

• Quantum circuit for multi-qubit Toffoli gate with optimal resource [6.727984016678534]
  We design new quantum circuits for the $n$-Toffoli gate and general multi-controlled unitary, which have only $O(log n)$-depth and $O(n)$-size. We demonstrate that without the assistance of ancillary qubit, any quantum circuit implementation of multi-qubit Toffoli gate must employ exponential precision gates.
  arXiv  Detail & Related papers  (2024-02-07T17:53:21Z)
• Maximising Quantum-Computing Expressive Power through Randomised Circuits [4.604271571912073]
  variational quantum algorithms (VQAs) have emerged as a promising avenue to obtain quantum advantage. We numerically demonstrate a novel approach for VQAs, utilizing randomised quantum circuits to generate the variational wavefunction. This random-circuit approach presents a trade-off between the expressive power of the variational wavefunction and time cost.
  arXiv  Detail & Related papers  (2023-12-04T15:04:42Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Is quantum computing green? An estimate for an energy-efficiency quantum advantage [0.0]
  We show that the green quantum advantage threshold depends on (i) the quality of the experimental quantum gates and (ii) the entanglement generated in the QPU. We compute the green quantum advantage threshold for a few paradigmatic examples in terms of algorithms and hardware platforms.
  arXiv  Detail & Related papers  (2022-05-24T14:14:00Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Automatic quantum circuit encoding of a given arbitrary quantum state [0.0]
  We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state onto an optimal quantum circuit. The proposed algorithm employs as an objective function the absolute value of fidelity $F = langle 0 vert hatmathcalCdagger vert Psi rangle$. We experimentally demonstrate that a quantum circuit generated by the AQCE algorithm can indeed represent the original quantum state reasonably on a noisy real quantum device.
  arXiv  Detail & Related papers  (2021-12-29T12:33:41Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• VQE Method: A Short Survey and Recent Developments [5.9640499950316945]
  The variational quantum eigensolver (VQE) is a method that uses a hybrid quantum-classical computational approach to find eigenvalues and eigenvalues of a Hamiltonian. VQE has been successfully applied to solve the electronic Schr"odinger equation for a variety of small molecules. Modern quantum computers are not capable of executing deep quantum circuits produced by using currently available ansatze.
  arXiv  Detail & Related papers  (2021-03-15T16:25:36Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

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.