Robustness of Hidden-Variable Theories and Matrix Scaling
Abstract
Motivated by quantum foundations and complexity theory, Aaronson formalized a hidden-variable theory inspired by a proposal by Schrödinger. To any quantum state and unitary, this Schrödinger theory assigns a joint probability distribution via the Sinkhorn algorithm: rescale the columns and rows of the entrywise modulus of the unitary so that the marginals match the Born rule for the initial and final quantum states, respectively. He conjectured that this map is robust, i.e., inverse polynomially small perturbations in the inputs lead to inverse polynomially small perturbations of the joint distribution, which is important for complexity theoretic applications. We present a counterexample to this conjecture: We construct a pure state and two unitaries that are exponentially close, yet the joint probability distributions assigned by the Schrödinger theory differ by at least an inverse-linear term in at least one entry, and by a constant in total variation distance. We also propose a modified version of Schrödinger's theory that satisfies robustness, while retaining all of its other desirable properties. This yields a complete picture of which axioms of Aaronson can be simultaneously satisfied by hidden-variable theories.
Related
- Stability of Edelstein Hidden-Variable Fractal Interpolation Functions
- L-PASSO: Adaptive Log-penalized Variable Selector, with Sparse Selection and Robustness to the Pilot Estimator
- Near-Optimal Parallel M-Matrix Scaling
- The threshold for fractional clique decompositions of random hypergraphs, via matrix scaling
- Least-Variable Harmonic Matrix-Exponential Distributions
BibTeX
@misc{malavolta2026robustness,
title = {{Robustness of Hidden-Variable Theories and Matrix Scaling}},
author = {Giulio Malavolta and Harold Nieuwboer and Akshay Ramachandran and Michael Walter},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.14519},
eprint = {2609.14519},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.14519},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Robustness of Hidden-Variable Theories and Matrix Scaling
AU - Giulio Malavolta
AU - Harold Nieuwboer
AU - Akshay Ramachandran
AU - Michael Walter
PY - 2026
DA - 2026/09/13
PB - arXiv
DO - 10.48550/arxiv.2609.14519
UR - https://arxiv.org/abs/2609.14519
AB - Motivated by quantum foundations and complexity theory, Aaronson formalized a hidden-variable theory inspired by a proposal by Schrödinger. To any quantum state and unitary, this Schrödinger theory assigns a joint probability distribution via the Sinkhorn algorithm: rescale the columns and rows of the entrywise modulus of the unitary so that the marginals match the Born rule for the initial and final quantum states, respectively. He conjectured that this map is robust, i.e., inverse polynomially small perturbations in the inputs lead to inverse polynomially small perturbations of the joint distribution, which is important for complexity theoretic applications. We present a counterexample to this conjecture: We construct a pure state and two unitaries that are exponentially close, yet the joint probability distributions assigned by the Schrödinger theory differ by at least an inverse-linear term in at least one entry, and by a constant in total variation distance. We also propose a modified version of Schrödinger's theory that satisfies robustness, while retaining all of its other desirable properties. This yields a complete picture of which axioms of Aaronson can be simultaneously satisfied by hidden-variable theories.
ER -