Hi everyone,
I wanted to give you the schedule for tomorrow's Quantum Complexity
project presentations. Everyone in the MIT QIS community is welcome
to attend.
All the best,
Scott
Wednesday Dec. 12 in Star 32-D463 (NOT Kiva!) 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