N. Anders Petersson

N. Anders Petersson

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


N. Anders Petersson has a total of 42 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Transformational Regional-Scale Earthquake Simulations with the DOE EarthQuake SIMulation Exascale Framework

    by David McCallen, Arben Pitarka, Houjun Tang, Ramesh Pankajakshan, Anders Petersson, Mamun Miah

    Earthquakes present world-wide risk to economic and human safety. The 2023 earthquakes in Turkey provided a reminder of the potential for catastrophic consequences with 50,700 deaths and 15.7 million people affected. The ability to predict ground motions and infrastructure damage for earthquakes continues to be a challenging problem for scientists and engineers. Until now, estimates of ground motions have been performed empirically by looking at sparse data from past earthquakes. This approach can provide statistical information on intensity amplitudes but cannot inform site-specific ground motions essential to developing the most effective resilience. Interest has grown in largescale computational models to simulate earthquakes at regional scale. The U.S. DOE EQSIM framework was developed for regional-scale earthquake simulations at unprecedented fidelity, taking advantage of emerging GPU-accelerated systems. This article describes the EQSIM workflow and demonstrates regional-scale simulations with the new computational capability available to scientists in their quest to mitigate future disasters.


  • Open Access

    A practical approach to determine minimal quantum gate durations using amplitude-bounded quantum controls

    by Stefanie Günther, N. Anders Petersson

    We present an iterative scheme to estimate the minimal duration in which a quantum gate can be realized while satisfying hardware constraints on the control pulse amplitudes. The scheme performs a sequence of unconstrained numerical optimal control cycles that each minimize the gate fidelity for a given gate duration alongside an additional penalty term for the control pulse amplitudes. After each cycle, the gate duration is adjusted based on the inverse of the resulting maximum control pulse amplitudes by re-scaling the dynamics to a new duration where control pulses satisfy the amplitude constraints. Those scaled controls then serve as an initial guess for the next unconstrained optimal control cycle, using the adjusted gate duration. We provide multiple numerical examples that each demonstrate fast convergence of the scheme toward a gate duration that is close to the quantum speed limit, given the control pulse amplitude bound. The proposed technique is agnostic to the underlying system and control Hamiltonian models, as well as the target unitary gate operation, making the time-scaling iteration an easy to implement and practically useful scheme for reducing the durations of quantum gate operations.


  • Open Access

    A practical approach to determine minimal quantum gate durations using amplitude-bounded quantum controls

    by Stefanie Günther, N. Anders Petersson

    We present an iterative scheme to estimate the minimal duration in which a quantum gate can be realized while satisfying hardware constraints on the control pulse amplitudes. The scheme performs a sequence of unconstrained numerical optimal control cycles that each minimize the gate fidelity for a given gate duration alongside an additional penalty term for the control pulse amplitudes. After each cycle, the gate duration is adjusted based on the inverse of the resulting maximum control pulse amplitudes, by re-scaling the dynamics to a new duration where control pulses satisfy the amplitude constraints. Those scaled controls then serve as an initial guess for the next unconstrained optimal control cycle, using the adjusted gate duration. We provide multiple numerical examples that each demonstrate fast convergence of the scheme towards a gate duration that is close to the quantum speed limit, given the control pulse amplitude bound. The proposed technique is agnostic to the underlying system and control Hamiltonian models, as well as the target unitary gate operation, making the time-scaling iteration an easy to implement and practically useful scheme for reducing the durations of quantum gate operations.

  • Open Access

    Deterministic and Bayesian Characterization of Quantum Computing Devices

    by Zhichao Peng, Daniel Appelö, N. Anders Petersson, Mohammad Motamed, Fortino Garcia, Yujin Cho

    Motivated by the noisy and fluctuating behavior of current quantum computing devices, this paper presents a data-driven characterization approach for estimating transition frequencies and decay times in a Lindbladian dynamical model of a superconducting quantum device. The data includes parity events in the transition frequency between the first and second excited states. A simple but effective mathematical model, based upon averaging solutions of two Lindbladian models, is demonstrated to accurately capture the experimental observations. A deterministic point estimate of the device parameters is first performed to minimize the misfit between data and Lindbladian simulations. These estimates are used to make an informed choice of prior distributions for the subsequent Bayesian inference. An additive Gaussian noise model is developed for the likelihood function, which includes two hyper-parameters to capture the noise structure of the data. The outcome of the Bayesian inference are posterior probability distributions of the transition frequencies, which for example can be utilized to design risk neutral optimal control pulses. The applicability of our approach is demonstrated on experimental data from the Quantum Device and Integration Testbed (QuDIT) at Lawrence Livermore National Laboratory, using a tantalum-based superconducting transmon device.

  • Noise-specific beating in the higher-level Ramsey curves of a transmon qubit

    by L. A. Martinez, Z. Peng, D. Appelö, D. M. Tennant, N. Anders Petersson, J. L DuBois, Y. J. Rosen

    In the higher levels of superconducting transmon devices and more generally charge sensitive devices, T2* measurements made in the presence of low-frequency time-correlated 1/f charge noise and quasiparticle-induced parity flips can give an underestimation of the total dephasing time. The charge variations manifest as beating patterns observed in the overlay of several Ramsey fringe curves and are reproduced with a phenomenological Ramsey curve model, which accounts for the charge variations. T2* dephasing times, which more accurately represent the total dephasing time, are obtained. The phenomenological model is compared with a Lindblad master equation model. Both models are found to be in agreement with one another and the experimental data. Finally, the phenomenological formulation enables a simple method in which the power spectral density for the low-frequency noise can be inferred from the overlay of several Ramsey curves.


  • Open Access

    Mathematical approaches for characterization, control, calibration and validation of a quantum computing device

    by Zhichao Peng, Daniel Appelo, N. Anders Petersson, Fortino Garcia, Yujin Cho

    Quantum computing has received significant amounts of interest from many different research communities over the last few years. Although there are many introductory texts that focus on the algorithmic parts of quantum computing, there is a dearth of publications that describe the modeling, calibration and operation of current quantum computing devices. One aim of this report is to fill that void by providing a case study that walks through the entire procedure from the characterization and optimal control of a qudit device at Lawrence Livermore National Laboratory (LLNL) to the validation of the results. A goal of the report is to provide an introduction for students and researchers, especially computational mathematicians, who are interested in but new to quantum computing. Both experimental and mathematical aspects of this procedure are discussed. We present a description of the LLNL QuDIT testbed, the mathematical models that are used to describe it, and the numerical methods that are used to to design optimal controls. We also present experimental and computational methods that can be used to characterize a quantum device. Finally, an experimental validation of an optimized control pulse is presented, which relies on the accuracy of the characterization and the optimal control methodologies.

  • Optimal Control of Closed Quantum Systems via B-Splines with Carrier Waves

    by N. Anders Petersson, Fortino Garcia

    We consider the optimal control problem of determining electromagnetic pulses for implementing logical gates in a closed quantum system, where the Hamiltonian models the dynamics of coupled superco...


  • Binary Optimal Control of Single-Flux-Quantum Pulse Sequences

    by Ryan H. Vogt, N. Anders Petersson

    We introduce a binary, relaxed gradient, trust-region method for optimizing pulse sequences for single flux quanta control of a quantum computer. The pulse sequences are optimized with the goal of realizing unitary gate transformations. Each pulse has a fixed amplitude and duration. We model this process as a binary optimal control problem, constrained by Schrödinger’s equation, where the binary variables indicate whether each pulse is on or off. We introduce a first-order trust-region method, which takes advantage of a relaxed gradient to determine an optimal pulse sequence that minimizes the gate infidelity, while also suppressing leakage to higher energy levels. The proposed algorithm has a computational complexity of \(\mathcal{O}(p\log (p))\) , where \(p\) is the number of pulses in the sequence. We present numerical results for the H and X gates, where the optimized pulse sequences give gate fidelities better than 99.9%, in \(\approx 25\) trust-region iterations.