Algorithms for perturbative analysis and simulation of quantum dynamics

DOI10.1016/J.JCP.2023.112262MaRDI QIDQ6107101zbMATH OpenFDO

Authors Daniel Puzzuoli, Sophia Fuhui Lin, Moein Malekakhlagh, Emily J. Pritchett, Benjamin Rosand, Christopher J. Wood

Publication date 3 July 2023

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2210.11595

zbMATH Keywords

simulationcontrolperturbationquantumDysonMagnus

Mathematics Subject Classification ID

Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx) Numerical approximation and computational geometry (primarily algorithms) (65Dxx) General mathematical topics and methods in quantum theory (81Qxx)

Abstract: We develop general purpose algorithms for computing and utilizing both the Dyson series and Magnus expansion, with the goal of facilitating numerical perturbative studies of quantum dynamics. To enable broad applications to models with multiple parameters, we phrase our algorithms in terms of multivariable sensitivity analysis, for either the solution or the time-averaged generator of the evolution over a fixed time-interval. These tools simultaneously compute a collection of terms up to arbitrary order, and are general in the sense that the model can depend on the parameters in an arbitrary time-dependent way. We implement the algorithms in the open source software package qiskitdynamics{}, utilizing the JAX array library to enable just-in-time compilation, automatic differentiation, and GPU execution of all computations. Using a model of a single transmon, we demonstrate how to use these tools to approximate fidelity in a region of model parameter space, as well as construct perturbative robust control objectives. We also derive and implement Dyson and Magnus-based variations of the recently introduced Dysolve algorithm [Shillito et al., Physical Review Research, 3(3):033266] for simulating linear matrix differential equations. We show how the pre-computation step can be phrased as a multivariable expansion computation problem with fewer terms than in the original method. When simulating a two-transmon entangling gate on a GPU, we find the Dyson and Magnus-based solvers provide a speedup over traditional ODE solvers, ranging from roughly $2imes$ to $4imes$ for a solution and $10imes$ to $60imes$ for a gradient, depending on solution accuracy.

Recommendations

• Quantum algorithm for linear differential equations with exponentially improved dependence on precision
• Efficient Quantum Algorithms for Simulating Lindblad Evolution
• An efficient quantum algorithm for simulating polynomial differential equations
• Simulating quantum dynamics on a quantum computer

Cites work

• A new scaling and squaring algorithm for the matrix exponential
• Arbitrary quantum control of qubits in the presence of universal noise
• Computing integrals involving the matrix exponential
• Computing multiple integrals involving matrix exponentials
• Exact rotating wave approximation
• On the exponential solution of differential equations for a linear operator
• ROBUST DYNAMICAL DECOUPLING: FEEDBACK-FREE ERROR CORRECTION
• SUNDIALS
• Schrieffer-Wolff transformation for quantum many-body systems
• Some Practical Runge-Kutta Formulas
• The Radiation Theories of Tomonaga, Schwinger, and Feynman

Cited in

(4)

• scientific article; zbMATH DE number 4077891 (Why is no real title available?)
• Modeling complex quantum dynamics: evolution of numerical algorithms in the HPC context
• Program for quantum wave-packet dynamics with time-dependent potentials
• Performance analysis of LVQ algorithms: a statistical physics approach

This page was built for publication: Algorithms for perturbative analysis and simulation of quantum dynamics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6107101)