Thursday, June 11th

10:00 Elena Kirshanova (INVITED TALK)
Quantum speed-ups for sieving algorithms for the shortest vector problem
10:50 Information processing Self-testing of a single quantum device under computational assumptions
Tony Metger and Thomas Vidick
11:15 Coffee break
11:45 Information theory Optimizing the fundamental limits for quantum and private communication & Quantum flags, and new bounds on the quantum capacity of the depolarizing channel
Xin Wang & Marco Fanizza, Farzad Kianvash and Vittorio Giovannetti
12:20 Encoding classical information into quantum resources
Kamil Korzekwa, Zbigniew Puchała, Marco Tomamichel and Karol Życzkowski
12:45 Second-order asymptotics of quantum data compression and state merging
Dina Abdelhadi and Joseph M. Renes
13:10

Poster session






18:05 Computational complexity A Framework of Quantum Strong Exponential-Time Hypotheses
Harry Buhrman, Subhasree Patro and Florian Speelman
18:30 On Quantum Complexity for Closest Pair and Orthogonal Vectors
Scott Aaronson, Nai-Hui Chia, Han-Hsuan Lin, Chunhao Wang and Ruizhe Zhang
18:55 Improved Approximate Degree Bounds Fork-distinctness
Nikhil Mande, Justin Thaler and Shuchen Zhu
19:20 End