簡易檢索 / 詳目顯示

回結果列表
研究生： 余怡青
I-Ching Yu
論文名稱： 測試訊息因果論在量子通訊中的正確性
Information causality and its tests for quantum communications
指導教授： 林豐利
Lin, Feng-Li
學位類別： 博士
Doctor
系所名稱： 物理學系
Department of Physics
論文出版年： 2013
畢業學年度： 101
語文別： 英文
論文頁數： 122
中文關鍵詞： 訊息因果論 、量子通訊 、量子計算 、量子非定域性
英文關鍵詞： Information Causality, quantum communication, quantum computation, quantum non-locality
論文種類： 學術論文
相關次數： 點閱：161  下載：15 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 在基於物理理論的通訊協定中, 例如:量子力學, 訊息因果論限制傳送者與
    接受者之間的最大共有訊息量.
    我們通過更廣泛的框架, 即使用討論訊號傳送及錯誤計算的結果, 來重新
    了解訊息因果論與量子力學的關係. 在我們的框架中, 訊息因果論將導致一組
    在二態量子系統下的Tsirelson 不等式 (量子系統的極限值). 基於這樣的結
    果, 訊息因果論對使用物理系統的實驗產生限制. 此外, 在我們的框架中, 可
    信賴的非定域性的計算是不可行的. 訊息因果論的限制將使得物理系統的計算
    線路無法進行可信賴的計算.
    另外, 我們直接計算共有訊息量, 藉以測試訊息因果論在更普遍的通訊協
    定中的正確性, 這些普遍的通訊協定包含多態的系統及非對稱的通訊管道. 我
    們的結果支持訊息因果論, 意思是在這些普遍的通訊協定中, 共有訊息量不會
    超過訊息因果論給的限制. 此外, 如果通訊管道包含兩個輸出及兩個輸入, 我
    們發現共有的量子系統擁有最大非定域性時 (滿足Tsirelson 不等式的限制),
    共有訊息量的值不是最大的. 最大的共有訊息量出現在共有的系統恰好滿足定
    域性理論給出的極大值時 (Bell 不等式給的限制), 且此時共有的訊息量和訊
    息因果論給的限制相同. 這個結果指出共享一個量子非定域系統, 並不一定產
    生較多的共有訊息量.

    Information causality has been proposed to constrain the maximal mutual information shared between sender and receiver in a communication protocol based on physical theories such as quantum mechanics.

    We reformulate the information causality in a more general framework by adopting the results of signal propagation and computation in a noisy circuit. In our framework, the information causality leads to a broad class of Tsirelson inequalities for the two-level quantum systems. This fact allows us to subject the information causality to
    the experimental scrutiny. A no-go theorem for reliable nonlocal computation is also derived. Information causality prevents any physical circuit from performing reliable computations.

    Moreover, we test the information causality for the more general quantum communication protocols with multi-level and (non-)symmetric channels by directly evaluating the mutual information. Our results support the information causality which is never violated for the more general settings discussed in this work. For the two-inputs/two-outputs cases, we also find that the information causality is saturated not for the channels with the maximal quantum
    non-locality associated with the Tsirelson inequality but for the marginal cases saturating the Bell's inequality. This indicates that the more quantum non-locality may not always yield the more mutual information.

    Table of Contents . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . vi List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix Chapter 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 No-signaling theory and quantum non-locality . . . . . . . . . . . . . . . . 1 1.1.1 Quantum non-locality . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1.1.1 The EPR paradox and the local hidden variable theory . . 2 1.1.1.2 The Bell's inequality and the CHSH inequality . . . . . . 4 1.1.1.3 More general Bell-type inequalities . . . . . . . . . . . . . 8 1.1.2 No-signaling theory . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 1.1.2.1 The measurement scenario and the box version . . . . . . 11 1.1.2.2 No-signaling correlations . . . . . . . . . . . . . . . . . . . 12 1.1.3 Could the no-signaling theory single out quantum correlations? . . . 13 1.1.3.1 Beyond the quantum correlations . . . . . . . . . . . . . . 13 1.1.3.2 The no-signaling polytope . . . . . . . . . . . . . . . . . . 15 1.1.3.3 The communication complexity and the extremal non-local correlations . . . . . . . . . . . . . . . . . . . . . . . 16 1.2 Information Causality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 1.2.1 Information Causality single out quantum correlation? . . . . . . . 18 1.2.2 Information Causality and the Tsirelson bound . . . . . . . . . . . 20 1.2.2.1 The extremal non-locality violates Information Causality . 20 1.2.2.2 Information Causality derives the Tsirelson bound . . . . 21 1.2.3 Information Causality and the boundary of quantum correlations . 24 1.3 Signal propagating and noisy computation . . . . . . . . . . . . . . . . . . 28 1.3.1 The e efficient propagation through a noisy channel . . . . . . . . . . 28 1.3.2 The noisy computation . . . . . . . . . . . . . . . . . . . . . . . . . 30 1.3.2.1 The model of noisy computation . . . . . . . . . . . . . . 30 1.3.2.2 The tolerable error rate and the depth for a reliable computation. . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 1.4 Semidefi nite programming and the quantum correlations for the bi-partite systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 1.4.1 The quantum correlations for two-level quantum systems . . . . . . 37 1.4.1.1 Characterizing quantum correlations by Tsirelson's theorem 37 1.4.1.2 The maximally quantum violation for the CHSH-type inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 1.4.2 The quantum correlations for more general quantum systems . . . . 39 1.4.2.1 The constraints for bi-partite quantum probabilities . . . . 40 1.4.2.2 Bounding the quantum correlations with the hierarchical semidefi nite programming . . . . . . . . . . . . . . . . . . 42 1.4.2.3 The maximally quantum violation for the general Bell-type inequality . . . . . . . . . . . . . . . . . . . . . . . . 43 2 Information Causality and Noisy Computations . . . . . . . . . . . . . . . . . . 44 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 2.2 Tsirelson-type inequalities from the information causality . . . . . . . . . . 46 2.3 Noisy nonlocal computation . . . . . . . . . . . . . . . . . . . . . . . . . . 48 2.4 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51 3 Testing Information Causality for General Quantum Communication Protocols . 52 3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 3.2 Multi-level Bell-type inequality from signal decay theorem . . . . . . . . . 58 3.3 Convexity and mutual information . . . . . . . . . . . . . . . . . . . . . . 61 3.3.1 Feasibility for maximizing mutual information by convex optimization? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 3.3.2 Convex optimization for symmetric and isotropic channels with i.i.d. and uniform input marginal probabilities . . . . . . . . . . . . . . . 64 3.4 Finding the bound of Bell-type inequality from the hierarchical semidefi nite programming . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66 3.4.1 Projection operators with quantum behaviors . . . . . . . . . . . . 66 3.4.2 Hierarchy of the semidefi nite programming . . . . . . . . . . . . . . 70 3.4.3 The bound of Bell-type inequality and the corresponding mutual information in the hierarchical semidefi nite programming . . . . . . 72 3.5 Maximizing mutual information for general quantum communication channels 76 3.5.1 Symmetric channels with i.i.d. and uniform input marginal probabilities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79 3.5.2 Channels with non-uniform input marginal probabilities . . . . . . 81 3.5.3 Information causality for the most general channels . . . . . . . . . 85 3.6 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 4 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87 Appendix A Signal decay and data processing inequality for multi-nary channels . . . . . . . 89 A.1 Sketch of the proof in [50] . . . . . . . . . . . . . . . . . . . . . . . . . . . 90 A.2 Generalizing to the multi-nary channels . . . . . . . . . . . . . . . . . . . . 91 B The concavity of mutual information . . . . . . . . . . . . . . . . . . . . . . . . 94 C Semidefi nite programming . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 D The Tsirelson-type inequality derived from the information causality . . . . . . 99 D.1 Checking the Tsirelson-type bound by semidefi nite programming . . . . . . 100 E The quantum constraints for n = 1 and n = 1 + AB certificate . . . . . . . . . . 104 E.1 The quantum constraints for n = 1 and n = 1 + AB certificate . . . . . . . 104 E.2 Estimating the number of constrains for n = 1 and n = 1 + AB certificate 105

    [1] P. W. Shor., "Polynomial-time algorithms for prime factorization and discrete logarithms
    on a quantum computer", SIAM Journal on Computing, 26(5):1484V1509,
    (1997).
    [2] C. H. Bennett and G. Brassard., "Quantum cryptography: Public key distribution
    and coin tossing", In Proceedings of the IEEE International Conference on Computers,
    Systems and Signal Processing, pages 175 V179, 1984.
    [3] A. Einstein, B. Podolsky, and N. Rosen, "Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?", Phys. Rev. 47, 777V780 (1935).
    [4] Bohm, D.,1951, Quantum Theory, New York: Prentice Hall.
    [5] J. S. Bell, "On the Einstein Podolsky Rosen Paradox", Physics 1, 3, 195-200 (1964).
    [6] J. Clauser, M. Horne, A. Shimony, and R. Holt, "Proposed experiment to test local hidden-variable theories", Phys. Rev. Lett. 23, 880 (1969).
    [7] B. S. Cirel'son, "Quantum Generalizations of Bell's Inequality", Lett. Math. Phys. 4, 93 (1980).
    [8] D. Collins, N. Gisin, N. Linden, S. Massar, and S. Popescu, "Quantum correlations for arbitrarily high-dimensional Bell inequality", Phys. Rev. Lett. 88, 040404 (2002).
    [9] N. Gisin, "Bell inequality for arbitrary many settings of the analyzers", Phys. Lett. A 260, 1 (1999).
    [10] G. C. Ghirardi, A. Rimini, and T. Weber, "A general argument against superluminal transmission through the quantum mechanical measurement process", Lett. Nuov.
    Cim. 27, 293 (1980).
    [11] L. Masanes, A. Acin, and N. Gisin, "General properties of non signaling theories", Phys. Rev. A 73, 012112 (2006).
    [12] J. Barrett, "Information processing in generalized probabilistic theories", Phys. Rev. A 75, 032304 (2007).
    [13] H. Barnum, J. Barrett, M. Leifer, and A.Wilce, "Generalized No-Broadcasting Theorem", Phys. Rev. Lett. 99, 240501 (2007).
    [14] J. Barrett, L. Hardy, and A. Kent, "No Signalling and Quantum Key Distribution", Phys. Rev. Lett. 95, 010503 (2005).
    [15] A. Acin, N. Gisin, and L.Masanes, "From Bell's Theorem to Secure Quantum Key Distribution", Phys. Rev. Lett. 97, 120405 (2006).
    [16] Masanes, Ll., Acin, A., Gisin, N., "General properties of non signaling theories", Phys. Rev. A. 73, 012112 (2006).
    [17] J. Barrett, N. Linden, S. Massar, S. Pironio, S. Popescu, and D. Roberts, "Non-local correlations as an information theoretic resource", Phys. Rev. A 71, 022101 (2005).
    [18] V. Scarani, N. Gisin, N. Brunner, L. Masanes, S. Pino, and A. Acn, "Secrecy extraction from no-signalling correlations", Phys. Rev. A 74, 042339 (2006).
    [19] N. Linden, S. Popescu, A. J. Short, and Andreas Winter, "Quantum nonlocality and beyond: Limits from nonlocal computation", Phys. Rev. Lett. 99, 180502 (2007).
    [20] J. Barrett, N. Linden, S. Massar, S. Pironio, S. Popescu and D. Roberts, "Information processing in generalized probabilistic theories", Phys. Rev. A 71, 022101 (2005).
    [21] S. Popescu and D. Rohrlich, "Quantum nonlocality as an axiom", Foundations of Physics, 24(3):379V385, 1994.
    [22] A. Fine, "Hidden Variables, Joint Probability, and the Bell Inequalities", Phys. Rev. Lett. 48, 291 (1982).
    [23] Yao, A. C. (1979), "Some Complexity Questions Related to Distributed Computing", Proc. of 11th STOC 14: 209V213
    [24] van Dam W., "Implausible consequences of super strong nonlocality", arXiv:quantph/0501159v1.
    H. Buhrman, R. Cleve, S. Massar and R. de Wolf, "Nonlocality and communication complexity", Rev. Mod. Phys., vol. 82, 665 (2010).
    [26] R.Cleve and H.Buhrman, "Substituting quantum entanglement for communication", Physical Review A, 56(2):1201V1204, 1997.
    [27] G. Brassard et al., "Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial", Phys. Rev. Lett. 96, 250401 (2006).
    [28] N. Brunner and P. Skrzypczyk, "Non-locality distillation and post-quantum theories with trivial communication complexity", Phys. Rev. Lett. 102, 160403 (2009).
    [29] M. Pawlowski, T. Paterek, D. Kaszlikowski, V. Scarani, A. Winter, and M. Zukowski, "Information causality as a physical principle", Nature (London) 461, 1101 (2009).
    [30] A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani, "Dense Quantum Coding and Quantum Finite Automata", Journal of the ACM 49, 496 (2002).
    [31] M. Pawlowski and M. Zukowski, "Entanglement-assisted random access codes", Phys. Rev. A 81, 042326 (2010).
    [32] L. -Y. Hsu, I-C. Yu and F. -L. Lin, "Information Causality and Noisy Computations", Phys. Rev. A 84, 042319 (2011).
    [33] I-C. Yu and F. -L. Lin, "Testing Information Causality for General Quantum Communication Protocols", arXiv:1301.1448.
    [34] Navascues M. and Wunderlich H., "A glance beyond the quantum model",(2009) Proc. R. Soc. A 466, 881.
    [35] J. Allcock, N. Brunner, M. Paw lowski, and V. Scarani, "Recovering part of the boundary between quantum and nonquantum correlations from information causality",
    Phys. Rev. A 80, 040103 (2009).
    [36] D. Cavalcanti, A. Salles, and V. Scarani, "Macroscopically local correlations can violate information causality", Nat. Comm. 1, 136 (2010).
    [37] T. H. Yang, D. Cavalcanti, M. L. Almeida, C. Teo, and V. Scarani, "Information-Causality and Extremal Tripartite Correlation", New J. Phys. 14, 013061 (2012).
    [38] Y. Xiang, W. Ren, "Bound on genuine multipartite correlations from the principle of information causality", Quantum Inf. Comput. 11, 948 (2011).
    [39] R. Gallego, L. E. Wuringer, A. Acn, and M. Navascues, "Quantum correlations require multipartite information principles", Phys. Rev. Lett. 107, 210403 (2011).
    [40] Sabri W. Al-Sa and Anthony J. Short, "Information causality from an entropic and a probabilistic perspective", Phys. Rev. A 84, 042323 (2011).
    [41] J. Unk, "Quadratic bell inequalities as tests for multipartite entanglement", Phys. Rev. Lett 88, 230406 (2002).
    [42] L. Landau, "Empirical Two-Point Correlation Functions", Found. Phys. 18, 449 (1988).
    [43] L. Masanes, "Necessary and sufficient condition for quantum-generated correlations", quant-ph/0309137.
    [44] M. Navascues, S. Pironio, and A. Acin, "Bounding the set of quantum correlations", Phys. Rev. Lett. 98, 010401 (2007).
    [45] M. Navascues, S. Pironio, A. Acin, "A convergent hierarchy of semidefi nite programs characterizing the set of quantum correlations", New J. Phys. 10, 073013 (2008).
    [46] C. E. Shannon, "A mathematical theory of communication", Bell System Tech. J., 27:379V423; 623V656, 1948.
    [47] J. von Neumann, "Probabilistic logics and the synthesis of reliable organisms from unreliable components", In C. E. Shannon and J. McCarthy, editors, Automata Studies,pages 43V98. Princeton University Press, 1956.
    [48] N. Pippenger, "Reliable computation by formulas in the presence of noise", IEEE Transactions on Information Theory, 34(2):194V197, March 1988.
    [49] W. Evans' PhD thesis, "Information Theory and Noisy Computation", http://www.cs.ubc.ca/ will/papers/thesis.pdf
    [50] W. Evans and L. J. Schulman, "Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas", Proceedings of the 34th Annual Symposium
    on Foundations of Computer Science, 594 (1993).
    [51] W. Evans and L. J. Schulman, "Signal Propagation and Noisy Circuits", IEEE Trans. Inf. Theory, 45, 2367 (1999).
    [52] Oscar C. O. Dahlsten, D. Lercher and R. Renner. "Tsirelson's bound from a generalized data processing inequality", New J. Phys. 14, 063024 (2012).
    [53] B. Cirelson (Tsirelson), "Quantum generalizations of Bell's inequality", Lett. Math. Phys. 4, 93 (1980).
    [54] B. Tsirelson, "Quantum analogues of the Bell inequalities", J. Sov. Math. 36, 557 (1987).
    [55] B. Tsirelson, "Some results and problems on quantum Bell-type inequalities", Hadronic J. Suppl. 8, 329 (1993).
    [56] S.Wehner, "Tsirelson bounds for generalized Clauser-Horne-Hold inequalities", Phys. Rev. A 73, 022110 (2006).
    [57] T. Vertesi and K. Pal, "Generalized Clauser-Horne-Shimony-Holt inequalities maximally violated by higher-dimensional systems", Phys. Rev. A 77, 042106 (2008)
    [58] A. Acn, T. Durt, N. Gisin and J. I. Latorre, "Quantum nonlocality in two three-level systems", Phys. Rev. A 65, 052325 (2002)
    [59] http://www.theory.caltech.edu/people/preskill/ph229/
    [60] M. A. Nielsen, I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000).
    [61] L. Vandenberghe and S. Boyd, SIAM Review 38, 1 (1996).
    [62] J. Sturm and AdvOL, http://sedumi.mcmaster.ca.
    [63] http://abel.ee.ucla.edu/cvxopt/ .
    [64] Boyd, Stephen and Vandenberghe, Lieven (2004). Convex Optimization. Cambridge University Press.
    [65] http://homepages.cwi.nl/~monique/ow-seminar-sdp/files/ow_{i}%ntro_{s}dp.pdf
    [66] C. Helmberg. Semidefi nite programming for combinatorial optimization. Technical Report ZIB-Report ZR-00-34, Konrad-Zuse-Zentrum Berlin, 2000.
    [67] Singiresu S. Rao, Engineering Optimization: Theory and Practice, Fourth Edition, John Wiley , Sons, Inc, 2009.
    [68] T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.

    下載圖示
    QR CODE