Our conference covers three related subjects: quantum faulttolerance magic states and resource theories and quantum computational phases of matter. The linking elements between them are (a) on the phenomenological side the persistence of computational power under perturbations and (b) on the theory side symmetry. The latter is necessary for the working of all three. The subjects are close but not identical and we expect crossfertilization between them.Fault tolerance is an essential component of universal scalable quantum computing.However known practical methods of achieving fault tolerance are extremely resource intensive. Distillation of magic states is in the current paradigm of faulttolerance the costliest operational component by a large margin. It is therefore pertinent to improve the efficiency of such procedures study theoretical limits of efficiency and more generally to establish a resource theory of quantum state magic. During the workshop we will focus on a fundamental connection between faulttolerant protocols and symmetries.``Computational phases of matters are a surprising link between quantum computation and condensed matter physics. Namely in the presence of suitable symmetries the ground states of spin Hamiltonians have computational power within the scheme of measurementbased quantum computation and this power is uniform across physical phases. Several computationally universal phases have to date been discovered. This subject is distinct from the above but linked to them by the feature of persistence of computational power under deformations and deviations.
Format results

Symmetry, topology, and thermal stability
Stephen Bartlett University of Sydney

Symmetryprotected topologically ordered phases for measurementbased quantum computation
Akimasa Miyake University of New Mexico

A resource theory of nonclassicality in Bell scenarios
Robert Spekkens Perimeter Institute for Theoretical Physics

Variational Quantum Eigensolvers and contextuality
Peter Love Tufts University

Magic resource theories and classical simulation
Earl Campbell University of Sheffield

Classical algorithms for quantum mean values
David Gosset Institute for Quantum Computing (IQC)

Finegrained quantum supremacy and stabilizer rank
Tomoyuki Morimae Kyoto University

Towards local testability for quantum coding
Anthony Leverrier French Institute for Research in Computer Science and Automation


Stabilizer codes for prime power qudits
Daniel Gottesman University of Maryland, College Park

Nogo theorems for quantum resource purification
ZiWen Liu Tsinghua University
