Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
quantum computer
|
| gptkbp:complexity |
exponential speedup over classical algorithms
|
| gptkbp:designedBy |
gptkb:Daniel_Simon
|
| gptkbp:field |
gptkb:quantum_computing
theoretical computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Simon's algorithm
|
| gptkbp:input |
black-box function
|
| gptkbp:inspiredBy |
gptkb:Shor's_algorithm
|
| gptkbp:introducedIn |
1994
|
| gptkbp:output |
hidden XOR mask
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_35th_Annual_Symposium_on_Foundations_of_Computer_Science_(FOCS_1994)
|
| gptkbp:relatedTo |
gptkb:Deutsch–Jozsa_algorithm
gptkb:Shor's_algorithm hidden subgroup problem |
| gptkbp:significance |
first exponential separation between quantum and classical query complexity
|
| gptkbp:solvedBy |
gptkb:Simon's_problem
|
| gptkbp:uses |
gptkb:quantum_Fourier_transform
|
| gptkbp:bfsParent |
gptkb:quantum_computing
|
| gptkbp:bfsLayer |
5
|