Hard-sphere jamming through the lens of linear optimization.

The jamming transition is ubiquitous. It is present in granular matter, foams, colloids, structural glasses, and many other systems. Yet, it defines a critical point whose properties still need to be fully understood. Recently, a major breakthrough came about when the replica formalism was extended to build a mean-field theory that provides an exact description of the jamming transition of spherical particles in the infinite-dimensional limit. While such theory explains the jamming critical behavior of both soft and hard spheres, investigating the transition in finite-dimensional systems poses very difficult and different problems, in particular from the numerical point of view. Soft particles are modeled by continuous potentials; thus, their jamming point can be reached through efficient energy minimization algorithms. In contrast, the latter methods are inapplicable to hard-sphere (HS) systems since the interaction energy among the particles is always zero by construction. To overcome these difficulties, here we recast the jamming of hard spheres as a constrained optimization problem and introduce the CALiPPSO algorithm, capable of readily producing jammed HS packings without including any effective potential. This algorithm brings a HS configuration of arbitrary dimensions to its jamming point by solving a chain of linear optimization problems. We show that there is a strict correspondence between the force balance conditions of jammed packings and the properties of the optimal solutions of CALiPPSO, whence we prove analytically that our packings are always isostatic and in mechanical equilibrium. Furthermore, using extensive numerical simulations, we show that our algorithm is able to probe the complex structure of the free-energy landscape, finding qualitative agreement with mean-field predictions. We also characterize the algorithmic complexity of CALiPPSO and provide an open-source implementation of it.

Finite-size effects in the microscopic critical properties of jammed configurations: A comprehensive study of the effects of different types of disorder.

Jamming criticality defines a universality class that includes systems as diverse as glasses, colloids, foams, amorphous solids, constraint satisfaction problems, neural networks, etc. A particularly interesting feature of this class is that small interparticle forces (f) and gaps (h) are distributed according to nontrivial power laws. A recently developed mean-field (MF) theory predicts the characteristic exponents of these distributions in the limit of very high spatial dimension, d→∞ and, remarkably, their values seemingly agree with numerical estimates in physically relevant dimensions, d=2 and 3. These exponents are further connected through a pair of inequalities derived from stability conditions, and both theoretical predictions and previous numerical investigations suggest that these inequalities are saturated. Systems at the jamming point are thus only marginally stable. Despite the key physical role played by these exponents, their systematic evaluation has yet to be attempted. Here, we carefully test their value by analyzing the finite-size scaling of the distributions of f and h for various particle-based models for jamming. Both dimension and the direction of approach to the jamming point are also considered. We show that, in all models, finite-size effects are much more pronounced in the distribution of h than in that of f. We thus conclude that gaps are correlated over considerably longer scales than forces. Additionally, remarkable agreement with MF predictions is obtained in all but one model, namely near-crystalline packings. Our results thus help to better delineate the domain of the jamming universality class. We furthermore uncover a secondary linear regime in the distribution tails of both f and h. This surprisingly robust feature is understood to follow from the (near) isostaticity of our configurations.

Optimal work extraction and mutual information in a generalized Szilárd engine.

A 1929 Gedankenexperiment proposed by Szilárd, often referred to as "Szilárd's engine", has served as a foundation for computing fundamental thermodynamic bounds to information processing. While Szilárd's original box could be partitioned into two halves and contains one gas molecule, we calculate here the maximal average work that can be extracted in a system with N particles and q partitions, given an observer which counts the molecules in each partition, and given a work extraction mechanism that is limited to pressure equalization. We find that the average extracted work is proportional to the mutual information between the one-particle position and the vector containing the counts of how many particles are in each partition. We optimize this quantity over the initial locations of the dividing walls, and find that there exists a critical number of particles N^{★}(q) below which the extracted work is maximized by a symmetric configuration of the q partitions, and above which the optimal partitioning is asymmetric. Overall, the average extracted work is maximized for a number of particles N[over ̂](q)

Inferring the particle-wise dynamics of amorphous solids from the local structure at the jamming point.

Jamming is a phenomenon shared by a wide variety of systems, such as granular materials, foams, and glasses in their high density regime. This has motivated the development of a theoretical framework capable of explaining many of their static critical properties with a unified approach. However, the dynamics occurring in the vicinity of the jamming point has received little attention and the problem of finding a connection with the local structure of the configuration remains unexplored. Here we address this issue by constructing physically well defined structural variables using the information contained in the network of contacts of jammed configurations, and then showing that such variables yield a resilient statistical description of the particle-wise dynamics near this critical point. Our results are based on extensive numerical simulations of systems of spherical particles that allow us to statistically characterize the trajectories of individual particles in terms of their first two moments. We first demonstrate that, besides displaying a broad distribution of mobilities, particles may also have preferential directions of motion. Next, we associate each of these features with a structural variable computed uniquely in terms of the contact vectors at jamming, obtaining considerably high statistical correlations. The robustness of our approach is confirmed by testing two types of dynamical protocols, namely molecular dynamics and Monte Carlo, with different types of interaction. We also provide evidence that the dynamical regime we study here is dominated by anharmonic effects and therefore it cannot be described properly in terms of vibrational modes. Finally, we show that correlations decay slowly and in an interaction-independent fashion, suggesting a universal rate of information loss.

Advanced Statistical Testing of Quantum Random Number Generators.

Pseudo-random number generators are widely used in many branches of science, mainly in applications related to Monte Carlo methods, although they are deterministic in design and, therefore, unsuitable for tackling fundamental problems in security and cryptography. The natural laws of the microscopic realm provide a fairly simple method to generate non-deterministic sequences of random numbers, based on measurements of quantum states. In practice, however, the experimental devices on which quantum random number generators are based are often unable to pass some tests of randomness. In this review, we briefly discuss two such tests, point out the challenges that we have encountered in experimental implementations and finally present a fairly simple method that successfully generates non-deterministic maximally random sequences.

Improving randomness characterization through Bayesian model selection.

Random number generation plays an essential role in technology with important applications in areas ranging from cryptography to Monte Carlo methods, and other probabilistic algorithms. All such applications require high-quality sources of random numbers, yet effective methods for assessing whether a source produce truly random sequences are still missing. Current methods either do not rely on a formal description of randomness (NIST test suite) on the one hand, or are inapplicable in principle (the characterization derived from the Algorithmic Theory of Information), on the other, for they require testing all the possible computer programs that could produce the sequence to be analysed. Here we present a rigorous method that overcomes these problems based on Bayesian model selection. We derive analytic expressions for a model's likelihood which is then used to compute its posterior distribution. Our method proves to be more rigorous than NIST's suite and Borel-Normality criterion and its implementation is straightforward. We applied our method to an experimental device based on the process of spontaneous parametric downconversion to confirm it behaves as a genuine quantum random number generator. As our approach relies on Bayesian inference our scheme transcends individual sequence analysis, leading to a characterization of the source itself.