Abstracts for the talks and posters can be found in the book of abstracts.
Wednesday (May 20)
| 8:30 | Registration |
| 9:00 | Invited talk:
Majorana particles with noise: problems with braiding anyons |
| 9:45 | Area law for fixed points of rapidly mixing dissipative quantum systems |
| 10:10 | The spin-2 AKLT state on the square lattice is universal for measurement-based quantum computation |
| 10:35 | Coffee break |
| 11:05 | Computation in generalised probabilistic theories |
| 11:30 | Local hidden variable models for entangled quantum states using finite shared randomness |
| 11:55 | The resource theory of steering |
| 12:20 | Lunch |
| 14:00 | Sampling quantum nonlocal correlations with high probability |
| 14:25 | On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings |
| 14:50 | Implementing unitary 2-designs using random diagonal-unitary matrices |
| 15:15 | Quantum Circuits for Isometries |
| 15:40 | Coffee break |
| 16:00 | Poster session |
Thursday (May 21)
| 9:00 | Invited talk:
Quantum property testing: A survey and one new result |
| 9:45 | Hierarchy of efficiently computable and faithful lower bounds to quantum discord |
| 10:10 | Quantum capacity can be greater than private information for arbitrarily many uses |
| 10:35 | Coffee break |
| 11:05 | Round elimination in exact communication complexity |
| 11:30 | Rate-loss analysis of an efficient quantum repeater architecture |
| 11:55 | Renormalising entanglement distillation |
| 12:20 | Lunch |
| 14:00 | Invited talk:
Unbounded entanglement can be needed to achieve the optimal success probability |
| 14:45 | Quantum enhancement of randomness distribution |
| 15:10 | Semidefinite programs for randomness extractors |
| 15:35 | Coffee break |
| 16:05 | Interferometric versus projective measurement of anyons |
| 16:30 | Qudit (Gauge) Colour Codes in All Spatial Dimensions |
| 16:55 | Thermalization and decoherence in open Majorana systems |
| 20:15 | Conference Dinner |
Friday (May 22)
| 9:00 | Invited talk:
A quantum algorithm for computing the unit group of an arbitrary degree number field |
| 9:45 | Oracles with Costs |
| 10:10 | A universal adiabatic quantum query algorithm |
| 10:35 | Coffee break |
| 11:05 | On the Robustness of Bucket Brigade Quantum RAM |
| 11:30 | New constructions for Quantum Money |
| 11:55 | Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model |
| 12:20 | Closing |
