Quantum randomness is an essential key to understanding the dynamics of complex many-body systems and also a powerful tool for quantum engineering. However, exact realizations of quantum randomness take an extremely long time and are infeasible in many-body systems, leading to the notion of quantum pseudorandomness, also known as unitary designs. Here, to explore microscopic dynamics of generating quantum pseudorandomness in many-body systems, we provide new efficient constructions of unitary designs and propose a design Hamiltonian, a random Hamiltonian of which dynamics always forms a unitary design after a threshold time. The new constructions are based on the alternate applications of random potentials in the generalized position and momentum spaces, and we provide explicit quantum circuits generating quantum pseudorandomness significantly more efficient than previous ones. We then provide a design Hamiltonian in disordered systems with periodically changing spin-glass-type interactions. The design Hamiltonian generates quantum pseudorandomness in a constant time even in the system composed of a large number of spins. We also point out the close relationship between the design Hamiltonian and quantum chaos.

We derive fundamental constraints for the Schur complement of positive matrices, which provide an operator strengthening to recently established information inequalities for quantum covariance matrices, including strong subadditivity. This allows us to prove general results on the monogamy of entanglement and steering quantifiers in continuous variable systems with an arbitrary number of modes per party. A powerful hierarchical relation for correlation measures based on the log-determinant of covariance matrices is further established for all Gaussian states, which has no counterpart among quantities based on the conventional von Neumann entropy.

Unitary 2-designs are random unitaries simulating up to the second order statistical moments of the uniformly distributed random unitaries, often referred to as Haar random unitaries. They are used in a wide variety of theoretical and practical quantum information protocols, and also have been used to model the dynamics in complex quantum many-body systems. Here, we show that unitary 2-designs can be approximately implemented by alternately repeating random unitaries diagonal in the Pauli-Z basis and that in the Pauli-X basis. We also provide a converse about the number of repetitions needed to achieve unitary 2-designs. These results imply that the process after repetitions achieves a Θ(d − )approximate unitary 2-design. Based on the construction, we further provide quantum circuits that efficiently implement approximate unitary 2-designs. Although a more efficient implementation of unitary 2-designs is known, our quantum circuit has its own merit that it is divided into a constant number of commuting parts, which enables us to apply all commuting gates simultaneously and leads to a possible reduction of an actual execution time. We finally interpret the result in terms of the dynamics generated by time-dependent Hamiltonians and provide for the first time a random disordered time-dependent Hamiltonian that generates a unitary 2-design after switching interactions only a few times.

Abstract-Many determinantal inequalities for positive definite block matrices are consequences of general entropy inequalities, specialised to Gaussian distributed vectors with prescribed covariances. In particular, strong subadditivity (SSA) yields ln det VAC + ln det VBC − ln det VABC − ln det VC ≥ 0 for all 3 × 3-block matrices VABC , where subscripts identify principal submatrices. We shall refer to the above inequality as SSA of log-det entropy. In this paper we develop further insights on the properties of the above inequality and its applications to classical and quantum information theory.In the first part of the paper, we show how to find known and new necessary and sufficient conditions under which saturation with equality occurs. Subsequently, we discuss the role of the classical transpose channel (also known as Petz recovery map) in this problem and find its action explicitly. We then prove some extensions of the saturation theorem, by finding faithful lower bounds on a log-det conditional mutual information.In the second part, we focus on quantum Gaussian states, whose covariance matrices are not only positive but obey additional constraints due to the uncertainty relation. For Gaussian states, the log-det entropy is equivalent to the Rényi entropy of order 2. We provide a strengthening of log-det SSA for quantum covariance matrices that involves the so-called Gaussian Rényi-2 entanglement of formation, a well-behaved entanglement measure defined via a Gaussian convex roof construction. We then employ this result to define a log-det entropy equivalent of the squashed entanglement measure, which is remarkably shown to coincide with the Gaussian Rényi-2 entanglement of formation. This allows us to establish useful properties of such measure(s), like monogamy, faithfulness, and additivity on Gaussian states.