88 search results - page 11 / 18 » Quantum lower bounds by quantum arguments |
STACS
2009
Springer
14 years 3 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
WDAG
2010
Springer
13 years 7 months ago
2010
Springer
We present a scalable quantum algorithm to solve binary consensus in a system of n crash-prone quantum processes. The algorithm works in O(polylog n) time sending O(n polylog n) qu...
CRYPTO
2007
Springer
14 years 2 months ago
2007
Springer
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quant...
COCOON
2008
Springer
13 years 10 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,...
DATE
2004
IEEE
14 years 9 days ago
2004
IEEE
We show how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts. In analogy to librar...