CaltechAUTHORS
  A Caltech Library Service

Optimal counterfeiting attacks and generalizations for Wiesner's quantum money

Molina, Abel and Vidick, Thomas and Watrous, John (2012) Optimal counterfeiting attacks and generalizations for Wiesner's quantum money. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190320-104220786

[img] PDF - Submitted Version
See Usage Policy.

188Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20190320-104220786

Abstract

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. We show that the optimal probability with which a counterfeiter can succeed in two independent verification attempts, given access to a single valid n-qubit bank note, is (3/4+√2/8)^n. We also analyze extensions of this variant to higher-dimensional schemes.


Item Type:Report or Paper (Discussion Paper)
Related URLs:
URLURL TypeDescription
https://arxiv.org/abs/1202.4010arXivDiscussion Paper
ORCID:
AuthorORCID
Vidick, Thomas0000-0002-6405-365X
Additional Information:Supported by Canada’s NSERC, CIFAR, and MITACS. Supported by the National Science Foundation under Grant No. 0844626. We thank Scott Aaronson for his question on Theoretical Physics Stack Exchange that originated the results in this paper as an answer, and Peter Shor for pointing out the connection between the channel representing an optimal attack on Wiesner’s quantum money, and the optimal cloners studied in [BCDM00] and [BH96]. JW thanks Debbie Leung and Joseph Emerson for helpful discussions. AM thanks Michael Grant and Stephen Boyd for their creation of the CVX software.
Funders:
Funding AgencyGrant Number
Natural Sciences and Engineering Research Council of Canada (NSERC)UNSPECIFIED
Canadian Institute for Advanced Research (CIFAR)UNSPECIFIED
MITACSUNSPECIFIED
NSFCCF-0844626
Record Number:CaltechAUTHORS:20190320-104220786
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20190320-104220786
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:93988
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:20 Mar 2019 17:48
Last Modified:03 Oct 2019 20:59

Repository Staff Only: item control page