A quantum computer is like an orchestra without a conductor: each qubit is a musician, and the slightest slip throws off the entire symphony. To keep the music from turning into cacophony, quantum error-correcting codes were invented. One of the most promising approaches is to encode information not in individual particles but in entire light waves, so-called bosonic codes.
But there is a catch. Creating such a code requires special “non-Gaussian” states of light — musical phrases with an unusual rhythm, so to speak. Preparing them is a complex and costly process. The authors proposed measuring the “resourcefulness” of such states using a quantity called stellar rank (a measure of how far the state deviates from an ordinary, “Gaussian” one). It turned out that with a limited stellar rank, a trade-off emerges: you can make a code very close to ideal, but then it will either consume too much energy or be poorly protected against errors.
The researchers went further and directly optimized codes at a fixed rank. Curious things emerged. If the main problem is photon loss (light “leaks” away), the optimal code shape resembles a lattice. If the noise is caused by dephasing of the photon number (light “jitters”), the code becomes almost circular, like a target. And for protection against dephasing, a rank of k=2 sufficed for the code to start performing better than without error correction. For photon loss, a higher rank was required.
Thus, stellar rank becomes not just a mathematical abstraction but a practical tool: it tells us how complex our “light orchestra” must be to play the quantum symphony without false notes.
as written by the authors arXiv:2607.06404
Bosonic quantum error correction (QEC) relies on non-Gaussian bosonic encodings whose preparation cost is a central practical constraint. In this work, we use stellar rank as a resource measure to design and benchmark bosonic codes under finite non-Gaussian resources. For fixed cat and Gottesman--Kitaev--Preskill (GKP) code families, we show that finite stellar rank creates a trade-off among state approximability, energy, and logical protection under photon loss and photon-number dephasing, evaluated with optimal recovery. This trade-off implies that codewords with better ideal error-correction properties need not be optimal once finite-rank preparation constraints are imposed. Going beyond fixed-target codewords, we directly optimize bosonic encodings at fixed stellar rank, revealing noise-adapted code structures and concrete resource thresholds. Grid-like encodings emerge under photon loss, whereas approximately rotation-symmetric encodings arise under dephasing. In the optimized search, stellar rank k=2 suffices to surpass break-even for all dephasing strengths considered, while under photon loss the required rank increases with the loss rate. These results establish stellar rank as an operationally meaningful resource measure for bosonic QEC under practical state-preparation constraints.
The stellar rank is named after the shape that the state function takes on the phase plane: for an ideal Gaussian state, there is a single point, while for a non-Gaussian one, there is a starry scatter.
In Neal Stephenson’s novel “Anathem,” quantum computers of ancient civilizations used light codes for computations that were immune to noise.