1.2k citations · 3.7k across the 62 of their papers we have counts for
66 papers
State preparation by shallow circuits using feed forward
Harry Buhrman, Marten Folkertsma, Bruno Loff +1
In order to achieve fault-tolerant quantum computation, we need to repeat the following sequence of four steps: First, perform 1 or 2 qubit quantum gates (in parallel if possible).…
Relating non-local quantum computation to information theoretic cryptography
Rene Allerstorfer, Harry Buhrman, Alex May +2
Non-local quantum computation (NLQC) is a cheating strategy for position-verification schemes, and has appeared in the context of the AdS/CFT correspondence. Here, we connect NLQC…
A Qubit, a Coin, and an Advice String Walk Into a Relational Problem
Scott Aaronson, Harry Buhrman, William Kretschmer
Relational problems (those with many possible valid outputs) are different from decision problems, but it is easy to forget just how different. This paper initiates the study of FB…
Noisy decoding by shallow circuits with parities: classical and quantum
Jop Briët, Harry Buhrman, Davi Castro-Silva +1
We consider the problem of decoding corrupted error correcting codes with NC circuits in the classical and quantum settings. We show that any such classical circuit can…
Quantum majority vote
Harry Buhrman, Noah Linden, Laura Mančinska +2
Majority vote is a basic method for amplifying correct outcomes that is widely used in computer science and beyond. While it can amplify the correctness of a quantum device with cl…
On the Role of Quantum Communication and Loss in Attacks on Quantum Position Verification
Rene Allerstorfer, Harry Buhrman, Florian Speelman +1
We study the role of quantum communication in attacks on quantum position verification. In this work, we construct the first known example of a QPV protocol that is provably secure…