206 search results - page 12 / 42 » On the Complexity of Quantum ACC |
148
click to vote
TC
2010
15 years 4 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...
175
click to vote
TOC
2010
15 years 22 days 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,...
181
click to vote
FCT
2007
Springer
16 years 6 days 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 ...
166
click to vote
COCOON
2008
Springer
15 years 7 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,...
139
click to vote
ICALP
2005
Springer
15 years 11 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...