5 citations · 13 across the 12 of their papers we have counts for
12 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 cont…
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…
Scalable and interpretable quantum natural language processing: an implementation on trapped ions
Tiffany Duneau, Saskia Bruhn, Gabriel Matos +5
We present the first implementation of text-level quantum natural language processing, a field where quantum computing and AI have found a fruitful intersection. We focus on the QD…
Quantum Algorithms for Compositional Text Processing
Tuomas Laakkonen, Konstantinos Meichanetzidis, Bob Coecke
Quantum computing and AI have found a fruitful intersection in the field of natural language processing. We focus on the recently proposed DisCoCirc framework for natural language,…
On the Anatomy of Attention
Nikhil Khatri, Tuomas Laakkonen, Jonathon Liu +1
We introduce a category-theoretic diagrammatic formalism in order to systematically relate and reason about machine learning models. Our diagrams present architectures intuitively…
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…
Quantum Circuit Optimization with AlphaTensor
Francisco J. R. Ruiz, Tuomas Laakkonen, Johannes Bausch +10
A key challenge in realizing fault-tolerant quantum computers is circuit optimization. Focusing on the most expensive gates in fault-tolerant quantum computation (namely, the T gat…
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…
Picturing Counting Reductions with the ZH-Calculus
Tuomas Laakkonen, Konstantinos Meichanetzidis, John van de Wetering
Counting the solutions to Boolean formulae defines the problem #SAT, which is complete for the complexity class #P. We use the ZH-calculus, a universal and complete graphical langu…
A Graphical #SAT Algorithm for Formulae with Small Clause Density
Tuomas Laakkonen, Konstantinos Meichanetzidis, John van de Wetering
We study the counting version of the Boolean satisfiability problem #SAT using the ZH-calculus, a graphical language originally introduced to reason about quantum circuits. Using t…