523 search results - page 15 / 105 » On the Power of Quantum Proofs |
111
Voted
CRYPTO
2009
Springer
15 years 8 months ago
2009
Springer
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general “compiler” improving the secur...
111
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large cl...
89
Voted
COMBINATORICS
2007
15 years 1 months ago
2007
Sylvester’s identity is a classical determinantal identity with a straightforward linear algebra proof. We present combinatorial proofs of several non-commutative extensions, an...
124
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
113
Voted
TEC
2008
15 years 1 months ago
2008
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...