activity
20002025
most citedFast Stabiliser Simulation with Quadratic Form Expansions

27 citations · 126 across the 13 of their papers we have counts for

collaborators

13 papers

quant-ph2025★ 1 cited

String Diagrams for Defect-Based Surface Code Computing

Mateusz Kupper, Dominic Horsman, Chris Heunen +1

Surface codes are a popular choice for implementing fault-tolerant quantum computing. Two-qubit gates may be realised in these codes using only nearest-neighbour interactions, eith…

quant-ph2023

Simple qudit ZX and ZH calculi, via integrals

Niel de Beaudrap, Richard D. P. East

The ZX calculus and ZH calculus use diagrams to denote and compute properties of quantum operations, using `rewrite rules' to transform between diagrams which denote the same opera…

quant-ph2021★ 27 cited

Fast Stabiliser Simulation with Quadratic Form Expansions

Niel de Beaudrap, Steven Herbert

This paper builds on the idea of simulating stabiliser circuits through transformations of quadratic form expansions. This is a representation of a quantum state which specifies a…

quant-ph2019★ 26 cited

Techniques to Reduce -Parity-Phase Circuits, Motivated by the ZX Calculus

Niel de Beaudrap, Xiaoning Bian, Quanlong Wang

To approximate arbitrary unitary transformations on one or more qubits, one must perform transformations which are outside of the Clifford group. The gate most commonly considered…

quant-ph2019★ 10 cited

Quantum linear network coding for entanglement distribution in restricted architectures

Niel de Beaudrap, Steven Herbert

In this paper we propose a technique for distributing entanglement in architectures in which interactions between pairs of qubits are constrained to a fixed network . This allow…

cs.CC2015

On exact counting and quasi-quantum complexity

Niel de Beaudrap

We present characterisations of "exact" gap-definable classes, in terms of indeterministic models of computation which slightly modify the standard model of quantum computation. Th…