Gaussian Purification Quotients and Fixed Nielsen Penalties

Abstract

Information distance and circuit complexity are both obtained by minimizing lengths, but they minimize over different objects. We make this distinction explicit for faithful one-mode Gaussian states. First, invariant-form uniqueness implies that no positive-definite quadratic gate cost can be invariant under the full adjoint action of the noncompact symplectic group; a positive Cartan majorant necessarily introduces additional reference data. The Uhlmann purification quotient realizes the Bures metric, and the radial covariance direction requires a system-ancilla coupling because system-only Gaussian unitaries preserve the Williamson eigenvalue. We then minimize fixed right-invariant quadratic norms on the minimal two-mode Gaussian gate algebra \(\mathfrak{sp}(4,\mathbb R)\). For the unweighted Frobenius norm, the quotient coefficients for radial and traceless covariance tangents are $G_0=[\hbar^2(u-1)]^{-1}$ and $G_2=[\hbar^2(3u-1)]^{-1}$, where $u=(2\nu/\hbar)^2$. Their ratio does not equal the Bures ratio. The radial coefficient, however, reproduces the Bures value exactly at every $u$; the mismatch is confined to the traceless sector. More generally, a constant block-diagonal two-weight schedule gives $G_0/G_2=1+2(\beta/\alpha)u/(u-1)$; matching Bures throughout the isotropic family would require the state-dependent relation $\beta/\alpha=1/u$. At the Bures-Fisher determinant crossing \(u=\varphi\), pointwise matching is possible only by inserting $\beta/\alpha=\varphi^{-1}$. Thus the Bures purification quotient is an exact state-geometric cost, but it is neither an unweighted symplectic gate cost nor a member of this fixed two-weight Nielsen family. The existence of a more general fixed positive gate norm realizing the quotient remains open.