Matrix analysis
The probabilistic communication complexity of set intersection
SIAM Journal on Discrete Mathematics
On the distributional complexity of disjointness
Theoretical Computer Science
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Communication complexity
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Classical versus quantum communication complexity
ACM SIGACT News
On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Interaction in quantum communication and the complexity of set disjointness
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Quantum Entanglement and Communication Complexity
SIAM Journal on Computing
Quantum Entanglement and the Communication Complexity of the Inner Product Function
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
The Quantum Communication Complexity of Sampling
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Quantum Lower Bounds by Polynomials
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Quantum Oracle Interrogation: Getting All Information for Almost Half the Price
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Quantum Algorithms for Element Distinctness
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Communication Complexity Lower Bounds by Polynomials
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Lower Bounds for Quantum Communication Complexity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Complexity classes in communication complexity theory
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Quantum communication and complexity
Theoretical Computer Science - Natural computing
Quantum zero-error algorithms cannot be composed
Information Processing Letters
Tensor norms and the classical communication complexity of nonlocal quantum measurement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Exponential separation of quantum and classical online space complexity
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
The pattern matrix method for lower bounds on quantum communication
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Quantum search on bounded-error inputs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Unbounded-error quantum query complexity
Theoretical Computer Science
Quantum communication complexity of block-composed functions
Quantum Information & Computation
Promised and distributed quantum search
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Quantum weakly nondeterministic communication complexity
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Quantum and classical communication-space tradeoffs from rectangle bounds
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
SIAM Journal on Computing
Classical and quantum partition bound and detector inefficiency
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Quantum weakly nondeterministic communication complexity
Theoretical Computer Science
| Hi-index | 0.00 |
We prove new bounds on the quantum communication complexity of the disjointness and equality problems. For the case of exact and non-deterministic protocols we show that these complexities are all equal to n+1, the previous best lower bound being n/2. We show this by improving a general bound for non-deterministic protocols of deWolf. We also give an O(驴n驴clog* n)-qubit bounded-error protocol for disjointness, modifying and improving the earlier O(驴n log n) protocol of Buhrman, Cleve, and Wigderson, and prove an 驴(驴n) lower bound for a class of protocols that includes the BCW-protocol as well as our new protocol.