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

4 citations · 7 across the 5 of their papers we have counts for

collaborators

5 papers

quant-ph2026

Towards Quantum Optimised Malware Containment

Matthew Sutcliffe, Ravindra Mutyamsetty

The containment of malware in computing networks may be naturally formulated as a network influence minimisation problem, in which one seeks to limit the expected spread of an infe…

quant-ph2024★ 1 cited

Dynamic T-decomposition for classical simulation of quantum circuits

Wira Azmoon Ahmad, Matthew Sutcliffe

It is known that a quantum circuit may be simulated with classical hardware via stabilizer state (T-)decomposition in time, given non-Clifford gates and a decomposi…

quant-ph2024★ 1 cited

Smarter k-Partitioning of ZX-Diagrams for Improved Quantum Circuit Simulation

Matthew Sutcliffe

We introduce a novel method for strong classical simulation of quantum circuits based on optimally k-partitioning ZX-diagrams, reducing each part individually, and then efficiently…

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…

quant-ph2024★ 1 cited

Fast Classical Simulation of Quantum Circuits via Parametric Rewriting in the ZX-Calculus

Matthew Sutcliffe, Aleks Kissinger

The ZX-calculus is an algebraic formalism that allows quantum computations to be simplified via a small number of simple graphical rewrite rules. Recently, it was shown that, when…