#### Filter Results:

#### Publication Year

2005

2010

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Airat Khasianov
- 2005

- Farid M. Ablayev, Airat Khasianov, Alexander Vasiliev
- Electronic Colloquium on Computational Complexity
- 2008

We consider the Hidden Subgroup, and Equality-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 in circuit notation. Our algorithms… (More)

- Airat Khasianov
- Electronic Colloquium on Computational Complexity
- 2010

We consider the Hidden Subgroup in the context of quantum 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 [KH10]). It turns out that in this case the problem is intractable for the quantum OBDD. We prove… (More)

- ‹
- 1
- ›