A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068911609 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: quant-ph/0511200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of Quantum Advice and One-Way Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds for the collision and the element distinctness problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by quantum arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial degree vs. quantum query complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Walk Algorithm for Element Distinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Any AND-OR Formula of Size <i>N</i> Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer / 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: Q4819589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum verification of matrix products / 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: The Growth of Polynomials Bounded at Equally Spaced Points / 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: Q3002797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity limitations on quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum complexities of ordered searching, sorting, and element distinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum complexity of testing group commutativity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Algorithms for the Triangle Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degree of Boolean functions as real polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum communication complexity of symmetric predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997537 / 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: On the power of Ambainis lower bounds / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 21:54, 1 July 2024

scientific article
Language Label Description Also known as
English
A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
scientific article

    Statements

    A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 August 2009
    0 references
    quantum computing
    0 references
    quantum algorithms
    0 references
    quantum lower bounds
    0 references
    time-space tradeoffs
    0 references
    Boolean functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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