A strong direct product theorem for quantum query complexity (Q354645): Difference between revisions

@@ Property / DOI @@
-.1007/s00037-013-0066-8
@@ Property / DOI: 10.1007/s00037-013-0066-8 / 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 @@
+Polynomial degree vs. quantum query complexity
@@ Property / cites work: Polynomial degree vs. quantum query complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q3172424
@@ Property / cites work: Q3172424 / rank @@
+Normal rank
@@ 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
+Normal rank
@@ Property / cites work @@
+Q3002797
@@ Property / cites work: Q3002797 / rank @@
+Normal rank
@@ Property / cites work @@
+A new quantum lower bound method,
@@ Property / cites work: A new quantum lower bound method, / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum lower bounds by polynomials
@@ Property / cites work: Quantum lower bounds by polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Positive definite matrices
@@ Property / cites work: Positive definite matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity measures and decision tree complexity: a survey.
+Normal rank
@@ Property / cites work @@
+Discrete-query quantum algorithm for NAND trees
@@ Property / cites work: Discrete-query quantum algorithm for NAND trees / rank @@
+Normal rank
@@ Property / cites work @@
+Elements of Information Theory
@@ Property / cites work: Elements of Information Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Towards proving strong direct product theorems
@@ Property / cites work: Towards proving strong direct product theorems / rank @@
+Normal rank
@@ Property / cites work @@
+On Yao’s XOR-Lemma
@@ Property / cites work: On Yao’s XOR-Lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549652
@@ Property / cites work: Q3549652 / rank @@
+Normal rank
@@ Property / cites work @@
+A direct product theorem for two-party bounded-round public-coin communication complexity
+Normal rank
@@ Property / cites work @@
+Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs
+Normal rank
@@ Property / cites work @@
+Quantum Query Complexity of State Conversion
@@ Property / cites work: Quantum Query Complexity of State Conversion / rank @@
+Normal rank
@@ Property / cites work @@
+A strong direct product theorem for quantum query complexity
+Normal rank
@@ Property / cites work @@
+Complexity measures of sign matrices
@@ Property / cites work: Complexity measures of sign matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds in communication complexity based on factorization norms
+Normal rank
@@ Property / cites work @@
+Q2706552
@@ Property / cites work: Q2706552 / rank @@
+Normal rank
@@ Property / cites work @@
+A Parallel Repetition Theorem
@@ Property / cites work: A Parallel Repetition Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
+Normal rank
@@ Property / cites work @@
+Q5365063
@@ Property / cites work: Q5365063 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549690
@@ Property / cites work: Q3549690 / rank @@
+Normal rank
@@ Property / cites work @@
+Strong Direct Product Theorems for Quantum Communication and Query Complexity
+Normal rank
@@ Property / cites work @@
+A Probabilistic Inequality with Applications to Threshold Direct-Product Theorems
+Normal rank
@@ Property / DOI @@
+.1007/S00037-013-0066-8
@@ Property / DOI: 10.1007/S00037-013-0066-8 / rank @@
+Normal rank