We present a completely new approach to quantum circuit optimisation, based on the ZX-
calculus. We first interpret quantum circuits as ZX-diagrams, which provide a flexible, lower …

The ZX-calculus is a graphical language for reasoning about ZX-diagrams, a type of tensor
networks that can represent arbitrary linear maps between qubits. Using the ZX-calculus, we …

Quantum computing is regarded as a promising paradigm that may overcome the current
computational power bottlenecks in the post-Moore era. The increasing maturity of quantum …

We give an overview of the circuit optimisation methods used by tket, a compiler system for
quantum software developed by Cambridge Quantum Computing Ltd. We focus on a novel …

Currently available quantum computing hardware platforms have limited 2-qubit connectivity
among their addressable qubits. In order to run a generic quantum algorithm on such a …

Translations between the quantum circuit model and the measurement-based one-way
model are useful for verification and optimisation of quantum computations. They make …

We present QUEST, a procedure to systematically generate approximations for quantum
circuits to reduce their CNOT gate count. Our approach employs circuit partitioning for …

We describe staq, a full-stack quantum processing toolkit written in standard C++. staq is a
quantum compiler toolkit, comprising of tools that range from quantum optimizers and …

We study the problem of finding the best approximate circuit that is the closest (in some
pertinent metric) to a target circuit, and which satisfies a number of hardware constraints, like …

A leading choice of error correction for scalable quantum computing is the surface code with
lattice surgery. The basic lattice surgery operations, the merging and splitting of logical …