Descriptional Complexity Issues in Quantum Computing
Jozef Gruska · Journal of automata, languages and combinatorics · 2000
The recent discovery that foundations of computing should be based on the laws of quantum physics brings new challenges also for descriptional complexity. The aim of the paper is to present and analyse these challenges, as well as the results obtained so far and the methods used to get them. The paper discusses also various open problems and research directions in quantum descriptional complexity to deal with.