RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC (Q5495415): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Quantum lower bounds by quantum arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for quantum identification of Boolean oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Query Complexity of Boolean Functions with Small On-Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on quantum learning algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengths and Weaknesses of Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing Strings from Substrings with Quantum Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized group testing for mutually obscuring defectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum counterfeit coin problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalences and Separations Between Quantum and Classical Learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of Ambainis lower bounds / rank
 
Normal rank

Revision as of 19:45, 8 July 2024

scientific article; zbMATH DE number 6324613
Language Label Description Also known as
English
RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC
scientific article; zbMATH DE number 6324613

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references