281 citations
- University of AmsterdamNL21 papers
- Eindhoven University of TechnologyNL17 papers
- College of Western IdahoUS5 papers
- Universidad Pública de Navarra (UPNA)ES4 papers
- University of WaterlooCA4 papers
- Vrije Universiteit AmsterdamNL4 papers
- Berkeley CollegeUS2 papers
- National University of SingaporeSG2 papers
- Radboud University NijmegenNL2 papers
- University of BristolGB2 papers
- University of California, BerkeleyUS2 papers
- University of CambridgeGB2 papers
Showing 2008 · quant-phShow all
2 papers · 2 filters
quant-ph2008★ 11 cited
Nonclassicality without entanglement enables bit commitment
Howard Barnum, Oscar C. O. Dahlsten, Matthew Leifer +1
We investigate the existence of secure bit commitment protocols in the convex framework for probabilistic theories. The framework makes only minimal assumptions, and can be used to…
quant-ph2008★ 4 cited
A note on quantum algorithms and the minimal degree of epsilon-error polynomials for symmetric functions
Ronald de Wolf
The degrees of polynomials representing or approximating Boolean functions are a prominent tool in various branches of complexity theory. Sherstov recently characterized the minima…