Recommendations and illustrations for the evaluation of photonic random number generators

The never-ending quest to improve the security of digital information combined with recent improvements in hardware technology has caused the field of random number generation to undergo a fundamental shift from relying solely on pseudo-random algorithms to employing optical entropy sources. Despite these significant advances on the hardware side, commonly used statistical measures and evaluation practices remain ill-suited to understand or quantify the optical entropy that underlies physical random number generation. We review the state of the art in the evaluation of optical random number generation and recommend a new paradigm: quantifying entropy generation and understanding the physical limits of the optical sources of randomness. In order to do this, we advocate for the separation of the physical entropy source from deterministic post-processing in the evaluation of random number generators and for the explicit consideration of the impact of the measurement and digitization process on the rate of entropy production. We present the Cohen-Procaccia estimate of the entropy rate $h(\epsilon,\tau)$ as one way to do this. In order to provide an illustration of our recommendations, we apply the Cohen-Procaccia estimate as well as the entropy estimates from the new NIST draft standards for physical random number generators to evaluate and compare three common optical entropy sources: single photon time-of-arrival detection, chaotic lasers, and amplified spontaneous emission

Dissipation time and decay of correlations

We consider the effect of noise on the dynamics generated by volume-preserving maps on a d-dimensional torus. The quantity we use to measure the irreversibility of the dynamics is the dissipation time. We focus on the asymptotic behaviour of this time in the limit of small noise. We derive universal lower and upper bounds for the dissipation time in terms of various properties of the map and its associated propagators: spectral properties, local expansivity, and global mixing properties. We show that the dissipation is slow for a general class of non-weakly-mixing maps; on the opposite, it is fast for a large class of exponentially mixing systems which include uniformly expanding maps and Anosov diffeomorphisms.Comment: 26 Pages, LaTex. Submitted to Nonlinearit

A globally convergent matricial algorithm for multivariate spectral estimation

In this paper, we first describe a matricial Newton-type algorithm designed to solve the multivariable spectrum approximation problem. We then prove its global convergence. Finally, we apply this approximation procedure to multivariate spectral estimation, and test its effectiveness through simulation. Simulation shows that, in the case of short observation records, this method may provide a valid alternative to standard multivariable identification techniques such as MATLAB's PEM and MATLAB's N4SID

Relations for certain symmetric norms and anti-norms before and after partial trace

Changes of some unitarily invariant norms and anti-norms under the operation of partial trace are examined. The norms considered form a two-parametric family, including both the Ky Fan and Schatten norms as particular cases. The obtained results concern operators acting on the tensor product of two finite-dimensional Hilbert spaces. For any such operator, we obtain upper bounds on norms of its partial trace in terms of the corresponding dimensionality and norms of this operator. Similar inequalities, but in the opposite direction, are obtained for certain anti-norms of positive matrices. Through the Stinespring representation, the results are put in the context of trace-preserving completely positive maps. We also derive inequalities between the unified entropies of a composite quantum system and one of its subsystems, where traced-out dimensionality is involved as well.Comment: 11 pages, no figures. A typo error in Eq. (5.15) is corrected. Minor improvements. J. Stat. Phys. (in press