Revisiting Deutsch-Jozsa algorithm (Q2216118): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Superlinear advantage for exact quantum algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials, quantum query complexity, and Grothendieck's inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separations in Query Complexity Based on Pointer Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Quantum Query Complexity of EXACT and THRESHOLD / rank
 
Normal rank
Property / cites work
 
Property / cites work: A different Deutsch-Jozsa / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures and decision tree complexity: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially Symmetric Functions Are Efficiently Isomorphism Testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithms revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal separation in exact query complexities for Simon's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid solution of problems by quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of promise problems with applications to public-key cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of the distributed Deutsch–Jozsa promise problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quantum black-box complexity of majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic polynomial-time quantum algorithms for Simon's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exact quantum query complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Queries on Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Quantum Query Complexity to State Complexity / rank
 
Normal rank

Revision as of 04:43, 24 July 2024

scientific article
Language Label Description Also known as
English
Revisiting Deutsch-Jozsa algorithm
scientific article

    Statements

    Revisiting Deutsch-Jozsa algorithm (English)
    0 references
    0 references
    0 references
    15 December 2020
    0 references
    exact quantum query algorithms
    0 references
    Deutsch-Jozsa problems
    0 references
    query complexity
    0 references
    symmetric Boolean functions
    0 references
    promise problems
    0 references

    Identifiers