activity
19982007
most citedAnyon computers with smaller groups

136 citations · 470 across the 9 of their papers we have counts for

collaborators

9 papers

quant-ph2007★ 48 cited

Quantum weak coin flipping with arbitrarily small bias

Carlos Mochon

"God does not play dice. He flips coins instead." And though for some reason He has denied us quantum bit commitment. And though for some reason he has even denied us strong coin f…

quant-ph2006★ 51 cited

Hamiltonian Oracles

Carlos Mochon

Hamiltonian oracles are the continuum limit of the standard unitary quantum oracles. In this limit, the problem of finding the optimal query algorithm can be mapped into the proble…

quant-ph2005★ 48 cited

A family of generalized `pretty good' measurements and the minimal-error pure-state discrimination problems for which they are optimal

Carlos Mochon

Paper withdrawn. Results are similar to V. P. Belavkin, "Optimum distinction of non-orthogonal quantum signals," Radio Engineering and Electronic Physics, vol. 20, June 1975, p. 39…

quant-ph2005★ 46 cited

A large family of quantum weak coin-flipping protocols

Carlos Mochon

Each classical public-coin protocol for coin flipping is naturally associated with a quantum protocol for weak coin flipping. The quantum protocol is obtained by replacing classica…

quant-ph2004★ 5 cited

Quantum weak coin-flipping with bias of 0.192

Carlos Mochon

A family of protocols for quantum weak coin-flipping which asymptotically achieve a bias of 0.192 is described in this paper. The family contains protocols with n+2 messages for al…

quant-ph2003★ 8 cited

Serial composition of quantum coin-flipping, and bounds on cheat detection for bit-commitment

Carlos Mochon

Quantum protocols for coin-flipping can be composed in series in such a way that a cheating party gains no extra advantage from using entanglement between different rounds. This co…