메뉴 건너뛰기




Volumn 89, Issue 22, 2002, Pages

Quantum Protocol for Cheat-Sensitive Weak Coin Flipping

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; SENSITIVITY ANALYSIS;

EID: 18844482435     PISSN: 00319007     EISSN: 10797114     Source Type: Journal    
DOI: 10.1103/PhysRevLett.89.227901     Document Type: Article
Times cited : (71)

References (13)
  • 1
    • 85038292490 scopus 로고    scopus 로고
    • Proceedings of the 24th IEEE Computer Conference, Compcon (IEEE, New York, 1982), p.�133
    • M. Blum, in Proceedings of the 24th IEEE Computer Conference, Compcon (IEEE, New York, 1982), p.�133.
    • Blum, M.1
  • 2
    • 84898989941 scopus 로고    scopus 로고
    • Proceedings of the 20th Annual ACM Symposium on Theory of Computing (Association for Computing Machinery, New York, 1988), p.�20
    • J. Kilian, in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (Association for Computing Machinery, New York, 1988), p.�20.
    • Kilian, J.1
  • 4
    • 0001731260 scopus 로고    scopus 로고
    • H.-K. Lo and H.F. Chau, Physica (Amsterdam) 120D, 177 (1998).
    • (1998) Physica (Amsterdam) , vol.120D , pp. 177
  • 5
    • 85038281137 scopus 로고    scopus 로고
    • A. Kitaev (unpublished), reported to us by A. Ambainis (personal communication).
    • Kitaev, A.1    Ambainis, A.2
  • 6
    • 85038293159 scopus 로고    scopus 로고
    • Proceedings of the 32nd Annual Symposium on Theory of Computing 2000 (Association for Computing Machinery, New York, 2000), p.�705
    • D. Aharonov et al, in Proceedings of the 32nd Annual Symposium on Theory of Computing 2000 (Association for Computing Machinery, New York, 2000), p.�705.
    • Aharonov, D.1
  • 8
    • 85038326010 scopus 로고    scopus 로고
    • Proceedings of the 33rd Annual Symposium on Theory of Computing 2001 (Association for Computing Machinery, New York, 2001), p.�134
    • A. Ambainis, in Proceedings of the 33rd Annual Symposium on Theory of Computing 2001 (Association for Computing Machinery, New York, 2001), p.�134.
    • Ambainis, A.1
  • 10
    • 85038283395 scopus 로고    scopus 로고
    • quant-ph/020463
    • A. Ambainis, quant-ph/020463.
    • Ambainis, A.1
  • 11
    • 85038309548 scopus 로고    scopus 로고
    • This is unfortunate since we believe that such a protocol could be used to build WCF that is arbitrarily bias resistant against both parties
    • This is unfortunate since we believe that such a protocol could be used to build WCF that is arbitrarily bias resistant against both parties.
  • 13
    • 85038319096 scopus 로고    scopus 로고
    • An alternative proof of property 4 can be found by using the following result: Given two density operators (Formula presented) and (Formula presented), satisfying (Formula presented), the largest probability with which (Formula presented) can appear in a convex decomposition of (Formula presented) is (Formula presented). This result was first pointed out to us by Michael Nielsen
    • An alternative proof of property 4 can be found by using the following result: Given two density operators (Formula presented) and (Formula presented), satisfying (Formula presented), the largest probability with which (Formula presented) can appear in a convex decomposition of (Formula presented) is (Formula presented). This result was first pointed out to us by Michael Nielsen.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.