English

Near invariance of the hypercube

Combinatorics 2014-10-13 v2 Probability

Abstract

We give an almost-complete description of orthogonal matrices MM of order nn that "rotate a non-negligible fraction of the Boolean hypercube Cn={1,1}nC_n=\{-1,1\}^n onto itself," in the sense that PxCn(MxCn)nC,\mboxforsomepositiveconstantC,P_{x\in C_n}(Mx\in C_n) \ge n^{-C},\mbox{ for some positive constant } C, where xx is sampled uniformly over CnC_n. In particular, we show that such matrices MM 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.

Keywords

Cite

@article{arxiv.1409.7447,
  title  = {Near invariance of the hypercube},
  author = {Scott Aaronson and Hoi Nguyen},
  journal= {arXiv preprint arXiv:1409.7447},
  year   = {2014}
}

Comments

Some incomplete formulas corrected

R2 v1 2026-06-22T06:06:20.124Z