2 citations · 3 across the 3 of their papers we have counts for
4 papers · 1 filter
A graph-theoretic analysis of non-generic free-fermion solvability by Krylov decompositions
Jannis Ruh, Samuel J. Elman, Adrian Chapman
Exactly solvable models are often identified from structural features of their interactions. For quantum spin Hamiltonians, these are captured by the frustration graph of anticommu…
Expanding the Class of Free Fermions via Twin-Collapse Methods
Jannis Ruh, Samuel J. Elman
We present a novel graph-theoretic approach to simplifying generic many-body Hamiltonians. Our primary result introduces a recursive twin-collapse algorithm, leveraging the identif…
Superconducting qubits in the millions: the potential and limitations of modularity
S. N. Saadatmand, Tyler L. Wilson, Mark J. Hodson +11
The development of fault-tolerant quantum computers (FTQCs) is receiving increasing attention within the quantum computing community. Like conventional digital computers, FTQCs, wh…
Quantum Circuit Optimisation and MBQC Scheduling with a Pauli Tracking Library
Jannis Ruh, Simon Devitt
We present a software library for the commutation of Pauli operators through quantum Clifford circuits, which is called Pauli tracking. Tracking Pauli operators allows one to reduc…