• Publications
  • Influence
Limits on the security of coin flips when half the processors are faulty
  • R. Cleve
  • Computer Science
  • STOC '86
  • 1 November 1986
TLDR
We prove tha t the above protocols are opt imal in the sense tha t no protocol exists which tolerates faults in at least half of the processors. Expand
  • 404
  • 48
  • PDF
Quantum algorithms revisited
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantumExpand
  • 818
  • 44
  • PDF
HOW TO SHARE A QUANTUM SECRET
We investigate the concept of quantum secret sharing. In a (k,thinspn) threshold scheme, a secret quantum state is divided into n shares such that any k of those shares can be used to reconstruct theExpand
  • 959
  • 33
  • PDF
Exponential algorithmic speedup by a quantum walk
TLDR
We construct a black box graph traversal problem that can be solved exponentially faster on a quantum computer than on a classical computer. Expand
  • 616
  • 33
  • PDF
Quantum lower bounds by polynomials
TLDR
We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}/sup N/ in the black-box model. Expand
  • 319
  • 32
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
We present an efficient quantum algorithm for simulating the evolution of a quantum state for a sparse Hamiltonian H over a given time t in terms of a procedure for computing the matrix entries of H.Expand
  • 377
  • 32
  • PDF
Quantum vs. classical communication and computation
TLDR
We present a simple and general simulation technique that transforms any black-box quantum algorithm (a la Grover's database search algorithm) to a quantum communication protocol for a related problem, in a way that fully exploits the quantum parallelism. Expand
  • 397
  • 30
  • PDF
Quantum lower bounds by polynomials
TLDR
We examine the number of queries to input variables that a quantum algorithm requires to compute Boolean functions on {0,1}N in the black-box model. Expand
  • 428
  • 27
  • PDF
Computing Algebraic Formulas Using a Constant Number of Registers
TLDR
It is shown that, over an arbitrary ring, the functions computed by algebraic formulas are also computed by polynomial-length algebraic straight-line programs that use only three registers, which is an improvement over previous methods that require the number of registers to be logarithmic in the size of the formulas. Expand
  • 152
  • 23
Consequences and limits of nonlocal strategies
TLDR
This paper investigates various aspects of the nonlocal effects that can arise when entangled quantum information is shared between two parties. Expand
  • 192
  • 22
...
1
2
3
4
5
...