Skip to main content
Log in

Near invariance of the hypercube

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. S. Aaronson, http://mathoverflow.net/questions/172723/.

  2. S. Aaronson and A. Arkhipov, The computational complexity of linear optics, Theory of Computing 9 2013, 143–252.

    Article  MathSciNet  MATH  Google Scholar 

  3. S. Aaronson and T. Hance, Generalizing and derandomizing Gurvits’s approximation algorithm for the permanent, Quantum Information and Computation 14 (2014), 541–559.

    MathSciNet  Google Scholar 

  4. N. Alon, Perturbed identity matrices have high rank: proof and applications, Combinatorics, Probability and Computing 18 2009, 3–15.

    Article  MathSciNet  MATH  Google Scholar 

  5. P. Erdos, On a lemma of Littlewood and Offord, Bulletin of the American Mathematical Society 51 1945, 898–902.

    Article  MathSciNet  MATH  Google Scholar 

  6. D. Glynn, The permanent of a square matrix, European Journal of Combinatorics 31 2010, 1887–1891.

    Article  MathSciNet  MATH  Google Scholar 

  7. H. Nguyen and V. Vu, Optimal inverse Littlewood–Offord theorems, Advances in Mathematics 226 2011, 5298–5319.

    Article  MathSciNet  MATH  Google Scholar 

  8. T. Tao and V. Vu, On the singularity probability of random Bernoulli matrices, Journal of the American Mathematical Society 20 2007, 603–628.

    Article  MathSciNet  MATH  Google Scholar 

  9. T. Tao and V. Vu, Inverse Littlewood–Offord theorems and the condition number of random matrices, Annals of Mathematics 169 2009, 595–632.

    Article  MathSciNet  MATH  Google Scholar 

  10. T. Tao and V. Vu, A sharp inverse Littlewood–Offord theorem, Random Structures & Algorithms 37 2010, 525–539.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Scott Aaronson.

Additional information

S. Aaronson is supported by an NSF Waterman Award.

H. Nguyen is supported by research grant DMS-1358648.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11856-016-1291-z

Keywords

Navigation