Quantum information reading group: 2007-2008 season

Date	Who	Topic	Notes
15 Jan	Aram Harrow
29 Jan	Ashley Montanaro	A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing
12 Feb	Richard Low
26 Feb	Jonathan Allcock
10 Mar	Richard Jozsa
17 Mar	Tristan Moriarty
1 Apr	Toby Cubitt
15 Apr	Juerg Wullschleger
29 Apr	Tom Lawson
13 May	Nadav Yoran

Possible papers (any suggestions welcome):

• Simulating Quantum Correlations with Finite Communication (Oded Regev and Ben Toner)
• Unbounded violation of tripartite Bell inequalities (D. Perez-Garcia, M.M Wolf, C. Palazuelos, I. Villanueva, M. Junge)
• Estimating Jones polynomials is a complete problem for one clean qubit (Peter Shor and Stephen Jordan)
• A nearly optimal discrete query quantum algorithm for evaluating NAND formulas (Andris Ambainis)
• Quantum t-designs: t-wise independence in the quantum world (Andris Ambainis and Joe Emerson)
• Random unitaries give quantum expanders (M. B. Hastings)
• Bounding the set of quantum correlations (Miguel Navascues, Stefano Pironio, Antonio Acin)
• The learnability of quantum states (Scott Aaronson)
• Quantum information and the PCP theorem (Ran Raz)
• Quantum color-coding is better (Joshua Von Korff and Julia Kempe)
• A subexponential-time quantum algorithm for the dihedral hidden subgroup problem (Greg Kuperberg)