Sciweavers

34 search results - page 6 / 7
» New Limits on Fault-Tolerant Quantum Computation
Sort
View
HPDC
2007
IEEE
14 years 1 months ago
Towards adaptive, scalable, and reliable resource provisioning for wsrf-compliant applications
Although WSRF (Web Services Resource Framework) and Java-based hosting environment have been successful in dealing with the heterogeneity of resources and the diversity of applica...
Eun-Kyu Byun, Jae-Wan Jang, Jin-Soo Kim
IPPS
2008
IEEE
14 years 1 months ago
Large-scale experiment of co-allocation strategies for Peer-to-Peer supercomputing in P2P-MPI
High Performance computing generally involves some parallel applications to be deployed on the multiples resources used for the computation. The problem of scheduling the applicat...
Stéphane Genaud, Choopan Rattanapoka
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
14 years 8 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 7 months ago
One-dimensional quantum walks
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin V...
COCO
2007
Springer
75views Algorithms» more  COCO 2007»
14 years 1 months ago
On the Theory of Matchgate Computations
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
Jin-yi Cai, Vinay Choudhary, Pinyan Lu