379 citations · 860 across the 7 of their papers we have counts for
7 papers
Semi-Quantum Key Distribution
Michel Boyer, Ran Gelles, Dan Kenigsberg +1
Secure key distribution among two remote parties is impossible when both are classical, unless some unproven (and arguably unrealistic) computation-complexity assumptions are made,…
Quantum Key Distribution with Classical Bob
Michel Boyer, Dan Kenigsberg, Tal Mor
Secure key distribution among two remote parties is impossible when both are classical, unless some unproven (and arguably unrealistic) computation-complexity assumptions are made,…
"Quantumness" versus "Classicality" of Quantum States
Berry Groisman, Dan Kenigsberg, Tal Mor
Entanglement is one of the pillars of quantum mechanics and quantum information processing, and as a result the quantumness of nonentangled states has typically been overlooked and…
Secure Controlled Teleportation
Dan Kenigsberg, Tal Mor
Several protocols for controlled teleportation were suggested by Yang, Chu, and Han [PRA 70, 022329 (2004)]. In these protocols, Alice teleports qubits (in an unknown state) to Bob…
Quantum Advantage without Entanglement
Dan Kenigsberg, Tal Mor, Gil Ratsaby
We study the advantage of pure-state quantum computation without entanglement over classical computation. For the Deutsch-Jozsa algorithm we present the maximal subproblem that can…
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…