205 citations · 772 across the 10 of their papers we have counts for
10 papers
A Proof of the Security of Quantum Key Distribution
Eli Biham, Michel Boyer, P. Oscar Boykin +2
We prove the security of theoretical quantum key distribution against the most general attacks which can be performed on the channel, by an eavesdropper who has unlimited computati…
Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State
Eli Biham, Dan Kenigsberg
The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and…
Quantum Computing Without Entanglement
Eli Biham, Gilles Brassard, Dan Kenigsberg +1
It is generally believed that entanglement is essential for quantum computing. We present here a few simple examples in which quantum computing without entanglement is better than…
Analysis of Generalized Grover's Quantum Search Algorithms Using Recursion Equations
Eli Biham, Ofer Biham, David Biron +3
The recursion equation analysis of Grover's quantum search algorithm presented by Biham et al. [PRA 60, 2742 (1999)] is generalized. It is applied to the large class of Grover's ty…
A Proof of the Security of Quantum Key Distribution
Eli Biham, Michel Boyer, P. Oscar Boykin +2
We prove the security of quantum key distribution against the most general attacks which can be performed on the channel, by an eavesdropper who has unlimited computation abilities…
Grover's Quantum Search Algorithm for an Arbitrary Initial Amplitude Distribution
Eli Biham, Ofer Biham, David Biron +2
Grover's algorithm for quantum searching is generalized to deal with arbitrary initial complex amplitude distributions. First order linear difference equations are found for the ti…