Related papers: From Orthogonalizing Pseudopotential to the Feshba…
The aim of this work is to develop the relevant formalism for performing coupled-cluster (CC) calculations in nuclear matter and neutron star matter, including thereby important correlations to infinite order in the interaction and testing…
Perturbative and non-perturbative expansion methods already constitute a tool of choice to perform ab initio calculations over a significant part of the nuclear chart. In this context, the categories of accessible nuclei directly reflect…
We study quantum hypothesis testing between orthogonal states under restricted local measurements in the many-copy scenario. For testing arbitrary multipartite entangled pure state against its orthogonal complement state via the local…
We demonstrate that a tensor product structure and optical analogy of quantum entanglement can be obtained by introducing pseudorandom phase sequences into classical fields with two orthogonal modes. Using the classical analogy, we discuss…
High-dimensional nonlinear optimization problems subject to nonlinear constraints can appear in several contexts including constrained physical and dynamical systems, statistical estimation, and other numerical models. Feasible optimization…
Simulating dynamics of physical systems is a key application of quantum computing, with potential impact in fields such as condensed matter physics and quantum chemistry. However, current quantum algorithms for Hamiltonian simulation yield…
The efficient condition assessment of engineered systems requires the coupling of high fidelity models with data extracted from the state of the system `as-is'. In enabling this task, this paper implements a parametric Model Order Reduction…
A grid-based real-space implementation of the Projector Augmented Wave (PAW) method of P. E. Blochl [Phys. Rev. B 50, 17953 (1994)] for Density Functional Theory (DFT) calculations is presented. The use of uniform 3D real-space grids for…
Primitive Optimality Theory (OTP) (Eisner, 1997a; Albro, 1998), a computational model of Optimality Theory (Prince and Smolensky, 1993), employs a finite state machine to represent the set of active candidates at each stage of an Optimality…
Orthogonal matching pursuit (OMP) is a widely used algorithm for recovering sparse high dimensional vectors in linear regression models. The optimal performance of OMP requires \textit{a priori} knowledge of either the sparsity of…
Orthogonal least square (OLS) is an important sparse signal recovery algorithm for compressive sensing, which enjoys superior probability of success over other well-known recovery algorithms under conditions of correlated measurement…
We look at Monte Carlo numerical integration from a stochastic geometry point of view. While crude Monte Carlo estimators relate to linear statistics of a homogeneous Poisson point process (PPP), linear statistics of more regularly spread…
There are two approaches to projective representation theory of symmetric and alternating groups, which are powerful enough to work for modular representations. One is based on Sergeev duality, which connects projective representation…
We present a combination technique based on mixed differences of both spatial approximations and quadrature formulae for the stochastic variables to solve efficiently a class of Optimal Control Problems (OCPs) constrained by random partial…
A targeted exponentiation algorithm computes a group exponentiation operation $a^k$ with a reversible circuit in such a way that the initial state of the circuit consists of only the base $a$ and fixed values, and the final state consists…
Many theories that attempt to formulate a quantum description of gravity suggest the existence of a fundamental minimum length scale. A popular method for incorporating this minimum length is through a modification of the Heisenberg…
The optimized-effective-potential (OEP) method is a special technique to construct local Kohn-Sham potentials from general orbital-dependent energy functionals. In a recent publication [M. Betzinger, C. Friedrich, S. Bl\"ugel, A. G\"orling,…
We study the renormalization group flow in weak power counting (WPC) renormalizable theories. The latter are theories which, after being formulated in terms of certain variables, display only a finite number of independent divergent…
Efficient and effective compilation of quantum circuits remains an important aspect of executing quantum programs. In this paper, we propose a generic compilation framework particularly suitable for limited connectivity, that extends many…
Orthogonal matching pursuit~(OMP) is a commonly used greedy algorithm for recovering sparse signals from compressed measurements. In this paper, we introduce a variant of the OMP algorithm to reduce the complexity of reconstructing a class…