k-Uniform states are fundamental to quantum information and computing, with applications in multipartite entanglement and quantum error-correcting codes (QECCs). Prior work has primarily focused on constructing exact
k-uniform states or proving their nonexistence. However, due to inevitable theoretical approximations and experimental imperfections, generating exact
k-uniform states is neither feasible nor necessary in practice. In this work, we initiate the study of approximate
k-uniform states, demonstrating that they are locally indistinguishable from their exact counterparts unless massive measurements are performed. We prove that such states can be constructed with high probability from the Haar-random ensemble and, more efficiently, via shallow random quantum circuits. Furthermore, we establish a connection between approximate
k-uniform states and approximate QECCs, showing that Haar random constructions yield high-performance codes with linear rates, vanishing proximity, and exponentially small failure probability while random circuits can't construct codes with linear code rate in shallow depth. Finally, we investigate the relationship between approximate QECCs and approximate quantum information masking. Our work lays the foundation for the practical application of
k-uniform states.
The random purification channel maps n copies of any mixed quantum state to n copies of a random purification of the state. We generalize this construction to arbitrary symmetries: for any group G of unitaries, we construct a quantum channel that maps states contained in the algebra generated by G to random purifications obtained by twirling over G. In addition to giving a surprisingly concise proof of the original random purification theorem, our result implies the existence of fermionic and bosonic Gaussian purification channels. As applications, we obtain the first tomography protocol for fermionic Gaussian states that scales optimally with the number of modes and the error, as well as an improved property test for this class of states.
In quantum information geometry, the curvature of von-Neumann entropy and relative entropy induce a natural metric on the space of mixed quantum states. Here we use this information metric to construct a random matrix ensemble for states and investigate its key statistical properties such as the asymptotic eigenvalue density and mean entropy. We present an algorithm for generating these entropy-based random density matrices, thus providing a new recipe for random state generation that differs from the well established Hilbert-Schmidt and Bures-Hall ensemble approaches. We also prove a duality between the entropy-based state ensemble and a random Hamiltonian model constructed from the thermodynamic length over the set of Gibbs states. This Hamiltonian model is found to display Wigner level repulsion, implying that the dual state ensemble can be realised as a random Gibbs state with respect to a class of chaotic Hamiltonians. As an application we use our model to compute the survival probability of a randomly evolved thermofield double state, predicting a ramp and plateau over time that is characteristic of quantum chaos. For other applications, the entropy-based ensemble can be used as an uninformative prior for Bayesian quantum state or Hamiltonian tomography.