Hi everyone, I wanted to let you know that, this coming Monday (2-4 in Patil/Kiva) and Wednesday (2-5 in Star), we're going to have brief student project presentations for 6.845 Quantum Complexity Theory. Everyone in the MIT QIP community is welcome to attend and learn about some great projects. The schedule is below. All the best, Scott Monday Dec. 10 in Patil/Kiva 32-449 from 2-4 pm 8 presentations: 2:05 Shalev Ben-David - Decision-tree complexity 2:18 Arturs Backurs - Influences in low-degree polynomials 2:31 Badih Ghazi - Reichardt's span-program characterization 2:44 Charles Epstein - Adiabatic quantum computing 2:57 BREAK 3:04 Travis Hance - Interactive proof systems with entangled provers 3:17 Daniel Fremont - Quantum automata 3:30 Adam Bouland - Universality of beamsplitters 3:43 Edwin Ng - Fermions in quantum complexity theory Wednesday Dec. 12 in Star 32-D463 from 2-5 pm 14 presentations: 2:05 Adam Bookatz - QMA-complete problems 2:17 Shravas Rao - Nonabelian Hidden Subgroup Problem 2:29 Jenny Barry - Quantum POMDPs 2:41 Matt Johnson (project with Frank Permenter) - Quantum query complexity, SDPs, and duality 2:53 Adrian Vladu - Quantum query complexity of graph problems 3:05 Mohammad Bavarian - Weak algorithms for PARITY and related problems 3:17 Matt Falk - "Quantum-robot query complexity" on grid graphs 3:29 BREAK 3:36 Vincent Liew - Complexity of stabilizer circuit manipulations 3:48 Ted Yoder - A certain generalization of the stabilizer formalism 4:00 Emily Stark - Quantum security of classical cryptographic constructions 4:12 Matt Coudron and Henry Yuen - Certifiable randomness expansion 4:24 Charles Herder - Blind quantum computation 4:36 Max Zimet - Complexity of quantum field theories 4:48 Chris Graves - Quantum fault-tolerance _______________________________________________ qip mailing list qip(a)mit.edu http://mailman.mit.edu/mailman/listinfo/qip