249 search results - page 4 / 50 » One Complexity Theorist's View of Quantum Computing |
107
click to vote
COCO
2009
Springer
15 years 4 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
CPHYSICS
2007
14 years 9 months ago
2007
During the last decade, several quantum information protocols, such as quantum key distribution, teleportation or quantum computation, have attracted a lot of interest. Despite th...
CSL
2003
Springer
15 years 2 months ago
2003
Springer
Quantum computation deals with projective measurements and unitary transformations in finite dimensional Hilbert spaces. The paper presents a propositional logic designed to descr...
ICALP
2005
Springer
15 years 2 months ago
2005
Springer
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
QCQC
1998
Springer
15 years 1 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...