A lower bound on the quantum query complexity of read-once functions (Q1880783): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: Michael E. Saks / rank | |||
Property / author | |||
Property / author: Michael E. Saks / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q62117306 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1987152249 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: quant-ph/0201007 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quantum lower bounds by quantum arguments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Strengths and Weaknesses of Quantum Computing / 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: Q4228473 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4535800 / 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: 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 | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:01, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A lower bound on the quantum query complexity of read-once functions |
scientific article |
Statements
A lower bound on the quantum query complexity of read-once functions (English)
0 references
1 October 2004
0 references
Quantum query complexity
0 references
Quantum computation
0 references
Query complexity
0 references
Decision tree complexity
0 references
Read-once functions
0 references
Lower bounds
0 references
0 references