2 citations · 3 across the 6 of their papers we have counts for
Showing 2003Show all
2 papers · 1 filter
quant-ph2003
Robust Polynomials and Quantum Algorithms
Harry Buhrman, Ilan Newman, Hein Roehrig +1
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We co…
quant-ph2003★ 2 cited
Quantum Symmetrically-Private Information Retrieval
Iordanis Kerenidis, Ronald de Wolf
Private information retrieval systems (PIRs) allow a user to extract an item from a database that is replicated over k>=1 servers, while satisfying various privacy constraints. We…