The symplectic rank of non-Gaussian quantum states (2504.19319v1)

Abstract: Non-Gaussianity is a key resource for achieving quantum advantages in bosonic platforms. Here, we investigate the symplectic rank: a novel non-Gaussianity monotone that satisfies remarkable operational and resource-theoretic properties. Mathematically, the symplectic rank of a pure state is the number of symplectic eigenvalues of the covariance matrix that are strictly larger than the ones of the vacuum. Operationally, it (i) is easy to compute, (ii) emerges as the smallest number of modes onto which all the non-Gaussianity can be compressed via Gaussian unitaries, (iii) lower bounds the non-Gaussian gate complexity of state preparation independently of the gate set, (iv) governs the sample complexity of quantum tomography, and (v) bounds the computational complexity of bosonic circuits. Crucially, the symplectic rank is non-increasing under post-selected Gaussian operations, leading to strictly stronger no-go theorems for Gaussian conversion than those previously known. Remarkably, this allows us to show that the resource theory of non-Gaussianity is irreversible under exact Gaussian operations. Finally, we show that the symplectic rank is a robust non-Gaussian measure, explaining how to witness it in experiments and how to exploit it to meaningfully benchmark different bosonic platforms. In doing so, we derive lower bounds on the trace distance (resp. total variation distance) between arbitrary states (resp. classical probability distributions) in terms of the norm distance between their covariance matrices, which may be of independent interest.