We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
Quantum systems are promising candidates of future computing and information processing devices. In a large system, information about the quantum states and processes may be incomp...
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...
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...
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...