Implicit differentiation of variational quantum algorithms
- URL: http://arxiv.org/abs/2211.13765v1
- Date: Thu, 24 Nov 2022 19:00:19 GMT
- Title: Implicit differentiation of variational quantum algorithms
- Authors: Shahnawaz Ahmed, Nathan Killoran, Juan Felipe Carrasquilla \'Alvarez
- Abstract summary: 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.
- Score: 0.8594140167290096
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Several quantities important in condensed matter physics, quantum
information, and quantum chemistry, as well as quantities required in
meta-optimization of machine learning algorithms, can be expressed as gradients
of implicitly defined functions of the parameters characterizing the system.
Here, we show how to leverage implicit differentiation for gradient computation
through variational quantum algorithms and explore applications in condensed
matter physics, quantum machine learning, and quantum information. A function
defined implicitly as the solution of a quantum algorithm, e.g., a
variationally obtained ground- or steady-state, can be automatically
differentiated using implicit differentiation while being agnostic to how the
solution is computed. We apply this notion to the evaluation of physical
quantities in condensed matter physics such as generalized susceptibilities
studied through a variational quantum algorithm. Moreover, we develop two
additional applications of implicit differentiation -- hyperparameter
optimization in a quantum machine learning algorithm, and the variational
construction of entangled quantum states based on a gradient-based maximization
of a geometric measure of entanglement. Our work ties together several types of
gradient calculations that can be computed using variational quantum circuits
in a general way without relying on tedious analytic derivations, or
approximate finite-difference methods.
Related papers
- 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) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - Variational quantum algorithms for scanning the complex spectrum of
non-Hermitian systems [0.0]
We propose a variational method for solving the non-Hermitian Hamiltonian on a quantum computer.
The energy is set as a parameter in the cost function and can be tuned to obtain the whole spectrum.
Our work suggests an avenue for solving non-Hermitian quantum many-body systems with variational quantum algorithms on near-term noisy quantum computers.
arXiv Detail & Related papers (2023-05-31T12:50:22Z) - Investigation of Perturbation Theory with Variational Quantum Algorithm [0.0]
Variational Quantum Algorithms are among the most promising systems to implement quantum computing.
In this paper, we investigate perturbation theory with these algorithms and prospect the possibility of using the variational quantum algorithm to simulate quantum dynamics in perturbation theory.
arXiv Detail & Related papers (2022-12-30T07:30:05Z) - Near-term quantum algorithm for computing molecular and materials
properties based on recursive variational series methods [44.99833362998488]
We propose a quantum algorithm to estimate the properties of molecules using near-term quantum devices.
We test our method by computing the one-particle Green's function in the energy domain and the autocorrelation function in the time domain.
arXiv Detail & Related papers (2022-06-20T16:33:23Z) - Adiabatic quantum computing with parameterized quantum circuits [0.0]
We propose a discrete version of adiabatic quantum computing that can be implemented in a near-term device.
We compare our proposed algorithm with the Variational Quantum Eigensolver on two classical optimization problems.
arXiv Detail & Related papers (2022-06-09T09:31:57Z) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - 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) - Adaptive variational quantum eigensolvers for highly excited states [4.038971004196936]
Highly excited states of quantum many-body systems are central objects in the study of quantum dynamics and thermalization.
We propose an adaptive variational algorithm, adaptive VQE-X, that self-generates a variational ansatz for arbitrary eigenstates of a many-body Hamiltonian $H$.
arXiv Detail & Related papers (2021-04-26T15:03:51Z) - Measuring Analytic Gradients of General Quantum Evolution with the
Stochastic Parameter Shift Rule [0.0]
We study the problem of estimating the gradient of the function to be optimized directly from quantum measurements.
We derive a mathematically exact formula that provides an algorithm for estimating the gradient of any multi-qubit parametric quantum evolution.
Our algorithm continues to work, although with some approximations, even when all the available quantum gates are noisy.
arXiv Detail & Related papers (2020-05-20T18:24:11Z)
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.