The Complexity Geometry of a Single Qubit
Adam R. Brown, Leonard Susskind
TL;DR
The paper investigates Nielsen's complexity geometry for a single qubit, distinguishing unitary and state complexity and contrasting with gate-counting approaches. By deriving explicit metrics on SU(2) (unitary) and on CP^1 (state space) using anisotropic penalty tensors I_{IJ}, it reveals how a tiny system already exhibits features central to multi-qubit complexity geometry, such as right-invariance without left-invariance, geodesics requiring time-dependent Hamiltonians, and regions of negative curvature (especially in easy-easy directions). The Berger-sphere and Bloch-sphere deformations illustrate how penalties reshape geometry, induce cut loci, and produce large complexity-to-inner-product distance ratios, while remaining continuous and, in principle, exact in this geometric framework. While enlightening, the single-qubit model cannot capture large-N phenomena like exponential scaling of hard directions or fractal complexity frontiers, but it serves as a concrete, tractable laboratory for foundational concepts with holographic relevance. The work thereby strengthens the case for complexity geometry as a robust, mathematically tractable notion of quantum complexity, with clear connections to rigid-body dynamics and potential implications for holography and quantum gravity.
Abstract
The computational complexity of a quantum state quantifies how hard it is to make. `Complexity geometry', first proposed by Nielsen, is an approach to defining computational complexity using the tools of differential geometry. Here we demonstrate many of the attractive features of complexity geometry using the example of a single qubit, which turns out to be rich enough to be illustrative but simple enough to be illuminating.
