t\={u}Q: a design and modelling tool for cluster-state algorithms

TL;DR

The paper introduces tBA, a versatile toolchain for designing, modeling, and optimizing cluster-state quantum algorithms, supporting drafting, simulation, reduction, and compilation to OpenQASM 3.0.

Contribution

It presents the tBA toolchain with workflows for cluster-state algorithm design, including simulation, reduction, optimization, and compilation, facilitating research in cluster-state quantum computing.

Findings

tBA supports drafting and simulating cluster-state algorithms.

It enables reduction and optimization of lattice-based algorithms.

Algorithms can be compiled to OpenQASM 3.0 for execution.

Abstract

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.