Infinite Series of Singularities in the Correlated Random Matrices Product

We consider the product of a large number of two 2 × 2 matrices chosen randomly (with some correlation): at any round there are transition probabilities for the matrix type, depending on the choice at previous round. Previously, a functional equation has been derived to calculate such a random product of matrices. Here, we identify the phase structure of the problem with exact expressions for the transition points separating “localized” and “ergodic” regimes. We demonstrate that the latter regime develops through a formation of an infinite series of singularities in the steady-state distribution of vectors that results from the action of the random product of matrices on an initial vector.

Extensive Entropy from Unitary Evolution

In quantum many-body systems, a Hamiltonian is called an ``extensive entropy generator'' if starting from a random product state the entanglement entropy obeys a volume law at long times with overwhelming probability. We prove that (i) any Hamiltonian whose spectrum has non-degenerate gaps is an extensive entropy generator; (ii) in the space of (geometrically) local Hamiltonians, the non-degenerate gap condition is satisfied almost everywhere. Specializing to many-body localized systems, these results imply the observation stated in the title of Bardarson et al. [PRL 109, 017202 (2012)].

Single T gate in a Clifford circuit drives transition to universal entanglement spectrum statistics

Clifford circuits are insufficient for universal quantum computation or creating tt-designs with t\ge 4t≥4. While the entanglement entropy is not a telltale of this insufficiency, the entanglement spectrum of a time evolved random product state is: the entanglement levels are Poisson-distributed for circuits restricted to the Clifford gate-set, while the levels follow Wigner-Dyson statistics when universal gates are used. In this paper we show, using finite-size scaling analysis of different measures of level spacing statistics, that in the thermodynamic limit, inserting a single T (\pi/8)(π/8) gate in the middle of a random Clifford circuit is sufficient to alter the entanglement spectrum from a Poisson to a Wigner-Dyson distribution.

Optimization of Warehouse Operations with Genetic Algorithms

We present a complete, fully automatic solution based on genetic algorithms for the optimization of discrete product placement and of order picking routes in a warehouse. The solution takes as input the warehouse structure and the list of orders and returns the optimized product placement, which minimizes the sum of the order picking times. The order picking routes are optimized mostly by genetic algorithms with multi-parent crossover operator, but for some cases also permutations and local search methods can be used. The product placement is optimized by another genetic algorithm, where the sum of the lengths of the optimized order picking routes is used as the cost of the given product placement. We present several ideas, which improve and accelerate the optimization, as the proper number of parents in crossover, the caching procedure, multiple restart and order grouping. In the presented experiments, in comparison with the random product placement and random product picking order, the optimization of order picking routes allowed the decrease of the total order picking times to 54%, optimization of product placement with the basic version of the method allowed to reduce that time to 26% and optimization of product placement with the methods with the improvements, as multiple restart and multi-parent crossover to 21%.

Random products of maps synchronizing on average

We present a necessary and sufficient condition for a random product of maps on a compact metric space to be (strongly) synchronizing on average.

Orthogonal and symplectic Harish-Chandra integrals and matrix product ensembles

In this paper, we highlight the role played by orthogonal and symplectic Harish-Chandra integrals in the study of real-valued matrix product ensembles. By making use of these integrals and the matrix-valued Fourier-Laplace transform, we find the explicit eigenvalue distributions for particular Hermitian anti-symmetric matrices and Hermitian anti-self dual matrices, involving both sums and products. As a consequence of these results, the eigenvalue probability density function of the random product structure [Formula: see text], where each [Formula: see text] is a standard real Gaussian matrix, and [Formula: see text] is a real anti-symmetric matrix can be determined. For [Formula: see text] and [Formula: see text] the bidiagonal anti-symmetric matrix with 1’s above the diagonal, this reclaims results of Defosseux. For general [Formula: see text], and this choice of [Formula: see text], or [Formula: see text] itself a standard Gaussian anti-symmetric matrix, the eigenvalue distribution is shown to coincide with that of the squared singular values for the product of certain complex Gaussian matrices first studied by Akemann et al. As a point of independent interest, we also include a self-contained diffusion equation derivation of the orthogonal and symplectic Harish-Chandra integrals.