Search Results for author:
Found 9 papers, 1 papers with code
Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints
Lasso and Ridge are important minimization problems in machine learning and statistics.
The Role of Symmetry in Quantum Query-to-Communication Simulation
We show that the O(log n) overhead is required for some functions in the quantum setting, and thus the BCW simulation is tight.
Quantum Physics Computational Complexity
Improved Quantum Boosting
Boosting is a general method to convert a weak learner (which generates hypotheses that are just slightly better than random) into a strong learner (which generates hypotheses that are much better than random).
Two new results about quantum exact learning
We present two new results about exact learning by quantum computers.
A Survey of Quantum Learning Theory
This paper surveys quantum learning theory: the theoretical aspects of machine learning using quantum computers.
Optimal Quantum Sample Complexity of Learning Algorithms
This shows classical and quantum sample complexity are equal up to constant factors.
A Survey of Quantum Property Testing
Finally, we may also consider quantum testers for properties of quantum objects, such as states or operations.
Quantum Physics
Quantum Proofs for Classical Theorems
Alongside the development of quantum algorithms and quantum complexity theory in recent years, quantum techniques have also proved instrumental in obtaining results in classical (non-quantum) areas.
Quantum Physics Computational Complexity
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0, 1}^N in the black-box model.
Quantum Physics Computational Complexity
