Related papers: High-resolution quantization and entropy coding fo…
To study asymptotic structures, we regularize Einstein's field equations by means of conformal transformations. The conformal factor is chosen so that it carries a dimensional scale that captures crucial asymptotic features. By choosing a…
Reducing the complexity of quantum algorithms to treat quantum chemistry problems is essential to demonstrate an eventual quantum advantage of Noisy-Intermediate Scale Quantum (NISQ) devices over their classical counterpart. Significant…
We study the asymptotics of sojourn time of the stationary queueing process $Q(t),t\ge0$ fed by a fractional Brownian motion with Hurst parameter $H\in(0,1)$ above a high threshold $u$. For the Brownian motion case $H=1/2$, we derive the…
We introduce the first differentiable approximation of range-partition entropy, a complexity measure from computational geometry that directly bounds algorithmic runtime. Unlike architectural modifications, our method is a complementary…
For a closed-loop control system with a digital channel between the sensor and the controller, the notion of invariance entropy quantifies the smallest average rate of information above which a given compact subset of the state space can be…
In this work, we propose a soft covering problem for fully quantum channels using relative entropy as a criterion for operator closeness. We establish covering lemmas by deriving one-shot bounds on the achievable rates in terms of smooth…
Entanglement renormalization can be viewed as an encoding circuit for a family of approximate quantum error correcting codes. The logical information becomes progressively more well-protected against erasure errors at larger length scales.…
In this paper we present new theoretical results on optimal estimation of certain random quantities based on high frequency observations of a L\'evy process. More specifically, we investigate the asymptotic theory for the conditional mean…
In this contribution we derive and analyze a new numerical method for kinetic equations based on a variable transformation of the moment approximation. Classical minimum-entropy moment closures are a class of reduced models for kinetic…
Quantum metrology allows us to attain a measurement precision that surpasses the classically achievable limit by using quantum characters. The metrology precision is raised from the standard quantum limit (SQL) to the Heisenberg limit (HL)…
Quantum metrology has many important applications in science and technology, ranging from frequency spectroscopy to gravitational wave detection. Quantum mechanics imposes a fundamental limit on measurement precision, called the Heisenberg…
This paper presents a saddlepoint approximation of the random-coding union bound of Polyanskiy et al. for i.i.d. random coding over discrete memoryless channels. The approximation is single-letter, and can thus be computed efficiently.…
Fractional Brownian motion is a Gaussian process x(t) with zero mean and two-time correlations <x(t)x(s)> ~ t^{2H} + s^{2H} - |t-s|^{2H}, where H, with 0<H<1 is called the Hurst exponent. For H = 1/2, x(t) is a Brownian motion, while for H…
We study well-posedness of sweeping processes with stochastic perturbations generated by a fractional Brownian motion and convergence of associated numerical schemes. To this end, we first prove new existence, uniqueness and approximation…
Coherence and entanglement are fundamental properties of quantum systems, promising to power the near future quantum computers, sensors and simulators. Yet, their experimental detection is challenging, usually requiring full reconstruction…
We perform a study on quantum entropy production, different kinds of correlations, and their interplay in the driven Caldeira-Leggett model of quantum Brownian motion. The model, taken with a large but finite number of bath modes, is…
The paper describes an approach to measuring convergence of an algorithm to its result in terms of an entropy-like function of partitions of its inputs of a given length. The goal is to look at the algorithmic data processing from the…
The performance of a quantum error-correction process is determined by the likelihood that a random configuration of errors introduced to the system will lead to the corruption of encoded logical information. In this work we compare two…
We propose a numerical homogenization method for scalar linear partial differential equations with rough coefficients, that integrates classical coarse-scale solvers with quantum subroutines for fine-scale corrections. Inspired by the…
In this monograph, we review recent advances in second-order asymptotics for lossy source coding, which provides approximations to the finite blocklength performance of optimal codes. The monograph is divided into three parts. In part I, we…