Compositional Methods for Schrödinger's Equation with Application to Optimal Control

Abstract

The evolution of the state of a quantum computer is governed by Schrödinger's equation. We introduce compositional methods, a way to increase the order of symmetric methods by replacing one timestep by multiple timesteps. We perform several numerical experiments, including a simulation of a two qubit CNOT gate, using compositional variants of Störmer-Verlet and the implicit midpoint rule. We observe that the compositional methods demonstrate greater computational efficiency than the base methods when the desired error tolerance is less than ~ 10 -4 to 10 -5 . We discuss the trade-offs of using each compositional method, as well as differences between using Störmer-Verlet or the implicit midpoint rule as the base integrator of the compositional methods.