206 search results - page 13 / 42 » On the Complexity of Quantum ACC |
ICALP
2004
Springer
14 years 28 days ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
QCQC
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
PPL
2010
13 years 6 months ago
2010
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
ECCC
2008
13 years 7 months ago
2008
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....