231 citations · 1.2k across the 34 of their papers we have counts for
5 papers · 1 filter
Assessing requirements to scale to practical quantum advantage
Michael E. Beverland, Prakash Murali, Matthias Troyer +7
While quantum computers promise to solve some scientifically and commercially valuable problems thought intractable for classical machines, delivering on this promise will require…
Space-time optimized table lookup
Thomas Häner, Vadym Kliuchnikov, Martin Roetteler +1
We describe a space-time optimized circuit for the table lookup subroutine from lattice-surgery surface code primitives respecting 2D grid connectivity. Table lookup circuits are u…
QParallel: Explicit Parallelism for Programming Quantum Computers
Thomas Häner, Vadym Kliuchnikov, Martin Roetteler +2
We present a language extension for parallel quantum programming to (1) remove ambiguities concerning parallelism in current quantum programming languages and (2) facilitate space-…
Shorter quantum circuits via single-qubit gate approximation
Vadym Kliuchnikov, Kristin Lauter, Romy Minko +2
We give a novel procedure for approximating general single-qubit unitaries from a finite universal gate set by reducing the problem to a novel magnitude approximation problem, achi…
Counting unitaries of T-depth one
Vadym Kliuchnikov
We show that the number of T-depth one unitaries on qubits is where i…