File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.physleta.2013.02.045
- Scopus: eid_2-s2.0-84875367382
- WOS: WOS:000317448800003
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A short impossibility proof of quantum bit commitment
Title | A short impossibility proof of quantum bit commitment |
---|---|
Authors | |
Keywords | Quantum bit commitment Quantum combs Quantum protocols |
Issue Date | 2013 |
Citation | Physics Letters, Section A: General, Atomic and Solid State Physics, 2013, v. 377, n. 15, p. 1076-1087 How to Cite? |
Abstract | Bit 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 Identifier | http://hdl.handle.net/10722/213297 |
ISSN | 2015 Impact Factor: 1.677 2015 SCImago Journal Rankings: 0.755 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chiribella, Giulio | - |
dc.contributor.author | D'Ariano, Giacomo Mauro | - |
dc.contributor.author | Perinotti, Paolo | - |
dc.contributor.author | Schlingemann, Dirk | - |
dc.contributor.author | Werner, Reinhard | - |
dc.date.accessioned | 2015-07-28T04:06:48Z | - |
dc.date.available | 2015-07-28T04:06:48Z | - |
dc.date.issued | 2013 | - |
dc.identifier.citation | Physics Letters, Section A: General, Atomic and Solid State Physics, 2013, v. 377, n. 15, p. 1076-1087 | - |
dc.identifier.issn | 0375-9601 | - |
dc.identifier.uri | http://hdl.handle.net/10722/213297 | - |
dc.description.abstract | Bit 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.language | eng | - |
dc.relation.ispartof | Physics Letters, Section A: General, Atomic and Solid State Physics | - |
dc.subject | Quantum bit commitment | - |
dc.subject | Quantum combs | - |
dc.subject | Quantum protocols | - |
dc.title | A short impossibility proof of quantum bit commitment | - |
dc.type | Article | - |
dc.description.nature | Link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/j.physleta.2013.02.045 | - |
dc.identifier.scopus | eid_2-s2.0-84875367382 | - |
dc.identifier.volume | 377 | - |
dc.identifier.issue | 15 | - |
dc.identifier.spage | 1076 | - |
dc.identifier.epage | 1087 | - |
dc.identifier.isi | WOS:000317448800003 | - |