177 citations · 983 across the 32 of their papers we have counts for
Showing 2005 · quant-phShow all
2 papers · 2 filters
quant-ph2005★ 3 cited
How to Make the Quantum Adiabatic Algorithm Fail
Edward Farhi, Jeffrey Goldstone, Sam Gutmann +1
The quantum adiabatic algorithm is a Hamiltonian based quantum algorithm designed to find the minimum of a classical cost function whose domain has size N. We show that poor choice…
quant-ph2005★ 17 cited
On the Optimality of Quantum Encryption Schemes
Iordanis Kerenidis, Daniel Nagaj
It is well known that n bits of entropy are necessary and sufficient to perfectly encrypt n bits (one-time pad). Even if we allow the encryption to be approximate, the amount of en…