We study a physical system -- the Ising quantum chain with alternating sector interaction defects, but constant transverse field -- which is equivalent to applying the quantum adiabatic algorithm to a particular SAT problem.Expand

We show how a fully classical party can direct the actions of two untrusted quantum devices, and extract secret key material from a random block of games.Expand

State conversion generalizes query complexity to the problem of converting between two input-dependent quantum states by making queries to the input.Expand

We give a quantum algorithm for evaluating formulas over an extended gate set, including all two- and three-bit binary gates (e.g., NAND, 3-majority).Expand

We show that any boolean function can be evaluated optimally by a quantum query algorithm that alternates a certain fixed, input-independent reflection with a second reflection that coherently queries the input string.Expand

We prove a rigidity theorem for the famous Clauser-Horne-Shimony-Holt game, first formulated to provide a means of experimentally testing the violation of the Bell inequalities.Expand