Author

Aleks Kissinger

0 works0 citationsORCID

Recent research

  • AI & ComputingOpen access

    Efficient Classical Simulation of Low-Rank-Width Quantum Circuits Using ZX-Calculus

    In this paper, we introduce a technique for contracting (i.e. numerically evaluating) ZX-diagrams whose complexity scales with their rank-width, a graph parameter that behaves nicely under ZX rewrite rules. Given a rank-decomposition of width $R$, our method simulates a graph-lik...

    Electronic Proceedings in Theoretical Computer Science2026-11-020 citationsDOI
  • AI & ComputingOpen access

    ZX-Flow: A Flexible Criterion for Deterministic Computation with ZX-Diagrams

    Flow criteria are used to efficiently extract computations, either in the form of measurement patterns or quantum circuits, from ZX-diagrams. Existing criteria such as causal flow, generalised flow, and Pauli flow, were all originally formulated for graph states, so they require...

    Electronic Proceedings in Theoretical Computer Science2026-11-020 citationsDOI
  • AI & ComputingOpen access

    TensorRocq: Enabling Diagrammatic Reasoning in Rocq

    Symmetric monoidal categories (SMCs) are a common framework for reasoning about computation, focusing on the parallel and sequential compositionality of operations. String diagrams are a ubiquitous and powerful tool for reasoning about equations in SMCs, eliding the fine details...

    Proceedings of the ACM on Programming Languages2026-10-010 citationsDOI
  • AI & ComputingOpen access

    Floquetifying stabiliser codes with distance-preserving rewrites

    Stabiliser codes with large weight measurements can be challenging to implement fault-tolerantly. To overcome this, we propose a Floquetification procedure which, given a stabiliser code, synthesises a novel Floquet code that only uses single- and two-qubit operations. Moreover,...

    Quantum2026-09-033 citationsDOI