The symplectic rank of non-Gaussian quantum states

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.

65 pages, 4 figures

References in corpus (36)

• Logical quantum processor based on reconfigurable atom arrays
• Real-time quantum error correction beyond break-even
• A compact ion-trap quantum computing demonstrator
• A No-Go Theorem for Gaussian Quantum Error Correction
• CMOS-based cryogenic control of silicon quantum circuits
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Non-Gaussian Quantum States and Where to Find Them
• Perspective: Toward large-scale fault-tolerant universal photonic quantum computing
• Optimal estimation of losses at the ultimate quantum limit with non-Gaussian states
• Benchmarking quantum computers
• Resources for bosonic quantum computational advantage
• Certification of non-Gaussian states with operational measurements
• Universal control of a bosonic mode via drive-activated native cubic interactions
• Learning t-doped stabilizer states
• Learning efficient decoders for quasi-chaotic quantum scramblers
• Classical simulation of Gaussian quantum circuits with non-Gaussian input states
• Gaussian conversion protocols for cubic phase state generation
• Generic Entanglement and Standard Form for N-mode Pure Gaussian States
• Unscrambling Quantum Information with Clifford decoders
• Generation of Flying Logical Qubits using Generalized Photon Subtraction with Adaptive Gaussian Operations
• Query-optimal estimation of unitary channels in diamond distance
• Holomorphic representation of quantum computations
• Restoring quantum communication efficiency over high loss optical fibres
• Reversibility of quantum resources through probabilistic protocols
• Maximum tolerable excess noise in continuous-variable quantum key distribution and improved lower bound on two-way capacities
• Riemannian optimization of photonic quantum circuits in phase and Fock space
• Efficient learning of quantum states prepared with few fermionic non-Gaussian gates
• Learning quantum states of continuous variable systems
• Iterative tailoring of optical quantum states with homodyne measurements
• Gaussian conversion protocol for heralded generation of qunaught states
• Classical simulation of non-Gaussian bosonic circuits
• Quantum Optical Communication in the presence of strong attenuation noise
• No-go theorems for photon state transformations in quantum linear optics
• Classical simulation and quantum resource theory of non-Gaussian optics
• Optimal trace-distance bounds for free-fermionic states: Testing and improved tomography
• Optimal estimates of trace distance between bosonic Gaussian states and applications to learning