24 citations · 41 across the 6 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
quant-ph2026
The power of oracle access: Optimal sample and query complexity of the abelian state hidden subgroup problem
Yuhan Liu, Jose Carrasco, Jens Eisert +1
In the quest to identify further quantum algorithms exhibiting superpolynomial speed-ups, a recurring theme is that the complexity of a problem is largely shaped by the input acces…
quant-ph2026
Compiling Quantum Regular Language States
Armando Bellante, Reinis Irmejs, Marta Florido-Llinàs +4
State preparation compilers for quantum computers typically sit at two extremes: general-purpose routines that treat the target as an opaque amplitude vector, and bespoke construct…