Papers › tūQ: a design and modelling tool for cluster-state algorithms
tūQ: a design and modelling tool for cluster-state algorithms
Greg Bowen, Simon Devitt
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper is a general introduction to the t\={u}Q toolchain (https://github.com/QSI-BAQS/tuQ) and a discussion of its two main workflows, 'reduce and optimise' and 'draft and compile'. The t\={u}Q toolchain was designed to advance research in cluster-state computing and the workflows are presented as suggestions for how a researcher might use the tool. The two modes of t\={u}Q are Modeller and Simulator. Simulator mode has a tile-based syntax for drafting cluster-state algorithms. Modeller enables the user to reduce a lattice through preset measurement functions and optimise an algorithm by minimising the count of qubits or the count of controlled-Z ('CZ') interactions. In addition, t\={u}Q makes it possible to compile an algorithm to OpenQASM 3.0.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections