Volume 18 (2012)
Download this article
For screen
For printing
Recent Volumes
Volume 1, 1998
Volume 2, 1999
Volume 3, 2000
Volume 4, 2002
Volume 5, 2002
Volume 6, 2003
Volume 7, 2004
Volume 8, 2006
Volume 9, 2006
Volume 10, 2007
Volume 11, 2007
Volume 12, 2007
Volume 13, 2008
Volume 14, 2008
Volume 15, 2008
Volume 16, 2009
Volume 17, 2011
Volume 18, 2012
Volume 19, 2015
The Series
All Volumes
 
About this Series
Ethics Statement
Purchase Printed Copies
Author Index
ISSN 1464-8997 (online)
ISSN 1464-8989 (print)
 
MSP Books and Monographs
Other MSP Publications

The bosonic birthday paradox

Alex Arkhipov and Greg Kuperberg

Geometry & Topology Monographs 18 (2012) 1–7

DOI: 10.2140/gtm.2012.18.1
Bibliography
1 S Aaronson, A Arkhipov, The computational complexity of linear optics, from: "Proceedings of the 43rd annual ACM symposium on Theory of computing", STOC '11, ACM (2011) 333–342
2 W Feller, An introduction to probability theory and its applications. Vol. I, John Wiley & Sons (1968) MR0228020
3 W Fulton, J Harris, Representation theory, Graduate Texts in Mathematics 129, Springer (1991) MR1153249
4 A Cannas da Silva, Symplectic geometry, from: "Handbook of differential geometry. Vol. II", Elsevier/North-Holland (2006) 79–188 MR2194669