File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1103/PhysRevLett.97.250501
- Scopus: eid_2-s2.0-33845642099
- WOS: WOS:000243414600005
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Security of quantum bit string commitment depends on the information measure
Title | Security of quantum bit string commitment depends on the information measure |
---|---|
Authors | |
Issue Date | 2006 |
Citation | Physical Review Letters, 2006, v. 97, n. 25, article no. 250501 How to Cite? |
Abstract | Unconditionally secure nonrelativistic bit commitment is known to be impossible in both the classical and the quantum world. However, when committing to a string of n bits at once, how far can we stretch the quantum limits? In this Letter, we introduce a framework of quantum schemes where Alice commits a string of n bits to Bob, in such a way that she can only cheat on a bits and Bob can learn at most b bits of information before the reveal phase. Our results are twofold: we show by an explicit construction that in the traditional approach, where the reveal and guess probabilities form the security criteria, no good schemes can exist: a+b is at least n. If, however, we use a more liberal criterion of security, the accessible information, we construct schemes where a=4log/2n+O(1) and b=4, which is impossible classically. Our findings significantly extend known no-go results for quantum bit commitment. © 2006 The American Physical Society. |
Persistent Identifier | http://hdl.handle.net/10722/285911 |
ISSN | 2021 Impact Factor: 9.185 2020 SCImago Journal Rankings: 3.688 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Buhrman, Harry | - |
dc.contributor.author | Christandl, Matthias | - |
dc.contributor.author | Hayden, Patrick | - |
dc.contributor.author | Lo, Hoi Kwong | - |
dc.contributor.author | Wehner, Stephanie | - |
dc.date.accessioned | 2020-08-18T04:56:58Z | - |
dc.date.available | 2020-08-18T04:56:58Z | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | Physical Review Letters, 2006, v. 97, n. 25, article no. 250501 | - |
dc.identifier.issn | 0031-9007 | - |
dc.identifier.uri | http://hdl.handle.net/10722/285911 | - |
dc.description.abstract | Unconditionally secure nonrelativistic bit commitment is known to be impossible in both the classical and the quantum world. However, when committing to a string of n bits at once, how far can we stretch the quantum limits? In this Letter, we introduce a framework of quantum schemes where Alice commits a string of n bits to Bob, in such a way that she can only cheat on a bits and Bob can learn at most b bits of information before the reveal phase. Our results are twofold: we show by an explicit construction that in the traditional approach, where the reveal and guess probabilities form the security criteria, no good schemes can exist: a+b is at least n. If, however, we use a more liberal criterion of security, the accessible information, we construct schemes where a=4log/2n+O(1) and b=4, which is impossible classically. Our findings significantly extend known no-go results for quantum bit commitment. © 2006 The American Physical Society. | - |
dc.language | eng | - |
dc.relation.ispartof | Physical Review Letters | - |
dc.title | Security of quantum bit string commitment depends on the information measure | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1103/PhysRevLett.97.250501 | - |
dc.identifier.scopus | eid_2-s2.0-33845642099 | - |
dc.identifier.volume | 97 | - |
dc.identifier.issue | 25 | - |
dc.identifier.spage | article no. 250501 | - |
dc.identifier.epage | article no. 250501 | - |
dc.identifier.eissn | 1079-7114 | - |
dc.identifier.isi | WOS:000243414600005 | - |
dc.identifier.issnl | 0031-9007 | - |