164 search results - page 11 / 33 » The Learnability of Quantum States |
TCC
2004
Springer
14 years 1 months ago
2004
Springer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...
ICML
1999
IEEE
14 years 8 months ago
1999
IEEE
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
TOC
2010
13 years 2 months ago
2010
: We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
COLT
1995
Springer
13 years 11 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...