Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum… Expand

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 the… Expand

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

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

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

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