Improved bounds on quantum learning algorithms (Q2491374): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2009155360
@@ Property / OpenAlex ID: W2009155360 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+quant-ph/0411140
@@ Property / arXiv ID: quant-ph/0411140 / 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 @@
+Rapid solution of problems by quantum computation
@@ Property / cites work: Rapid solution of problems by quantum computation / rank @@
+Normal rank
@@ Property / cites work @@
+On the Power of Quantum Computation
@@ Property / cites work: On the Power of Quantum Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalences and Separations Between Quantum and Classical Learnability
+Normal rank
@@ Property / cites work @@
+The geometry of quantum learning
@@ Property / cites work: The geometry of quantum learning / rank @@
+Normal rank
@@ Property / cites work @@
+STACS 2004
@@ Property / cites work: STACS 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
+Normal rank
@@ Property / cites work @@
+A theory of the learnable
@@ Property / cites work: A theory of the learnable / rank @@
+Normal rank
@@ Property / cites work @@
+A general lower bound on the number of examples needed for learning
+Normal rank
@@ Property / cites work @@
+Oracles and queries that are sufficient for exact learning
+Normal rank
@@ Property / cites work @@
+How many queries are needed to learn?
@@ Property / cites work: How many queries are needed to learn? / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum Complexity Theory
@@ Property / cites work: Quantum Complexity Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2491374