523 search results - page 14 / 105 » On the Power of Quantum Proofs |
171
click to vote
ISTCS
1997
Springer
15 years 6 months ago
1997
Springer
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...
104
Voted
IPL
2006
15 years 1 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
126
click to vote
FCS
2006
15 years 3 months ago
2006
The application of the principles of quantum mechanics to cryptography has led to a respectable new dimension in confidential communication. As a result of these developments, it i...
108
click to vote
STOC
2000
ACM
15 years 6 months ago
2000
ACM
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
122
click to vote
ICCAD
2007
IEEE
15 years 10 months ago
2007
IEEE
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also expon...