88 citations
- University of AmsterdamNL11 papers
- College of Western IdahoUS3 papers
- Vrije Universiteit AmsterdamNL3 papers
- Universidad Pública de Navarra (UPNA)ES2 papers
- University of CambridgeGB2 papers
- University of TwenteNL2 papers
- Berkeley CollegeUS1 paper
- Eindhoven University of TechnologyNL1 paper
- Goethe University FrankfurtDE1 paper
- Institute for Advanced StudyUS1 paper
- Laboratoire de Recherche en InformatiqueFR1 paper
- Lomonosov Moscow State UniversityRU1 paper
Showing 2003 · quant-phShow all
2 papers · 2 filters
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…