Proof of hiding conjecture in Gaussian boson sampling
Quantum 10, 2248 (2026). https://doi.org/10.22331/q-2026-10-27-2248 Gaussian boson sampling (GBS) is a promising protocol for demonstrating quantum computational advantage. One of the key steps in the argument for classical hardness of GBS is the so-called “hiding conjecture'', which asserts that one can “hide'' a complex Gaussian matrix as a submatrix of the symmetric product of Haar unitary submatrices in total variation distance. In this paper, we prove the hiding…