22 citations · 121 across the 26 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
quant-ph2011★ 1 cited
Quantum Money with Classical Verification
Dmytro Gavinsky
We propose and construct a quantum money scheme that allows verification through classical communication with a bank. This is the first demonstration that a secure quantum money sc…
quant-ph2011★ 3 cited
Quantum algorithm for the Boolean hidden shift problem
Dmitry Gavinsky, Martin Roetteler, Jérémie Roland
The hidden shift problem is a natural place to look for new separations between classical and quantum models of computation. One advantage of this problem is its flexibility, since…