Abstract
We give an almost-complete description of orthogonal matrices M of order n that “rotate a non-negligible fraction of the Boolean hypercube C n = {-1, 1}n onto itself,” in the sense that \(P_{x \in C_n } \left( {M_x \in C_n } \right) \geqslant n^{ - C} \), for some positive constant C, where x is sampled uniformly over C n . In particular, we show that such matrices M must be very close to products of permutation and reflection matrices. This result is a step toward characterizing those orthogonal and unitary matrices with large permanents, a question with applications to linear-optical quantum computing.
Similar content being viewed by others
References
S. Aaronson, http://mathoverflow.net/questions/172723/.
S. Aaronson and A. Arkhipov, The computational complexity of linear optics, Theory of Computing 9 2013, 143–252.
S. Aaronson and T. Hance, Generalizing and derandomizing Gurvits’s approximation algorithm for the permanent, Quantum Information and Computation 14 (2014), 541–559.
N. Alon, Perturbed identity matrices have high rank: proof and applications, Combinatorics, Probability and Computing 18 2009, 3–15.
P. Erdos, On a lemma of Littlewood and Offord, Bulletin of the American Mathematical Society 51 1945, 898–902.
D. Glynn, The permanent of a square matrix, European Journal of Combinatorics 31 2010, 1887–1891.
H. Nguyen and V. Vu, Optimal inverse Littlewood–Offord theorems, Advances in Mathematics 226 2011, 5298–5319.
T. Tao and V. Vu, On the singularity probability of random Bernoulli matrices, Journal of the American Mathematical Society 20 2007, 603–628.
T. Tao and V. Vu, Inverse Littlewood–Offord theorems and the condition number of random matrices, Annals of Mathematics 169 2009, 595–632.
T. Tao and V. Vu, A sharp inverse Littlewood–Offord theorem, Random Structures & Algorithms 37 2010, 525–539.
Author information
Authors and Affiliations
Corresponding author
Additional information
S. Aaronson is supported by an NSF Waterman Award.
H. Nguyen is supported by research grant DMS-1358648.
Rights and permissions
About this article
Cite this article
Aaronson, S., Nguyen, H. Near invariance of the hypercube. Isr. J. Math. 212, 385–417 (2016). https://doi.org/10.1007/s11856-016-1291-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11856-016-1291-z