Tuomas Laakkonen

activity

20222026

most citedPicturing Counting Reductions with the ZH-Calculus

5 citations · 13 across the 12 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

quant-ph2025

Any Clifford+T circuit can be controlled with constant T-depth overhead

Isaac H. Kim, Tuomas Laakkonen

Since an n-qubit circuit consisting of CNOT gates can have up to $Ω (n^{2} / lo g n)$ CNOT gates, it is natural to expect that $Ω (n^{2} / lo g n)$ Toffoli gates are needed to apply a cont…

quant-ph2025

End-to-End Quantum Algorithms for the Jones Polynomial

Tuomas Laakkonen, Enrico Rinaldi, Chris N. Self +6

We present an end-to-end algorithmic pipeline where a noisy digital quantum computer is used to approximate the value of the Jones polynomial at the fifth root of unity for any inp…