Search Results for author: Ronald de Wolf

Found 9 papers, 1 papers with code

Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints

no code implementations25 Oct 2021 Yanlin Chen, Ronald de Wolf

Lasso and Ridge are important minimization problems in machine learning and statistics.

Symmetry and Quantum Query-to-Communication Simulation

no code implementations9 Dec 2020 Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf

We also give, among other things, a general recipe to construct functions for which the log n overhead is required in the BCW simulation in the bounded-error communication model, even if the parties are allowed to share an arbitrary prior entangled state for free.

Quantum Physics Computational Complexity

Improved Quantum Boosting

no code implementations17 Sep 2020 Adam Izdebski, Ronald de Wolf

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).

A Survey of Quantum Learning Theory

no code implementations24 Jan 2017 Srinivasan Arunachalam, Ronald de Wolf

This paper surveys quantum learning theory: the theoretical aspects of machine learning using quantum computers.

BIG-bench Machine Learning Learning Theory

Optimal Quantum Sample Complexity of Learning Algorithms

no code implementations4 Jul 2016 Srinivasan Arunachalam, Ronald de Wolf

This shows classical and quantum sample complexity are equal up to constant factors.

Learning Theory

A Survey of Quantum Property Testing

1 code implementation8 Oct 2013 Ashley Montanaro, Ronald de Wolf

Finally, we may also consider quantum testers for properties of quantum objects, such as states or operations.

Quantum Physics

Quantum Proofs for Classical Theorems

no code implementations18 Oct 2009 Andrew Drucker, Ronald de Wolf

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

no code implementations18 Feb 1998 Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf

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

Cannot find the paper you are looking for? You can Submit a new open access paper.