The list of talks accepted at QIP 2010 is now online. As a member of the PC I can tell you that there were way more good papers than available speaking slots and made some of the final decisions hard to make.

One talk that I think will be a highlight is the invited talk by the optimizer: “Efficient simulation of quantum mechanics collapses the polynomial hierarchy.” Quantum computing skeptics of the “BQP=BPP” kind may just found their island significantly smaller and lonelier. The QIP=PSPACE will also be given a talk slot. Quite a year for quantum complexity theory, I think.