523 search results - page 16 / 105 » On the Power of Quantum Proofs |
109
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin exte...
107
click to vote
STOC
2002
ACM
16 years 2 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
106
click to vote
QCQC
1998
Springer
15 years 6 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...
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In recent years, Reversible Logic is becoming more and more prominent technology having its applications in Low Power CMOS, Quantum Computing, Nanotechnology, and Optical Computin...
119
click to vote
TIT
2008
15 years 1 months ago
2008
Quantum Shannon theory is loosely defined as a collection of coding theorems, such as classical and quantum source compression, noisy channel coding theorems, entanglement distilla...