Daniel Z. Zanger

activity

20172023

most citedG3Ms:Generalized Mean Market Makers

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing quant-phShow all

2 papers · 1 filter

quant-ph2023

A Quadratic Sample Complexity Reduction for Agnostic Learning via Quantum Algorithms

Daniel Z. Zanger

Using quantum algorithms, we obtain, for accuracy $ε > 0$ and confidence $1 - δ, 0 < δ < 1,$ a new sample complexity upper bound of $O((\mbox{log}(\frac{1}δ))/ε)$ as $ε, δ \to 0$ for…

quant-ph2017

Super-exponential query complexity reduction via noise-resistant quantum search

Daniel Z. Zanger

In the SEARCH WITH ADVICE problem, a single entry of interest within a database of N entries is to be found assuming that an ordering of the entries, from that with the highest pro…