To run large-scale algorithms on a quantum computer, error-correcting codes must be able
to perform a fundamental set of operations, called logic gates, while isolating the encoded …

We construct a Pauli stabilizer model for every two-dimensional Abelian topological order
that admits a gapped boundary. Our primary example is a Pauli stabilizer model on four …

Representation by neural networks, in particular by restricted Boltzmann machines (RBMs),
has provided a powerful computational tool to solve quantum many-body problems. An …

We provide the first tensor-network method for computing quantum weight enumerator
polynomials in the most general form. If a quantum code has a known tensor-network …

We introduce a driven-dissipative two-mode bosonic system whose reservoir causes
simultaneous loss of two photons in each mode and whose steady states are superpositions …

Randomised benchmarking is a widely used experimental technique to characterise the
average error of quantum operations. Benchmarking procedures that scale to enable the …

Recently, an algorithm has been constructed that shows that the binary icosahedral group 2I
together with a T-like gate forms the most efficient single-qubit universal gate set. To carry …

Topological entanglement entropy has been regarded as a smoking-gun signature of
topological order in two dimensions, capturing the total quantum dimension of the …

In this paper, we introduce an algorithm for extracting topological data from translation
invariant generalized Pauli stabilizer codes in two-dimensional systems, focusing on the …

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 …