Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:theoretical_computer_science
|
| gptkbp:classicalComplexity |
O(2^n)
|
| gptkbp:describes |
distinguishing between constant and balanced Boolean functions
|
| gptkbp:field |
gptkb:quantum_computing
|
| gptkbp:firstPublished |
gptkb:Proceedings_of_the_Royal_Society_of_London_A
|
| gptkbp:input |
oracle function
|
| gptkbp:introducedIn |
1992
|
| gptkbp:namedAfter |
gptkb:David_Deutsch
gptkb:Richard_Jozsa |
| gptkbp:quantumComplexity |
O(1)
|
| gptkbp:relatedTo |
gptkb:Deutsch–Jozsa_algorithm
|
| gptkbp:significance |
demonstrates quantum speedup over classical algorithms
|
| gptkbp:bfsParent |
gptkb:Deutsch–Jozsa_algorithm
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Deutsch–Jozsa problem
|