Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with hsp:
TR10-030 | 18th February 2010
Airat Khasianov

Stronger Lower Bounds on Quantum OBDD for the Hidden Subgroup Problem

Revisions: 2

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 >>>

ISSN 1433-8092 | Imprint