Quantum computers are promising for simulations of chemical and physical systems, but the
limited capabilities of today's quantum processors permit only small, and often approximate …

We describe a universal scheme of quantum computation by state injection on rebits (states
with real density matrices). For this scheme, we establish contextuality and Wigner function …

A central question in quantum computation is to identify the resources that are responsible
for quantum speed-up. Quantum contextuality has been recently shown to be a resource for …

Error-correcting codes protect quantum information and form the basis of fault-tolerant
quantum computing. Leading proposals for fault-tolerant quantum computation require …

We propose a method for classical simulation of finite-dimensional quantum systems, based
on sampling from a quasiprobability distribution, ie, a generalized Wigner function. Our …

Quantum phases of matter are resources for notions of quantum computation. In this work,
we establish a new link between concepts of quantum information theory and condensed …

Clifford gates are a winsome class of quantum operations combining mathematical
elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford …

Investigating the classical simulability of quantum circuits provides a promising avenue
towards understanding the computational power of quantum systems. Whether a class of …

Discriminating between quantum computing architectures that can provide quantum
advantage from those that cannot is of crucial importance. From the fundamental point of …

We propose an extension to the Pauli stabiliser formalism that includes fractional $2\pi/N $
rotations around the $ Z $ axis for some integer $ N $. The resulting generalised stabiliser …