Sciweavers

95 search results - page 6 / 19
» Separating Quantum and Classical Learning
Sort
View
ICQNM
2008
IEEE
201views Chemistry» more  ICQNM 2008»
14 years 4 months ago
Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
Guido Berlín, Gilles Brassard, Félix...
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 4 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
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...
Troy Lee, Gideon Schechtman, Adi Shraibman
ET
2010
122views more  ET 2010»
13 years 7 months ago
Fault Models for Quantum Mechanical Switching Networks
This work justifies several quantum gate level fault models and discusses the causal error mechanisms thwarting correct function. A quantum adaptation of the classical test set gen...
Jacob D. Biamonte, Jeff S. Allen, Marek A. Perkows...
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 10 months ago
Standard Logics Are Valuation-Nonmonotonic
It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of nonorthomodular and thus non-distributive lattices that properly...
Mladen Pavicic, Norman D. Megill
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
14 years 10 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev