Sciweavers

10666 search results - page 15 / 2134
» Quantum programming languages
Sort
View
ICALP
2003
Springer
14 years 23 days ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
CC
2008
Springer
124views System Software» more  CC 2008»
13 years 9 months ago
Coqa: Concurrent Objects with Quantized Atomicity
This paper introduces a new language model, Coqa, for deeply embedding concurrent programming into objects. Every program written in our language has the desirable behaviors of ato...
Yu David Liu, Xiaoqi Lu, Scott F. Smith
FCT
2007
Springer
13 years 11 months ago
Product Rules in Semidefinite Programming
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
Rajat Mittal, Mario Szegedy