206 search results - page 12 / 42 » On the Complexity of Quantum ACC |
TC
2010
13 years 6 months ago
2010
—In this paper, we present a quantum multicasting network, called a generalized quantum connector (n-GQC), which can be used to multicast quantum information from n inputs to n o...
TOC
2010
13 years 2 months ago
2010
: We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...