東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Applications of semidefinite program...

Sikora, Jamie W. J.

Linked to FindBook

Google Book

Amazon

博客來

Applications of semidefinite programming in quantum cryptography.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Applications of semidefinite programming in quantum cryptography./
Author:	Sikora, Jamie W. J.
Description:	117 p.
Notes:	Source: Masters Abstracts International, Volume: 46-03, page: 1543.
Contained By:	Masters Abstracts International46-03.
Subject:	Mathematics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR34394
ISBN:	9780494343944

Applications of semidefinite programming in quantum cryptography.
Sikora, Jamie W. J.

Applications of semidefinite programming in quantum cryptography. - 117 p.

Source: Masters Abstracts International, Volume: 46-03, page: 1543.

Thesis (M.Math.)--University of Waterloo (Canada), 2007.

Furthermore, we present a family of protocols where one party has a greater probability of forcing an outcome of 0 than an outcome of 1. We also discuss a computer search to find specific protocols which minimize the maximum cheating probability.

ISBN: 9780494343944Subjects--Topical Terms:

515831
Mathematics.

Applications of semidefinite programming in quantum cryptography.
LDR:01811nam 2200277 a 45 001 942243
005 20110519
008 110519s2007 ||||||||||||||||| ||eng d
020 $a 9780494343944
035 $a (UMI)AAIMR34394
035 $a AAIMR34394
040 $a UMI $c UMI
100 1 $a Sikora, Jamie W. J. $3 1266340
245 1 0 $a Applications of semidefinite programming in quantum cryptography.
300 $a 117 p.
500 $a Source: Masters Abstracts International, Volume: 46-03, page: 1543.
502 $a Thesis (M.Math.)--University of Waterloo (Canada), 2007.
520 $a Furthermore, we present a family of protocols where one party has a greater probability of forcing an outcome of 0 than an outcome of 1. We also discuss a computer search to find specific protocols which minimize the maximum cheating probability.
520 $a Coin-flipping is the cryptographic task of generating a random coin-flip between two mistrustful parties. Kitaev [19] discovered that the security of quantum coin-flipping protocols can be analyzed using semidefinite programming. This led to his result that one party can force a desired coin-flip outcome with probability at least 1/ 2 .
520 $a We give sufficient background in quantum computing and semidefinite programming to understand Kitaev's semidefinite programming formulation for coin-flipping cheating strategies. These ideas are specialized to a specific class of protocols singled out by Nayak and Shor [29]. We also use semidefinite programming to solve for the maximum cheating probability of a particular protocol which has the best known security.
590 $a School code: 1141.
650 4 $a Mathematics. $3 515831
650 4 $a Physics, Theory. $3 1019422
690 $a 0405
690 $a 0753
710 2 $a University of Waterloo (Canada). $3 1017669
773 0 $t Masters Abstracts International $g 46-03.
790 $a 1141
791 $a M.Math.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR34394