80 citations · 314 across the 31 of their papers we have counts for
4 papers · 2 filters
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…
Algorithms on Ensemble Quantum Computers
P. Oscar Boykin, Tal Mor, Vwani Roychowdhury +1
In ensemble (or bulk) quantum computation, measurements of qubits in an individual computer cannot be performed. Instead, only expectation values can be measured. As a result of th…
On Universal and Fault-Tolerant Quantum Computing
P. Oscar Boykin, Tal Mor, Matthew Pulver +2
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environm…
An Almost-Quadratic Lower Bound for Quantum Formula Size
Vwani P. Roychowdhury, Farrokh Vatan
We show that Nechiporuk's method for proving lower bound for Boolean formulas can be extended to the quantum case. This leads to an n^2 / log^2 n lower bound for quantum formulas c…