A lower bound on the quantum query complexity of read-once functions (Q1880783): Difference between revisions

@@ Property / OpenAlex ID @@
+W1987152249
@@ Property / OpenAlex ID: W1987152249 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+quant-ph/0201007
@@ Property / arXiv ID: quant-ph/0201007 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum lower bounds by quantum arguments
@@ Property / cites work: Quantum lower bounds by quantum arguments / rank @@
+Normal rank
@@ Property / cites work @@
+Strengths and Weaknesses of Quantum Computing
@@ Property / cites work: Strengths and Weaknesses of Quantum Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity measures and decision tree complexity: a survey.
+Normal rank
@@ Property / cites work @@
+Q4228473
@@ Property / cites work: Q4228473 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4535800
@@ Property / cites work: Q4535800 / rank @@
+Normal rank
@@ Property / cites work @@
+On the degree of Boolean functions as real polynomials
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
+Normal rank
@@ Property / cites work @@
+On the Power of Quantum Computation
@@ Property / cites work: On the Power of Quantum Computation / rank @@
+Normal rank