10 papers
Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology
Tuomas Laakkonen
To achieve large-scale fault-tolerant quantum computation, it may be easier to combine many small sets of qubits than to construct a single large set. For example via quantum error…
Unifying Graph Measures and Stabilizer Decompositions for the Classical Simulation of Quantum Circuits
Julien Codsi, Tuomas Laakkonen
Various algorithms have been developed to simulate quantum circuits on classical hardware. Among the most prominent are approaches based on \emph{stabilizer decompositions} and \em…
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 CNOT gates, it is natural to expect that Toffoli gates are needed to apply a co…
Optimal compilation of parametrised quantum circuits
John van de Wetering, Richie Yeung, Tuomas Laakkonen +1
Parametrised quantum circuits contain phase gates whose phase is determined by a classical algorithm prior to running the circuit on a quantum device. Such circuits are used in var…
A Pattern Language for Machine Learning Tasks
Benjamin Rodatz, Ian Fan, Tuomas Laakkonen +3
We formalise the essential data of objective functions as equality constraints on composites of learners. We call these constraints "tasks", and we investigate the idealised view t…
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…