1.2k citations · 2.5k across the 41 of their papers we have counts for
4 papers · 1 filter
Exact quantum query complexity of computing Hamming weight modulo powers of two and three
Arjan Cornelissen, Nikhil S. Mande, Maris Ozols +1
We study the problem of computing the Hamming weight of an -bit string modulo , for any positive integer whose only prime factors are 2 and 3. We show that the exa…
Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints
Yanlin Chen, Ronald de Wolf
Lasso and Ridge are important minimization problems in machine learning and statistics. They are versions of linear regression with squared loss where the vector …
Average-Case Verification of the Quantum Fourier Transform Enables Worst-Case Phase Estimation
Noah Linden, Ronald de Wolf
The quantum Fourier transform (QFT) is a key primitive for quantum computing that is typically used as a subroutine within a larger computation, for instance for phase estimation.…
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error
Olivier Lalonde, Nikhil S. Mande, Ronald de Wolf
We investigate the randomized and quantum communication complexities of the well-studied Equality function with small error probability , getting optimal constant factors in the…