21 citations · 25 across the 3 of their papers we have counts for
6 papers
Larq Compute Engine: Design, Benchmark, and Deploy State-of-the-Art Binarized Neural Networks
Tom Bannink, Arash Bakhtiari, Adam Hillier +5
We introduce Larq Compute Engine, the world's fastest Binarized Neural Network (BNN) inference engine, and use this framework to investigate several important questions about the e…
Quasirandom quantum channels
Tom Bannink, Jop Briët, Farrokh Labib +1
Mixing (or quasirandom) properties of the natural transition matrix associated to a graph can be quantified by its distance to the complete graph. Different mixing properties corre…
The Power Light Cone of the Discrete Bak-Sneppen, Contact and other local processes
Tom Bannink, Harry Buhrman, András Gilyén +1
We consider a class of random processes on graphs that include the discrete Bak-Sneppen (DBS) process and the several versions of the contact process (CP), with a focus on the form…
Bounding quantum-classical separations for classes of nonlocal games
Tom Bannink, Jop Briët, Harry Buhrman +2
We bound separations between the entangled and classical values for several classes of nonlocal -player games. Our motivating question is whether there is a family of -player…
Switch chain mixing times through triangle counts
Tom Bannink, Remco van der Hofstad, Clara Stegehuis
Sampling uniform simple graphs with power-law degree distributions with degree exponent is a non-trivial problem. We propose a method to sample uniform simple graphs th…
Quantum Pascal's Triangle and Sierpinski's carpet
Tom Bannink, Harry Buhrman
In this paper we consider a quantum version of Pascal's triangle. Pascal's triangle is a well-known triangular array of numbers and when these numbers are plotted modulo 2, a fract…