An Optimal Separation of Randomized and Quantum Query Complexity (Q5890036): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3168722382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forrelation: A Problem That Optimally Separates Quantum from Classical Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separations in query complexity using cheat sheets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6070398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542521 / 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: Quantum Property Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query-To-Communication Lifting for BPP Using Inner Product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5121889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved pseudorandomness for unordered branching programs through local monotonicity / 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: Entangled Simultaneity Versus Classical Interactivity in Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier growth of parity decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraphs of hypercubes and a proof of the sensitivity conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Monotone Decision Trees in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential separation of quantum and classical communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum one-way communication can be exponentially stronger than classical communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4591372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111145 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:36, 1 August 2024

scientific article; zbMATH DE number 7680600
Language Label Description Also known as
English
An Optimal Separation of Randomized and Quantum Query Complexity
scientific article; zbMATH DE number 7680600

    Statements

    An Optimal Separation of Randomized and Quantum Query Complexity (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2023
    0 references
    quantum-classical separations
    0 references
    query complexity
    0 references
    communication complexity
    0 references
    forrelation
    0 references
    Fourier analysis of Boolean functions
    0 references
    Fourier weight of decision trees
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references