Researchers have made a breakthrough in quantum mechanics by compressing fundamental operators, which are typically unbounded, into finite rank compressions. This approach allows for the extraction of partial information about the operators and their properties, driven by the needs of photonic quantum computing. By combining quantum theory and orthogonal polynomial theory, a natural finite rank compression of the position and momentum operators is achieved, leveraging the roots of Hermite polynomials. This innovative method provides new insights into the properties of these operators, enabling the development of more efficient quantum computing protocols1. The implications of this research are significant, as advances in quantum computing continue to challenge traditional notions of computation and cryptography, potentially leading to major shifts in the field. So what matters to practitioners is that these developments may soon force a reevaluation of current cryptographic standards and protocols.