342 search results - page 47 / 69 » Quantum Algorithms |
STOC
2007
ACM
14 years 9 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....
JCC
2002
13 years 8 months ago
2002
: The evaluation of the electron density based similarity function scales quadratically with respect to the size of the molecules for simplified, atomic shell densities. Due to the...
DAC
2009
ACM
14 years 9 months ago
2009
ACM
Reversible logic is the basis for several emerging technologies such as quantum computing, optical computing, or DNA computing and has further applications in domains like low-pow...
STOC
2000
ACM
14 years 1 months ago
2000
ACM
We consider the design of self-testers for quantum gates. A self-tester for the gates F 1, . . . , F m is a procedure that, given any gates G1, . . . , Gm, decides with high probab...
STOC
2001
ACM
14 years 9 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...