DF pētnieks Mārtiņš Kokainis piedalījies konferencē ar stenda referātu:
- S. Aaronson, A. Ambainis, J. Iraids, M. Kokainis and J. Smotrovs. "Block multilinear polynomials, Grothendieck's inequality and a characterization of 1-query quantum algorithms"
- A.Rai, A.Ambainis and D.Kravchenko. "Optimal Classical Random Access Codes Using Single d-level Alphabets"
- N. Nahimov and A. Rivosh "Quantum walks on two-dimensional grids with multiple marked locations"
- "Quantum Walks through Potential Barriers"
- Andris Ambainis, Aleksandrs Belovs, Oded Regev and Ronald de Wolf. Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing
- Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Juris Smotrovs and Miklos Santha. Separations in Query Complexity Based on Pointer Functions
- Scott Aaronson and Andris Ambainis. Forrelation: A Problem that Optimally Separates Quantum from Classical Computing
Daļa pētnieku pirms konferences piedalījās arī ziemas skolā, kas tika organizēta Kalgari universitātē pirms konferences.
- <link https: ucalgary.ca qip2016>Plašāk par konferenci