activity
19982026
most citedA meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits

556 citations · 2k across the 44 of their papers we have counts for

collaborators
Showing 1998Show all

1 paper · 1 filter

quant-ph1998★ 61 cited

Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups

Martin Roetteler, Thomas Beth

We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.