抄録
A-010
A result on complexity of quantum computation
○浜田 充(玉川大)
Complexities of quantum circuits are often discussed in terms of universal sets of quantum gates. Recently, a widespread fallacy in such discussions was pointed out by the author. Along this line, a basic result that suggests how to evaluate the complexities properly is presented.