File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A short impossibility proof of quantum bit commitment

TitleA short impossibility proof of quantum bit commitment
Authors
KeywordsQuantum bit commitment
Quantum combs
Quantum protocols
Issue Date2013
Citation
Physics Letters, Section A: General, Atomic and Solid State Physics, 2013, v. 377, n. 15, p. 1076-1087 How to Cite?
AbstractBit commitment protocols, whose security is based on the laws of quantum mechanics alone, are generally held to be impossible on the basis of a concealment-bindingness tradeoff (Lo and Chau, 1997 [1], Mayers, 1997 [2]). A strengthened and explicit impossibility proof has been given in D'Ariano et al. (2007) [3] in the Heisenberg picture and in a *-algebraic framework, considering all conceivable protocols in which both classical and quantum information is exchanged. In the present Letter we provide a new impossibility proof in the Schrödinger picture, greatly simplifying the classification of protocols and strategies using the mathematical formulation in terms of quantum combs (Chiribella et al., 2008 [4]), with each single-party strategy represented by a conditioned comb. We prove that assuming a stronger notion of concealment - for each classical communication history, not in average - allows Alice's cheat to pass also the worst-case Bob's test. The present approach allows us to restate the concealment-bindingness tradeoff in terms of the continuity of dilations of probabilistic quantum combs with the metric given by the comb discriminability-distance. © 2013 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/213297
ISSN
2015 Impact Factor: 1.677
2015 SCImago Journal Rankings: 0.755
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChiribella, Giulio-
dc.contributor.authorD'Ariano, Giacomo Mauro-
dc.contributor.authorPerinotti, Paolo-
dc.contributor.authorSchlingemann, Dirk-
dc.contributor.authorWerner, Reinhard-
dc.date.accessioned2015-07-28T04:06:48Z-
dc.date.available2015-07-28T04:06:48Z-
dc.date.issued2013-
dc.identifier.citationPhysics Letters, Section A: General, Atomic and Solid State Physics, 2013, v. 377, n. 15, p. 1076-1087-
dc.identifier.issn0375-9601-
dc.identifier.urihttp://hdl.handle.net/10722/213297-
dc.description.abstractBit commitment protocols, whose security is based on the laws of quantum mechanics alone, are generally held to be impossible on the basis of a concealment-bindingness tradeoff (Lo and Chau, 1997 [1], Mayers, 1997 [2]). A strengthened and explicit impossibility proof has been given in D'Ariano et al. (2007) [3] in the Heisenberg picture and in a *-algebraic framework, considering all conceivable protocols in which both classical and quantum information is exchanged. In the present Letter we provide a new impossibility proof in the Schrödinger picture, greatly simplifying the classification of protocols and strategies using the mathematical formulation in terms of quantum combs (Chiribella et al., 2008 [4]), with each single-party strategy represented by a conditioned comb. We prove that assuming a stronger notion of concealment - for each classical communication history, not in average - allows Alice's cheat to pass also the worst-case Bob's test. The present approach allows us to restate the concealment-bindingness tradeoff in terms of the continuity of dilations of probabilistic quantum combs with the metric given by the comb discriminability-distance. © 2013 Elsevier B.V. All rights reserved.-
dc.languageeng-
dc.relation.ispartofPhysics Letters, Section A: General, Atomic and Solid State Physics-
dc.subjectQuantum bit commitment-
dc.subjectQuantum combs-
dc.subjectQuantum protocols-
dc.titleA short impossibility proof of quantum bit commitment-
dc.typeArticle-
dc.description.natureLink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.physleta.2013.02.045-
dc.identifier.scopuseid_2-s2.0-84875367382-
dc.identifier.volume377-
dc.identifier.issue15-
dc.identifier.spage1076-
dc.identifier.epage1087-
dc.identifier.isiWOS:000317448800003-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats