(3.235.11.178) 您好!臺灣時間:2021/03/05 15:34
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:王教勛
研究生(外文):Chiao-Hsun Wang
論文名稱:儀器獨立隨機放大協定的負面結果
論文名稱(外文):Lower Bounds for Device Independent Randomness Amplification
指導教授:管希聖鐘楷閔
指導教授(外文):Hsi-Sheng GoanKai-Min Chung
口試日期:2017-07-28
學位類別:碩士
校院名稱:國立臺灣大學
系所名稱:物理學研究所
學門:自然科學學門
學類:物理學類
論文種類:學術論文
論文出版年:2016
畢業學年度:105
語文別:英文
論文頁數:41
中文關鍵詞:隨機放大協定量子密碼學
外文關鍵詞:Randomness AmplificationNon-signalingQuantum Cryptography
相關次數:
  • 被引用被引用:0
  • 點閱點閱:77
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
Randomness amplification 協定的目的是要藉由weak source 產生接近完美的亂數位元。在這篇論文中,我們證明了使用兩個儀器的
randomness amplification 協定有一些不能達到的結果。具體的結果是,給定任意使用兩個儀器的Randomness amplification 協定,當協定要求輸入的weak source 之min-entropy 的大小在log n 的量級時,存在一種策略可以以最高機率通過協定每一輪的測試,並且當協定接受時,產生的亂數位元在給定每一輪的輸入值以及額外資訊時是固定的。
Randomness amplification is a protocol that outputs nearly uniform bits using inputs generated from weak source. In this work, we present some
negative results for two-device randomness amplification protocol with weak source. Specifically, given a two-device randomness amplification protocol with inputs generated from a weak source that has log n min-entropy, then there exists a strategy which has the highest probability of passing every round of the protocol, such that if the protocol accepts, then the output of the protocol is deterministic given inputs for all round and side information.
Acknowledgements iii
摘要 v
Abstract vii
1 Introduction 1
2 Preliminary 3
2.1 Min-entropy source . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.2 Non-local Games . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
3 Model 7
3.1 Non-Signaling Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
3.1.1 Non-signaling systems and Non-signaling states . . . . . . . . . 7
3.2 Model for Certifiable Extraction of Randomness . . . . . . . . . . . . . . 8
3.3 Two-device DI-RA protocols . . . . . . . . . . . . . . . . . . . . . . . . 11
4 Lower Bounds 13
4.1 Optimal Strategy for Two-Device Protocols . . . . . . . . . . . . . . . . 14
4.2 Lower Bound for Two-Device Finite Round protocols . . . . . . . . . . . 22
4.3 Lower Bounds for Two-device Arbitrary Round Protocols . . . . . . . . 26
5 Conclusion 39
Bibliography 41
[AFRV16] Rotem Arnon-Friedman, Renato Renner, and Thomas Vidick. Non-Signaling Parallel Repetition Using de Finetti Reductions. IEEE Transactions on Information Theory, 62(3):1440–1457, 2016.
[CR12] Roger Colbeck and Renato Renner. Free randomness can be amplified. Nat Phys, 8(6):450–453, jun 2012.
[CSW14] K.-M. Chung, Y Shi, and X Wu. Physical Randomness Extractors: Generating Random Numbers with Minimal Assumptions. ArXiv e-prints, feb 2014.
[CSW16] Kai-Min Chung, Yaoyun Shi, and Xiaodi Wu. General Randomness Amplification with Non-signaling Security. 2016.
[GMD+13] Rodrigo Gallego, Lluis Masanes, Gonzalo De La Torre, Chirag Dhara, Leandro Aolita, and Antonio Acín. Full randomness from arbitrarily deterministic events. Nature Communications, 4:1–15, 2013.
[SV86] Miklos Santha and Umesh V. Vazirani. Generating quasi-random sequences from semi-random sources. Journal of Computer and System Sciences,33(1):75–87, 1986.
[Vad12] Salil P Vadhan. Pseudorandomness. Foundations and Trends® in Theoretical Computer Science, 7(1–3):1–336, 2012.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關論文
 
無相關期刊
 
無相關點閱論文
 
系統版面圖檔 系統版面圖檔