- A-212 (STCS Seminar Room)
algorithms running in polynomial space. This was a decade long open problem in quantum computational complexity and is an excellent piece of work.
We shall refresh our memories on quantum computation and interactive proofs if needed. Earlier work showing that quantum interactive proofs need use at most three messages will also be briefly discussed. The first lecture will be a high level teaser of things to come.