Near invariance of the hypercube
Combinatorics
2014-10-13 v2 Probability
Abstract
We give an almost-complete description of orthogonal matrices of order that "rotate a non-negligible fraction of the Boolean hypercube onto itself," in the sense that where is sampled uniformly over . In particular, we show that such matrices 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.
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