Buhrman, H., Chandran, N., Fehr, S., Gelles, R., Goyal, V., Ostrovsky, R., Schaffner, C. (2011) Position-based quantum cryptography: impossibility and constructions.

In Rogaway, P. (Eds.), Advances in Cryptology – CRYPTO 2011: 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011: proceedings (pp 429-446) (Lecture Notes in Computer Science, Vol. 6841). Springer.

Buhrman, H., Chandran, N., Fehr, S., Gelles, R., Goyal, V., Ostrovsky, R., Schaffner, C. (2014) Position-based quantum cryptography: Impossibility and constructions.

SIAM Journal on Computing, Vol. 43 (pp 150-178)

Article | https://doi.org/10.1137/130913687 | UvA-DARE

Buhrman, H., Chang, R., Fortnow, L. (2003) One bit of advice.

In Proceedings of the 20th symposium on Theoretical Aspects of Computer Science. Springer-Verlag.

Buhrman, H., Christandl, M., Hayden, P., H.-K., Lo, Wehner, S.D.C. (2006) Security of quantum bit string commitment depends on the information measure.

Physical Review Letters, Vol. 97 (pp 250501)

Article | http://www.arxiv.org/abs/quant-ph/0609237 | UvA-DARE

Buhrman, H., Christandl, M., Hayden, P., Lo, H.-K., Wehner, S.D.C. (2008) Possibility, impossibility, and cheat sensitivity of quantum-bit string commitment.

Physical Review A, Vol. 78 (pp 022316)

Article | https://doi.org/10.1103/PhysRevA.78.022316 | UvA-DARE

Buhrman, H., Christandl, M., Koucký, M., Lotker, Z., Patt-Shamir, B., Vereshchagin, N.K. (2007) High Entropy Random Selection Protocols.

In APPROX-RANDOM (pp 366-379)

Buhrman, H., Christandl, M., Perry, C., Zuiddam, J. (2016) Clean Quantum and Classical Communication Protocols.

Physical Review Letters, Vol. 117

Article | https://doi.org/10.1103/PhysRevLett.117.230503 | UvA-DARE

Buhrman, H., Christandl, M., Schaffner, C. (2012) Complete insecurity of quantum protocols for classical two-party computation.

Physical Review Letters, Vol. 109 (pp 160501)

Article | https://doi.org/10.1103/PhysRevLett.109.160501 | UvA-DARE

Buhrman, H., Christandl, M., Unger, F.P., Wehner, S.D.C., WInter, A. (2006) Implications of superstrong non-locality for cryptography.

In Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (pp 1919-1932)

Buhrman, H., Christandl, M., Zuiddam, J. (2017) Nondeterministic quantum communication complexity: The cyclic equality game and iterated matrix multiplication.

In Papadimitriou, C.H. (Eds.), 8th Innovations in Theoretical Computer Science Conference: ICTS 2017, January 9-11, 2017, Berkeley, CA, USA (Leibniz International Proceedings in Informatics, Vol. 67). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Buhrman, H., Cleve, R., de Wolf, R., Zalka, Ch. (1999) Bounds for small-error and zero-error quantum algorithms.

In Proceedings of 40th IEEE Symposium on the Foundations of Computer Science (FOCS'99) (pp 358-368)

Buhrman, H., Cleve, R., Koucký, M., Loff Barreto, B.S., Speelman, F. (2014) Computing with a full memory: Catalytic space.

In STOC '14: proceedings of the 2014 ACM Symposium on Theory of Computing : New York, New York, USA, May 31, 2014-June 3, 2014 (pp 857-866). ACM.

Buhrman, H., Cleve, R., Laurent, M., Linden, N., Schrijver, A., Unger, F.P. (2006) New limits on fault-tolerant quantum computation.

In 47th Annual IEEE Symposium on Foundations of Computer Science (pp 411-419)

Buhrman, H., Cleve, R., Massar, S., de Wolf, R. (2010) Nonlocality and communication complexity.

Reviews of Modern Physics, Vol. 82 (pp 665-698)

Article | https://doi.org/10.1103/RevModPhys.82.665 | UvA-DARE

Buhrman, H., Cleve, R., van Dam, W.K., Hoyer, P., Tapp, A. (1997) Multiparty quantum communication complexity..

Technical Report quant-ph. Unknown Publisher.

Report | UvA-DARE

Buhrman, H., Cleve, R., van Dam, W.K. (1997) Quantum entanglement and communication complexity..

Technical Report quant-ph. Unknown Publisher.

Report | UvA-DARE

Buhrman, H., Cleve, R., Watrous, J., de Wolf, R. (2001) Quantum fingerprinting.

Physical Review Letters, Vol. 87

Article | UvA-DARE

Buhrman, H., Czekaj, Łukasz, Grudka, Andrzej, Horodecki, M., Horodecki, P., Markiewicz, Marcin, Speelman, F., Strelchuk, Sergii (2016) Quantum communication complexity advantage implies violation of a Bell inequality.

Proceedings of the National Academy of Sciences of the United States of America, Vol. 113 (pp 3191-3196)

Article | https://doi.org/10.1073/pnas.1507647113 | UvA-DARE

Buhrman, H., Czekaj, Łukasz, Grudka, Andrzej, Horodecki, Michalł, Horodecki, Pawelł, Markiewicz, Marcin, Speelman, F., Strelchuk, Sergii (2016) Erratum: Quantum communication complexity advantage implies violation of a Bell inequality.

Proceedings of the National Academy of Sciences of the United States of America, Vol. 113

Erratum / Corrigendum | https://doi.org/10.1073/pnas.1606259113 | UvA-DARE

Buhrman, H., de Wolf, R. (2001) Communication complexity lower bounds by polynomials.

In Proceedings of 16th IEEE Conference on Computational Complexity (pp 120-130)