arXiv:2609.20987
Isometry Groups of Right Invariant Metrics in Geometric Quantum Complexity
Xiaobo Liu, Lei Zheng
Abstract
In this paper, we give a complete description for the full isometry groups of a class of right invariant Riemannian metrics on the special unitary group $\mathrm{SU}(2^N)$. These metrics have been used by physicists to study Nielsen's geometric approach for complexities in quantum computations.
AI Summary
Nielsen’s geometric approach models quantum complexity using distances on $\mathrm{SU}(2^N)$ with right-invariant metrics that penalize high-weight Pauli directions. This paper addresses the classification of all distance-preserving transformations for penalty metrics whose Pauli-string squared norms depend only on weight, through positive factors $q_1,\ldots,q_N$. For $N\geq2$, the main theorem assumes that every metric-preserving group automorphism preserves the span $W_1$ of weight-one Pauli directions. Under this condition, the full isometry group is $\mathrm{SU}(2^N)\rtimes((\mathrm{SO}(3)^N\rtimes\mathbb Z_2)\rtimes S_N)$. Thus every isometry is generated by right translations, conjugation by tensor products of single-qubit unitaries, complex conjugation, and qubit permutations. The condition holds whenever $q_1\neq q_k$ for every $k>1$, covering the binomial and exponential metrics considered here. It also holds for cliff metrics with $q_1=q_2=1$ and $q_k=q>1$ for $k\geq3$, provided $N\geq3$. The proof first uses results on invariant metrics on compact simple Lie groups to identify the connected identity stabilizer with local-unitary conjugations. A multiplicity-free representation decomposition determines its orthogonal normalizer, leaving support-dependent sign changes as possible extra symmetries. Curvature preservation reduces these to four parity-dependent choices; symmetric-space classification excludes two for non-bi-invariant metrics. The classification is conditional rather than applicable to every penalty schedule. In particular, the two-qubit cliff metric is bi-invariant and lies outside the stated hypothesis. No circuit-complexity bounds or explicit distance formulas are derived.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 28 pages