Life Sciences (theme 5), Logistics (theme 3)
Theory of Computing
Quantum Computing: algorithms, proofs and tradeoffs , Quantum computing: fault-tolerance, communication, and classical spin-offs
Earlier version in Complexity'11
This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/639.072.803 - Quantum computing: fault-tolerance, communication, and classical spin-offs
Algorithms and Complexity

Buhrman, H.M, Regev, O, Scarpa, G, & de Wolf, R.M. (2012). Near-optimal and explicit Bell inequality violations. Theory of Computing, 8(27), 623–645.