All reports by Author Airat Khasianov:

__
TR10-030
| 18th February 2010
__

Airat Khasianov#### Stronger Lower Bounds on Quantum OBDD for the Hidden Subgroup Problem

Revisions: 2

__
TR08-085
| 19th June 2008
__

Farid Ablayev, Airat Khasianov, Alexander Vasiliev#### On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions

Revisions: 1

Airat Khasianov

We consider the \emph{Hidden Subgroup} in the context of quantum \emph{Ordered Binary Decision Diagrams}.

We show several lower bounds for this function.

In this paper we also consider a slightly more general definition of the

hidden subgroup problem (in contrast to that in \cite{khashsp1}). It turns out that ...
more >>>

Farid Ablayev, Airat Khasianov, Alexander Vasiliev

We consider Generalized Equality, the Hidden Subgroup,

and related problems in the context of quantum Ordered Binary

Decision Diagrams. For the decision versions of considered problems

we show polynomial upper bounds in terms of quantum OBDD width. We

apply a new modification of the fingerprinting technique and present

the algorithms ...
more >>>