|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'500'096
Articles rated: 2609
19 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Quantum DNF Learnability Revisited | | Jeffrey C. Jackson
; Christino Tamon
; Tomoyuki Yamakami
; | | Date: |
12 Feb 2002 | | Subject: | quant-ph | | Abstract: | We describe a quantum PAC learning algorithm for DNF formulae under the uniform distribution with a query complexity of $ ilde{O}(s^{3}/epsilon + s^{2}/epsilon^{2})$, where $s$ is the size of DNF formula and $epsilon$ is the PAC error accuracy. If $s$ and $1/epsilon$ are comparable, this gives a modest improvement over a previously known classical query complexity of $ ilde{O}(ns^{2}/epsilon^{2})$. We also show a lower bound of $Omega(slog n/n)$ on the query complexity of any quantum PAC algorithm for learning a DNF of size $s$ with $n$ inputs under the uniform distribution. | | Source: | arXiv, quant-ph/0202066 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER