Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
Sina Jafarpour, Mohammad Ghodsi, Keyvan Sadri, Zuh...
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...