Quantum counterfeit coin problems (Q714865): Difference between revisions

@@ 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 @@
+Quantum Complexity Theory
@@ Property / cites work: Quantum Complexity Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4819589
@@ Property / cites work: Q4819589 / rank @@
+Normal rank
@@ Property / cites work @@
+Classical and Quantum Algorithms for Exponential Congruences
+Normal rank
@@ Property / cites work @@
+Q4228473
@@ Property / cites work: Q4228473 / rank @@
+Normal rank
@@ Property / cites work @@
+Coin-Weighing Problems
@@ Property / cites work: Coin-Weighing Problems / rank @@
+Normal rank
@@ Property / cites work @@
+The general counterfeit coin problem
@@ Property / cites work: The general counterfeit coin problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549652
@@ Property / cites work: Q3549652 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
+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 @@
+Searching for two counterfeit coins with two-arms balance
+Normal rank
@@ Property / cites work @@
+Quantum Algorithms for the Triangle Problem
@@ Property / cites work: Quantum Algorithms for the Triangle Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Counterfeit Coin Problems
@@ Property / cites work: Counterfeit Coin Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q2706552
@@ Property / cites work: Q2706552 / 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 @@
+Q3002763
@@ Property / cites work: Q3002763 / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of Ambainis lower bounds
@@ Property / cites work: On the power of Ambainis lower bounds / rank @@
+Normal rank