121 search results - page 15 / 25 » The complexity of the Quantum Adiabatic Algorithm |
COCO
2008
Springer
2008
Springer
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
14 years 12 months ago
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing setti...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
ALGORITHMICA
2002
14 years 10 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
COCO
2004
Springer
15 years 3 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...