Related papers: Global Error Control in the Runge-Kutta Solution o…
We present a novel, computationally efficient approach to accelerate quantum optimal control calculations of large multi-qubit systems used in a variety of quantum computing applications. By leveraging the intrinsic symmetry of finite…
Hamiltonian simulation, i.e., simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful…
We propose a new method for simulating certain type of time-dependent Hamiltonian $H(t) = \sum_{i=1}^m \gamma_i(t) H_i$ where $\gamma_i(t)$ (and its higher order derivatives) is bounded, computable function of time $t$, and each $H_i$ is…
We consider the efficient numerical solution of coupled dynamical systems, consisting of a small nonlinear part and a large linear time invariant part, possibly stemming from spatial discretization of an underlying partial differential…
We are concerned with the efficient implementation of symplectic implicit Runge-Kutta (IRK) methods applied to systems of (non-necessarily Hamiltonian) ordinary differential equations by means of Newton-like iterations. We pay particular…
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…
Unwanted interaction between a quantum system and its fluctuating environment leads to decoherence and is the primary obstacle to establishing a scalable quantum information processing architecture. Strategies such as environmental and…
It is well-known that a numerical method which is at the same time geometric structure-preserving and physical property-preserving cannot exist in general for Hamiltonian partial differential equations. In this paper, we present a novel…
This work provides a rigorous and self-contained introduction to numerical methods for Hamiltonian simulation in quantum computing, with a focus on high-order product formulas for efficiently approximating the time evolution of quantum…
In distributed quantum computing, the final solution of a problem is usually achieved by catenating these partial solutions resulted from different computing nodes, but intolerable errors likely yield in this catenation process. In this…
In this dissertation I analyze Hamiltonian control of $d$-dimensional quantum systems as realized in alkali atomic spins. Alkali atoms provide an ideal platform for studies of quantum control due to the extreme precision with which the…
We propose a practical implementation of high-order fully implicit Runge-Kutta(IRK) methods in a multiple precision floating-point environment. Although implementations based on IRK methods in an IEEE754 double precision environment have…
Randomized quantum algorithms have been proposed in the context of quantum simulation and quantum linear algebra with the goal of constructing shallower circuits than methods based on block encodings. While the algorithmic complexities of…
This paper concerns a class of uncertain linear quantum systems subject to quadratic perturbations in the system Hamiltonian. A small gain approach is used to evaluate the performance of the given quantum system. In order to get improved…
This paper is concerned with the linear quadratic (LQ) optimal control of continuous-time system with terminal state constraint. In particular, multiple agents exist in the system which can only access partial information of the matrix…
We develop error-control based time integration algorithms for compressible fluid dynamics (CFD) applications and show that they are efficient and robust in both the accuracy-limited and stability-limited regime. Focusing on discontinuous…
This work focuses on the numerical study of a recently published class of Runge-Kutta methods designed for mixed-precision arithmetic. We employ the methods in solving partial differential equations on modern hardware. In particular we…
The generalized additive Runge-Kutta (GARK) framework provides a powerful approach for solving additively partitioned ordinary differential equations. This work combines the ideas of symplectic GARK schemes and multirate GARK schemes to…
An approach is presented for robustness analysis and quantum (unitary) control synthesis based on the classic method of averaging. The result is a multicriterion optimization competing the nominal (uncertainty-free) fidelity with a well…
Applied to the master equation, the usual numerical integration methods, such as Runge-Kutta, become inefficient when the rates associated with various transitions differ by several orders of magnitude. We introduce an integration scheme…