• Publications
  • Influence
Fault-Tolerant Quantum Computation
TLDR
Fault tolerance is the study of reliable computation using unreliable components. Expand
  • 255
  • 24
  • PDF
The quantum adiabatic optimization algorithm and local minima
  • B. Reichardt
  • Mathematics, Computer Science
  • STOC '04
  • 13 June 2004
TLDR
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
  • 95
  • 14
  • PDF
Classical command of quantum systems
TLDR
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
  • 229
  • 12
  • PDF
Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
  • B. Reichardt
  • Mathematics, Physics
  • 50th Annual IEEE Symposium on Foundations of…
  • 17 April 2009
TLDR
The general adversary bound is a semi-definite program (SDP) that lower-bounds the quantum query complexity of a function. Expand
  • 135
  • 7
  • PDF
Quantum Query Complexity of State Conversion
TLDR
State conversion generalizes query complexity to the problem of converting between two input-dependent quantum states by making queries to the input. Expand
  • 127
  • 7
  • PDF
Span-program-based quantum algorithm for evaluating formulas
TLDR
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
  • 105
  • 6
  • PDF
Fault-tolerant ancilla preparation and noise threshold lower boudds for the 23-qubit Golay code
TLDR
We provide two simplified circuits for fault-tolerant preparation of Golay code-encoded ancillas. Expand
  • 41
  • 6
  • PDF
Reflections for quantum query algorithms
  • B. Reichardt
  • Computer Science, Mathematics
  • SODA '11
  • 10 May 2010
TLDR
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
  • 149
  • 5
  • PDF
A classical leash for a quantum system: command of quantum systems via rigidity of CHSH games
TLDR
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
  • 89
  • 5
  • PDF
Universal fault-tolerant quantum computation with only transversal gates and error correction.
TLDR
Transversal implementations of encoded unitary gates are highly desirable for fault-tolerant quantum computation. Expand
  • 133
  • 5
  • PDF
...
1
2
3
4
5
...