587 search results - page 21 / 118 » Quantum computation and quantum information |
COCO
1998
Springer
14 years 3 months ago
1998
Springer
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
COMPUTER
2000
13 years 10 months ago
2000
UC
2007
Springer
14 years 5 months ago
2007
Springer
We propose an extension of the traditional λ-calculus in which terms are used to control an outside computing device (quantum computer, DNA computer...). We introduce two new bind...
AC
1998
Springer
14 years 3 months ago
1998
Springer
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...
QCQC
1998
Springer
14 years 3 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...