Related papers: New Developments for Automatic Loop Calculations
The development of new superconducting circuits and the improvement of existing ones rely on the accurate modeling of spectral properties which are key to achieving the needed advances in qubit performance. Systematic circuit analysis at…
We review techniques simplifying the analytic calculation of one-loop QCD amplitudes with many external legs, for use in next-to-leading-order corrections to multi-jet processes. Particularly useful are the constraints imposed by…
We present a new method for the numerical evaluation of arbitrary loop integrals in dimensional regularization. We first derive Mellin-Barnes integral representations and apply an algorithmic technique, based on the Cauchy theorem, to…
In recent years, various means of efficiently detecting changepoints in the univariate setting have been proposed, with one popular approach involving minimising a penalised cost function using dynamic programming. In some situations, these…
I illustrate new techniques and recently obtained results in the computation of perturbative QCD processes at the NLO accuracy
We describe the recently developed on-shell bootstrap for computing one-loop amplitudes in non-supersymmetric theories such as QCD. The method combines the unitarity method with loop-level on-shell recursion. The unitarity method is used to…
Simulating quantum circuits classically is an important area of research in quantum information, with applications in computational complexity and validation of quantum devices. One of the state-of-the-art simulators, that of Bravyi et al,…
The main two algorithms for computing the numerical radius are the level-set method of Mengi and Overton and the cutting-plane method of Uhlig. Via new analyses, we explain why the cutting-plane approach is sometimes much faster or much…
Many quantum algorithms make use of oracles which evaluate classical functions on a superposition of inputs. In order to facilitate implementation, testing, and resource estimation of such algorithms, we present quantum circuits for…
Inexact methods for model predictive control (MPC), such as real-time iterative schemes or time-distributed optimization, alleviate the computational burden of exact MPC by providing suboptimal solutions. While the asymptotic stability of…
We present a review of the Bielefeld-Dubna activities on multiloop calculations.
We make the case that variational algorithm ansatzes for near-term quantum computing are well-suited for the quantum circuit cutting strategy. Previous demonstrations of circuit cutting focused on the exponential execution and…
This paper provides an introduction to the design of augmented data structures that offer an efficient representation of a mathematical sequence and fast sequential summation algorithms, which guarantee both logarithmic running time and…
The lectures are a practical introduction to perturbative calculations in QED and QCD. I discuss methods of calculation of one- and two-loop diagrams in dimensional regularization, MSbar and on-shell renormalization schemes, decoupling of…
This study investigates computationally efficient inner-loop algorithms for estimating static/dynamic BLP models. It provides the following ideas for reducing the number of inner-loop iterations: (1). Add a term relating to the outside…
We present an algorithm for the numerical calculation of one-loop QCD amplitudes. The algorithm consists of subtraction terms, approximating the soft, collinear and ultraviolet divergences of one-loop amplitudes and a method to deform the…
A systematic scheme is proposed to numerically estimate the quantum speed limit and temporal shape of optimal control in two-level and three-level quantum systems with bounded amplitude. For the two-level system, two quantum state…
Inspired by computer assisted proofs in analysis, we present an interval approach to real-number computations.
We introduce a new numerical method for the computation of the inverse nonlinear Fourier transform and compare its computational complexity and accuracy to those of other methods available in the literature. For a given accuracy, the…
We analyze the conditions in which offloading computation reduces completion time. We extend the existing literature by deriving an inequality (Eq. 4) that relates computation offloading system parameters to the bits per instruction ratio…