Showing quant-phShow all
3 papers · 1 filter
quant-ph2011
Span Programs for Functions with Constant-Sized 1-certificates
Aleksandrs Belovs
Besides the Hidden Subgroup Problem, the second large class of quantum speed-ups is for functions with constant-sized 1-certificates. This includes the OR function, solvable by the…
quant-ph2011★ 13 cited
Span-program-based quantum algorithm for the rank problem
Aleksandrs Belovs
Recently, span programs have been shown to be equivalent to quantum query algorithms. It is an open problem whether this equivalence can be utilized in order to come up with new qu…
quant-ph2008
A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases
Aleksandrs Belovs, Juris Smotrovs
The paper gives a short introduction to mutually unbiased bases and the Welch bounds and demonstrates that the latter is a good technical tool to explore the former. In particular,…