2012

Optimal counterfeiting attacks and generalizations for Wiesner's quantum money

Molina, Abel, Vidick, Thomas, Watrous, John

Understand

We present an analysis of Wiesner's quantum money scheme, as well as some natural generalizations of it, based on semidefinite programming.

  • For Wiesner's original scheme, it is determined that the optimal probability for a counterfeiter to create two copies of a bank note from one, where both copies pass the bank's test for validity, is (3/4)^n for n being the number of qubits used for each note.
  • Generalizations in which other ensembles of states are substituted for the one considered by Wiesner are also discussed, including a scheme recently proposed by Pastawski, Yao, Jiang, Lukin, and Cirac, as well as schemes based on higher dimensional quantum systems.
  • In addition, we introduce a variant of Wiesner's quantum money in which the verification protocol for bank notes involves only classical communication with the bank.

Reading the bibliography…