activity
20102026
most citedGraph-theoretic Simplification of Quantum Circuits with the ZX-calculus

194 citations · 1.2k across the 78 of their papers we have counts for

collaborators
Showing 2019Show all

5 papers · 1 filter

quant-ph2019

CNOT circuit extraction for topologically-constrained quantum memories

Aleks Kissinger, Arianne Meijer-van de Griend

Many physical implementations of quantum computers impose stringent memory constraints in which 2-qubit operations can only be performed between qubits which are nearest neighbours…

quant-ph2019★ 11 cited

Graphical Fourier Theory and the Cost of Quantum Addition

Stach Kuijpers, John van de Wetering, Aleks Kissinger

The ZX-calculus is a convenient formalism for expressing and reasoning about quantum circuits at a low level, whereas the recently-proposed ZH-calculus yields convenient expression…

quant-ph2019★ 114 cited

PyZX: Large Scale Automated Diagrammatic Reasoning

Aleks Kissinger, John van de Wetering

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, w…

quant-ph2019★ 151 cited

Reducing T-count with the ZX-calculus

Aleks Kissinger, John van de Wetering

Reducing the number of non-Clifford quantum gates present in a circuit is an important task for efficiently implementing quantum computations, especially in the fault-tolerant regi…

quant-ph2019★ 194 cited

Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus

Ross Duncan, Aleks Kissinger, Simon Perdrix +1

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-…