1 citations · 1 across the 3 of their papers we have counts for
3 papers
quant-ph2023
A Quadratic Sample Complexity Reduction for Agnostic Learning via Quantum Algorithms
Daniel Z. Zanger
Using quantum algorithms, we obtain, for accuracy and confidence a new sample complexity upper bound of $O((\mbox{log}(\frac{1}δ))/ε)$ as for…
q-fin.TR2022★ 1 cited
G3Ms:Generalized Mean Market Makers
Daniel Z. Zanger
In the Decentralized Finance (DeFi) setting, we present a new parametrized family of Constant Function Market Makers (CFMMs) which we call the Generalized Mean Market Makers (G3Ms)…
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…