collaborators

17 papers

quant-ph20263 cited

Floquetifying stabiliser codes with distance-preserving rewrites

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

The paper presents a Floquetification technique that transforms any stabiliser code into a Floquet code using only single- and two-qubit operations while preserving the code's dist…

quant-ph2026

Completeness for Fault Equivalence of Clifford ZX Diagrams

Maximilian Rüsch, Aleks Kissinger, Benjamin Rodatz

Two circuits are considered to be equivalent under noise if the effect of faults on one circuit is no worse than the effect of faults on the other circuit. We call this relationshi…

quant-ph2026

Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi

Dichuan Gao, Razin A. Shaikh, Aleks Kissinger

We introduce Graphical Algebraic Geometry (GAG), a family of diagrammatic languages extending the Graphical Linear Algebra programme. We construct several languages within this fam…

quant-ph2026

Equivariant Reinforcement Learning for Clifford Quantum Circuit Synthesis

Richie Yeung, Aleks Kissinger, Rob Cornish

We consider the problem of synthesizing Clifford quantum circuits for devices with all-to-all qubit connectivity. We approach this task as a reinforcement learning problem in which…

quant-ph2026

Fault Tolerance by Construction

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

A key challenge in fault-tolerant quantum computing is synthesising and optimising circuits in a noisy environment, as traditional techniques often fail to account for the effect o…

quant-ph2026

Preserving MWPM-Decodability in Fault-Equivalent Rewrites

Maximilian Schweikart, Linnea Grans-Samuelsson, Aleks Kissinger +1

Decoding a quantum error correction code is generally NP-hard, but corrections must be applied at a high frequency to suppress noise successfully. Matchable codes, like the surface…