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 2024Show all

8 papers · 1 filter

quant-ph2024★ 3 cited

Floquetifying stabiliser codes with distance-preserving rewrites

Benjamin Rodatz, Boldizsár Poór, Aleks Kissinger

Stabiliser codes with large weight measurements can be challenging to implement fault-tolerantly. To overcome this, we propose a Floquetification procedure which, given a stabilise…

quant-ph2024

Hybrid Quantum-Classical Machine Learning with String Diagrams

Alexander Koziell-Pipe, Aleks Kissinger

Central to near-term quantum machine learning is the use of hybrid quantum-classical algorithms. This paper develops a formal framework for describing these algorithms in terms of…

quant-ph2024

Catalysing Completeness and Universality

Aleks Kissinger, Neil J. Ross, John van de Wetering

A catalysis state is a quantum state that is used to make some desired operation possible or more efficient, while not being consumed in the process. Recent years have seen catalys…

quant-ph2024★ 1 cited

Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates)

Aleks Kissinger, John van de Wetering

This is the second in a series of "graphical grokking" papers in which we study how stabiliser codes can be understood using the ZX-calculus. In this paper we show that certain com…

cs.LO2024

A complete logic for causal consistency

Will Simmons, Aleks Kissinger

The construction takes a base category of ``raw materials'' and builds a category of higher order causal processes, that is a category whose types encode causal…

quant-ph2024★ 4 cited

Procedurally Optimised ZX-Diagram Cutting for Efficient T-Decomposition in Classical Simulation

Matthew Sutcliffe, Aleks Kissinger

A quantum circuit may be strongly classically simulated with the aid of ZX-calculus by decomposing its T-gates into a sum of classically computable stabiliser terms. I…