Quantum Checks: The Illusion of Reliability ✎ express

Original: "Stabilizers may be poor bounds for fidelities"
· Aaron Z. Goldberg
arXiv:2512.14811 · 2025-12-16 · arXiv non-exclusive · independent analysis · 1 min
Successful tests on GKP states don’t guarantee their perfection — it’s a dangerous myth, debunked by physicists.

📄 Showing the "Simple" version — "Popular" is not ready yet. Add it to favorites to help prioritize it.

Quantum computers use GKP states, dreamed up by Alexei Kitaev, John Preskill, and Daniel Gottesman. Their hallmark is built-in stabilizer checks that catch errors. For a long time, it was believed that a successful check guaranteed a nearly perfect state. Alas, it's an illusion.

Stabilizers are like checking a passport by its silhouette: the outline matches, and you trust the person is who they claim to be. But behind those general contours, anyone could lurk. Here it's the same: spectroscopy and photometry measurements (system response) only show an upper bound on quality. The actual similarity to the ideal could be abysmally low.

This mistake has been costly: for years, researchers relied on deceptive reliability. Now it's clear: we need direct accuracy tests or entropy analysis (a measure of chaos). The irony is that these very 'unreliable' states are key to the quantum internet of the future.

Initially, GKP states were developed for optical quantum computing, but it was they that became the foundation for the concept of the quantum internet.

Scientists
Erwin SchrödingerHugh Everett IIIEmmy NoetherWolfgang PauliEnrico FermiPaul Dirac
Concepts
stabilizer code fidelity stable state greenberger horne zeilinger state fault tolerant quantum computer topological protection generalized uncertainty principle position uncertainty goodness of fit quantum thermal stability noise resistant qubit error threshold error rate logical qubit geometric phase control thermodynamic stability Fermi's golden rule bistability no-cloning theorem encryption