| Time GMT+3 |
||
|---|---|---|
| 10:00 | Thomas Monz (INVITED TALK) Experimental quantum error correction: from qubit loss to lattice surgery |
|
| 10:50 | Information theory | Non-additivity in classical-quantum wiretap channels Arkin Tikku, Mario Berta and Joseph M. Renes |
| 11:15 | Coffee break | |
| 11:45 | Computational complexity | Tight Quantum Lower Bound for Approximate Counting with Quantum States Aleksandrs Belovs and Ansis Rosmanis |
| 12:10 | Quantum algorithms for computational geometry problems Andris Ambainis and Nikita Larka |
|
| 12:35 | Quantum Coupon Collector Srinivasan Arunachalam, Aleksandrs Belovs, Andrew Childs, Robin Kothari, Ansis Rosmanis and Ronald de Wolf |
|
| 13:00 | Lunch break | |
| 15:00 | Quantum tomography | Building trust for continuous variable quantum states Ulysse Chabaud, Tom Douce, Frédéric Grosshans, Elham Kashefi and Damian Markham |
| 15:25 | Spectral Quantum Tomography Jonas Helsen, Francesco Battistel and Barbara Terhal |
|
| 15:50 | Coffee break | |
| 16:20 | Hamiltonian complexity | Improved local spectral gap thresholds for lattices of finite dimension Anurag Anshu |
| 16:45 | Slightly beyond product state approximations for a quantum analogue of Max Cut Anurag Anshu, David Gosset and Karen Morenz |
|
| 17:10 | Computing partition functions in the one clean qubit model Anirban Chowdhury, Rolando Somma and Yigit Subasi |
|
| 17:35 | Optimal Protocols in Quantum Annealing and QAOA Problems Lucas Brady, Christopher Baldwin, Aniruddha Bapat, Alexey Gorshkov and Yaroslav Kharkov |
|
| 18:00 | Coffee break | |
| 18:30 | Error correction | A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum Computing Das Poulami, Christopher Pattison, Srilatha Manne, Doug Carmean,Krysta Svore, Moinuddin Qureshi and Nicolas Delfosse |
| 18:55 | Fast and effective techniques for T-count reduction via spider nest identities Niel De Beaudrap, Xiaoning Bian and Quanlong Wang |
|
| 19:20 | End | |