Pre-recorded talks – Monday, July 5th – Youtube playlist
| Time UTC+3 | |
|---|---|
| 10:00 | Invited talk: Cécilia Lancien Typical correlations and entanglement in random MPS and PEPS |
| 10:50 | Break |
| 11:15 | Even more efficient quantum computations of chemistry through tensor hypercontraction Joonho Lee, Dominic Berry, Craig Gidney, William Huggins, Jarrod McClean, Nathan Wiebe and Ryan Babbush |
| 11:25 | Quantum simulation with randomized product formulas: A concentration analysis Chi-Fang Chen, Hsin-Yuan Huang, Richard Kueng and Joel Tropp |
| 11:35 | A game of quantum advantage: linking verification and simulation Daniel Stilck França and Raul Garcia-Patron Sanchez |
| 11:45 | Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states Michal Oszmaniec, Ninnat Dangniam, Mauro Morales and Zoltan Zimboras |
| 11:55 | Efficient verification of Boson Sampling Ulysse Chabaud, Frédéric Grosshans, Elham Kashefi and Damian Markham |
| 12:05 | Break |
| 12:30 | Covariance Decomposition as a Universal Limit on Correlations in Networks Salman Beigi and Marc-Olivier Renou |
| 12:40 | Genuine multipartite nonlocality is intrinsic to pure-state quantum networks Patricia Contreras Tejada, Carlos Palazuelos and Julio de Vicente |
| 12:50 | A family of additive multipartite entanglement measures Péter Vrana |
| 13:00 | Enumerating all bilocal Clifford distillation protocols through symmetry reduction Sarah Jansen, Kenneth Goodenough, Sebastian de Bone, Dion Gijswijt and David Elkouss |
| 13:10 | Quasi-polynomial time algorithms for quantum games in bounded dimension Hyejung Hailey Jee, Carlo Sparaciari, Omar Fawzi and Mario Berta |
| 13:20 | Break |
| 17:00 | Open problem session |
| 17:50 | Break |
| 18:15 | Quantum Logarithmic Space and Post-Selection Francois Le Gall, Harumichi Nishimura and Abuzer Yakaryilmaz |
| 18:25 | Quantum Proofs of Proximity Marcel Dall’Agnol, Tom Gur, Subhayan Roy Moulik and Justin Thaler |
| 18:35 | Leveraging Unknown Structure in Quantum Query Algorithms Noel Anderson, Jay-U Chung and Shelby Kimmel |
| 18:45 | Quantum Pseudorandomness and Classical Complexity William Kretschmer |
| 18:55 | Bounds on the QAC0 Complexity of Approximating Parity Gregory Rosenthal |
| 19:05 | Break |
| 19:30 | Reducing the CNOT count for Clifford+T circuits on NISQ architectures Vlad Gheorghiu, Sarah Meng Li, Michele Mosca and Priyanka Mukhopadhyay |
| 19:40 | Implementing a fast unbounded quantum fanout gate using power-law interactions Andrew Guo, Abhinav Deshpande, Su-Kuan Chu, Zachary Eldredge, Przemyslaw Bienias, Dhruv Devulapalli, Yuan Su, Andrew Childs and Alexey Gorshkov |
| 19:50 | [Talk rescheduled] |
| 20:00 | Charge-conserving unitaries typically generate optimal covariant quantum error-correcting codes Linghang Kong and Zi-Wen Liu |
| 20:10 | Private learning implies quantum stability Srinivasan Arunachalam, Yihui Quek and John Smolin |
| 20:20 | END |