Evaluating analytic gradients of pulse programs on quantum computers
- URL: http://arxiv.org/abs/2309.16756v1
- Date: Thu, 28 Sep 2023 18:00:04 GMT
- Title: Evaluating analytic gradients of pulse programs on quantum computers
- Authors: Korbinian Kottmann, Nathan Killoran
- Abstract summary: Parametrized pulse programs running on quantum hardware can be differentiated via the parameter-shift (SPS) rule.
We introduce a new analytic method for computing gradients of pulse programs, that we coin ODEgen.
We demonstrate a pulse VQE run with gradients computed via ODEgen entirely on quantum hardware.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Parametrized pulse programs running on quantum hardware can be differentiated
via the stochastic parameter-shift (SPS) rule. We overcome the intrinsically
approximate nature of SPS by introducing a new analytic method for computing
gradients of pulse programs, that we coin ODEgen. In this new method, we find
effective generators of pulse gates using a differentiable ordinary
differential equation (ODE) solver. These effective generators inform
parameter-shift rules that can be evaluated on quantum hardware. We showcase
simulated VQE examples with realistic superconducting transmon systems, for
which we obtain lower energies with fewer quantum resources using ODEgen over
SPS. We further demonstrate a pulse VQE run with gradients computed via ODEgen
entirely on quantum hardware.
Related papers
- Universal quantum processors in spin systems via robust local pulse sequences [0.0]
We propose a protocol to realize quantum simulation and computation in spin systems with long-range interactions.
Our approach relies on the local addressing of single spins with external fields parametrized by Walsh functions.
We demonstrate and numerically benchmark our protocol with examples from the dynamics of spin models, quantum error correction and quantum optimization algorithms.
arXiv Detail & Related papers (2023-11-17T15:55:04Z) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - Pulse based Variational Quantum Optimal Control for hybrid quantum
computing [0.0]
This work studies pulse based variational quantum algorithms (VQAs)
VQAs are designed to determine the ground state of a quantum mechanical system by combining classical and quantum hardware.
arXiv Detail & Related papers (2022-02-17T21:43:54Z) - Numerical Gate Synthesis for Quantum Heuristics on Bosonic Quantum
Processors [1.195496689595016]
We study the framework in the context of qudits which are controllable electromagnetic modes of a superconducting cavity system.
We showcase control of single-qudit operations up to eight states, and two-qutrit operations, mapped respectively onto a single mode and two modes of the resonator.
arXiv Detail & Related papers (2022-01-19T18:55:13Z) - 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) - Using gradient-based algorithms to determine ground state energies on a
quantum computer [0.0]
Variational algorithms are promising candidates to be implemented on near-term quantum computers.
We study how different methods for obtaining the gradient, specifically the finite-difference and the parameter-shift rule, are affected by shot noise and noise of the quantum computer.
arXiv Detail & Related papers (2021-09-17T09:12:43Z) - 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) - Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
We introduce new tools in qutip-qip, QuTiP's quantum information processing package.
These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features.
We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
arXiv Detail & Related papers (2021-05-20T17:06:52Z) - Fast and differentiable simulation of driven quantum systems [58.720142291102135]
We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods.
We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
arXiv Detail & Related papers (2020-12-16T21:43:38Z) - Extending XACC for Quantum Optimal Control [70.19683407682642]
Quantum computing vendors are beginning to open up application programming for direct pulse-level quantum control.
We present an extension to the XACC system-level quantum-classical software framework.
This extension enables the translation of digital quantum circuit representations to equivalent pulse sequences.
arXiv Detail & Related papers (2020-06-04T13:13:55Z)
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.