請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/37818
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 郭斯彥 | |
dc.contributor.author | Shiou-An Wang | en |
dc.contributor.author | 王秀安 | zh_TW |
dc.date.accessioned | 2021-06-13T15:45:25Z | - |
dc.date.available | 2008-07-07 | |
dc.date.copyright | 2008-07-07 | |
dc.date.issued | 2008 | |
dc.date.submitted | 2008-07-01 | |
dc.identifier.citation | [1] P. W. Shor, 'Algorithms for Quantum Computation: Discrete Logarithms and Factoring', Proc. 35th Annu. IEEE Symp. Foundations of Computer Science, pp. 124-134, 1994.
[2] L. Grover, 'A Fast Quantum Mechanical Algorithm for Database Search', Proc. 28th Annu. ACM Symp. Theory of Computing, pp. 212-219, 1996. [3] C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, W. K. Wootters, 'Teleporting an Unknown Quantum State via Dual Classical and Einstein-Podolsky-Rosen Channels,' Phys. Rev. Lett. 70, pp. 1895-1899, 1993. [4] C. Bennett and S.J. Wiesner. 'Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states,' Phys. Rev. Lett., 69, 2881, 1992. [5] C. H. Bennett and G. Brassard, 'Quantum Cryptography: Public Key Distribution and Coin Tossing,' Proc. Int'l Conf. Computers, Systems & Signal Processing, pp. 175-179, 1984. [6] A. K. Ekert, 'Quantum cryptography based on Bell's theorem,' Phys. Rev. Lett. 67, pp. 661-663, 1991 [7] C. H. Bennett, 'Quantum Cryptography: Uncertainty in the Service of Privacy,' Science, vol. 257, no. 5071, pp. 752-753, 1992. [8] C. H. Bennett, G. Brassard, and N. D. Mermin, 'Quantum cryptography without Bell's theorem,' Phys. Rev. Lett. 68, pp. 557-559, 1992. [9] L. Goldenberg and L. Vaidman, 'Quantum Cryptography Based on Orthogonal States,' Phys. Rev. Lett. 75, pp. 1239-1243, 1995. [10] M. Koashi and N. Imoto, 'Quantum Cryptography Based on Split Transmission of One-Bit Information in Two Steps,' Phys. Rev. Lett. 79, pp. 2383-2386, 1997. [11] W. Y. Hwang, I. G. Koh, and Y. D. Han, 'Quantum cryptography without public announcement of bases,' Phys. Lett. A, vol. 244, no. 6, pp. 489-494, 1998. [12] A. Cabello, 'Quantum key distribution without alternative measurements,' Phys. Rev. A 61, 052312, 2000. [13] N. Gisin, G. Ribordy, W. Tittel, H. Zbinden, 'Quantum cryptography,' Rev. Mod. Phys. 74, 145, 2002. [14] G. L. Long, X. S. Liu, 'Theoretically efficient high-capacity quantum-key-distribution scheme,' Phys. Rev. A 65, 032302, 2002. [15] F. G. Deng, G. L, Long, 'Controlled order rearrangement encryption for quantum key distribution,' Phys. Rev. A 68, 042315, 2003. [16] F. G. Deng, G. L. Long, 'Bidirectional quantum key distribution protocol with practical faint laser pulses,' Phys, Rev. A 70, 012311, 2004. [17] W. Y. Hwang, 'Quantum Key Distribution with High Loss: Toward Global Secure Communication,' Phys. Rev. Lett. 91 057901, 2003. [18] P. Xue, C. F. Li, and G. C. Guo, 'Conditional efficient multiuser quantum cryptography network,' Phys. Rev. A 65, 022317, 2002. [19] D. Song, 'Secure key distribution by swapping quantum entanglement,' Phys. Rev. A 69, 034301, 2004. [20] P. W. Shor, J. Preskill, 'Simple Proof of Security of the BB84 Quantum Key Distribution Protocol,' Phys. Rev. Lett. 85 pp. 441-444, 2000. [21] A. Beige, B. G. Englert, C. Kurtsiefer and H. Weinfurter, 'Secure Communication with a Publicly Known Key,' Acta. Phys. Pol. A101, pp. 357-368, 2002. [22] K. Boström, T. Felbinger, 'Deterministic Secure Direct Communication Using Entanglement,' Phys. Rev. Lett. 89, 187902, 2002. [23] F. G. Deng, G. L. Long, and X. S. Liu, 'Two-step Quantum Direct Communication Protocol Using the Einstein-Podolsky-Rosen Pair Block,' Phys. Rev. A 68, 04317, 2003. [24] F. G. Deng and G. L. Long, 'Secure Direct Communication with a Quantum One-time Pad,' Phys. Rev. A 69, 052319, 2004. [25] C. Wang, F. G. Deng, Y. S. Li, X. S. Liu, and G. L. Long 'Quantum secure direct communication with high-dimension quantum superdense coding,' Phys. Rev. A 71, 044305, 2005. [26] B. A. Nguyen, 'Quantum dialogue,' Phys. Lett. A 328, pp. 6-10, 2004. [27] M. Lucamarini, S. Mancini, 'Secure Deterministic Communication without Entanglement,' Phys. Rev. Lett. 94, 140501, 2005. [28] Q. Y. Cai and B. W. Li, 'Improving the capacity of the Boström-Felbinger protocol,' Phys. Rev. A 69, 054301, 2004. [29] T. Gao, F. Yan, and Z. Wang, 'Quantum Secure Conditional Direct Communication via EPR Pair,' International Journal of Modern Physics C, vol. 16, no. 8, pp. 1293-1301, 2005. [30] H. Lee, J. Lim, and H. J. Yang, 'Quantum Direct Communication with Authentication,' Phys. Rev. A 73, 042305, 2006 [31] A. D. Zhu, Y. Xia, Q. B. Fan, and S. Zhang, 'Secure Direct Communication Based on Secret Transmitting Order of Particles,' Phys. Rev. A 73, 022338, 2006 [32] X. H. Li, F. G. Deng, and H. Y. Zhou, 'Improving the Security of Secure Direct Communication Based on Secret Transmitting Order of Particles,' Phys. Rev. A 74, 054302, 2006 [33] F. G. Deng, X. H. Li, C. Y. Li, P. Zhou, and H. Y. Zhou, 'Quantum Secure Direct Communication Network with Einstein-Podolsky-Rosen Pairs,' Physics Letters A, vol. 359, no. 5, pp. 359-365, 2006. [34] Z. J. Zhang, J, Liu, D, Wang, and S. H. Shi, 'Comment on “Quantum direct communication with authentication,' Phys. Rev. A 75, 026301, 2007 [35] W. J. Liu and H. W. Chen, 'Efficient Quantum Direct Communication with Authentication,' http://arXive.org/quant-ph/0711.3502, 2007 [36] V. V. Shende, A. K. Prasad, I. L. Markov, and J. P. Hayes, 'Synthesis of Reversible Logic Circuit,' IEEE Trans. on CAD of Integrated Circuits and Systems, pp. 710-722, June, 2003 [37] V. V. Shende, S. S. Bullock, I. L. Markov, 'Synthesis of Quantum Logic Circuits,' IEEE Trans. on Computer-Aided Design, vol. 25, no. 6, pp.1000 - 1010, June 2006. [38] J. Zhang, J. Vala, S. Sastry, K. B. Whaley, 'Optimal quantum circuit synthesis from Controlled-U gates,' Phys. Rev. A 69, 042309 ,2003. [39] I. M. Tsai and S. Y. Kuo, 'Quantum Boolean Circuit Construction and Layout under Locality Constraint', Proc. of the 1st IEEE Conference on Nanotechnology, 2001, pp. 111-116. [40] K. Iwama, Y. Kambayashi, S. Yamashita, 'Transformation Rules for Designing CNOT-based Quantum Circuits,' Proc. of 39th Design Automation Conference, p. 419, 2002. [41] J. S. Lee, Y. Chung, J. Kim, and S. Lee, 'A Practical Method of Constructing Quantum Combinational Logic Circuits', http://arXive.org/quant-ph/9911053, 1999. [42] A. Younes and J. Muller, 'Automated Method for Building CNOT Based Quantum Circuits for Boolean Functions', http://arXive.org/quant-ph/0304099, 2003. [43] D. M. Miller, D. Maslov, G. W. Dueck, 'A Transformation Based Algorithm for Reversible Logic Synthesis,' Proc. of 40th Design Automation Conference, p. 318, 2003. [44] V. V. Shende, S. S. Bullock, I. L. Markov, 'A Practical Top-down Approach to Quantum Circuit Synthesis', Proc. Asia and South Pacific Design Automation Conference, pp. 272-275, Shanghai, China, 2005, quant-ph/0406176. [45] S. S. Bullock and I. L. Markov, 'Smaller Circuits for Arbitrary n-qubit Diagonal Computations', Quantum Information and Computation, vol. 4, no. 1, January 2004, pp. 27-47, quant-ph/0303039. [46] C. Y. Lu, S. A. Wang, I, and S. Y. Kuo, 'Quantum Boolean Circuits Construction Using Tabulation Method', Proc. of the 2004 IEEE Conference on Nanotechnology, August 2004. [47] J. Zhang, J. Vala, S. Sastry, K. B. Whaley, 'Optimal quantum circuit synthesis from controlled-unitary gates,' Phys. Rev. A 69, 042309 2004. [48] S. A. Wang, C. Y. Lu, I. M. Tsai, and S. Y. Kuo, 'Modified Karnaugh Map for Quantum Boolean Circuit Construction,' Proc. of the 2003 IEEE Conference on Nanotechnology, August 2003. [49] I. M. Tsai and S. Y. Kuo, 'An Algorithm for Minimum Space Quantum Boolean Circuits Construction,' Journal of Circuits, Systems, and Computers, Vol. 15, No. 5, pp. 719-738, October 2006. [50] D. Maslov, G. W. Dueck, D.M. Miller, and C. Negrevergne, 'Quantum Circuit Simplification and Level Compaction,' IEEE Transactions on CAD, vol. 27, issue 3, pp. 436-444, March 2008. [51] D. Maslov, C. Young, D. M. Miller, and G. W. Dueck 'Quantum Circuit Simplification Using Templates,' Design, Automation and Test in Europe, vol. 2, pp. 1208-1213, 2005. [52] D. Maslov, G. W. Dueck, D. M. Miller, 'Toffoli Network Synthesis with Templates', IEEE Transactions on CAD, vol. 24, issue 6, pp. 807-817, June 2005. [53] G. F. Viamontes, I. L. Markov and J. P. Hayes, 'Graph-based Simulation of Quantum Computation in the Density Matrix Representation', Quantum Information and Computation, vol.5, no.2 pp. 113-130, February 2005; quant-ph/0403114. [54] G. F. Viamontes, I. L. Markov and J. P. Hayes, 'Improving Gate-Level Simulation of Quantum Circuits', Quantum Information Processing, vol. 2(5), pp. 347-380, October 2003. [55] K. M. Obenland and A. M. Despain, 'A Parallel Quantum Computer Simulatior', quant-ph/9804039, 1998. [56] P. E. Black et al., 'Quantum Compiling and Simulation', http://hissa.nist.gov/~black/Quantum. [57] S. Aaronson and D. Gottesman, 'Improved Simulation of Stabilizer Circuits', Phys. Rev. A 70, 052328 (2004), quant-ph/0406196 [58] D. Gottesman, 'The Heisenberg Representation of Quantum Computers', Proc. of the XXII International Colloquium on Group Theoretical Methods in Physics, pp. 32-43, 1998, quant-ph/9807006. [59] D. M. Miller and M. A. Thornton, 'QMDD: A Decision Diagram Structure for Reversible and Quantum Circuits', Proc. of the 36th Int. Symp. on Multiple-Valued Logic, 2006 [60] D. M. Miller, M. A. Thornton, and D. Goodman, 'A Decision Diagram Package for Reversible and Quantum Circuit Simulation,' Proc. of Congress on Evolutionary Computation, pp. 2428-2435, 2006. [61] D. M. Miller, G. W. Dueck, and D. Maslov, 'A Synthesis Method for MVL Reversible Logic,' Proc. of the 34th Int. Symp. on Multiple-Valued Logic, pp.74-80, 2004. [62] M. Perkowski, A. Al-Rabadi, P. Kerntopf, 'Multiple-Valued Quantum Logic Synthesis,' Proc. of 2002 International Symposium on New Paradigm VLSI, 2002. [63] D. M. Miller, D. Maslov, G. W. Dueck, 'Synthesis of Quantum Multiple-Valued Circuits,' Journal of Multiple-Valued Logic and Soft Computing, 2006. [64] F. S. Khan, M. Perkowski, ' Synthesis of Ternary Quantum Logic Circuits by Decomposition,' Proc. of the 7th International Symposium on Representations and Methodology of Future Computing Technologies, 2005. [65] A. Al-Rabadi, 'Reversible Fast Permutation Transforms for Quantum Circuit Synthesis,' Proc. of the 34th Int. Symp. on Multiple-Valued Logic, pp.81-86, 2004. [66] A. Al-Rabadi, 'Quantum Circuit Synthesis Using Classes of GF(3) Reversible Fast Spectral Transforms,' Proc. of the 34th Int. Symp. on Multiple-Valued Logic, pp.87-93, 2004. [67] M. H. A. Khan and M. Perkowski, 'Genetic Algorithm Based Synthesis of Multi-Output Ternary Functions Using Quantum Cascade of Generalized Ternary Gates,' Proc. of Congress on Evolutionary Computation, pp. 2194- 2201, June 2004. [68] M. H. A. Khan, M. Perkowski, and M. R. Khan, 'Ternary Galois Field Expansions for Reversible Logic and Kronecker Decision Diagrams for Ternary GFSOP Minimization,' Proc. of the 34th Int. Symp. on Multiple-Valued Logic, pp. 58- 67, 2004. [69] M. Nielsen and I. Chuang, Quantum Computation and Quantum Information, Cambridge, U.K., Cambridge Univ. Press, 2000. [70] A. Barenco, C.H. Bennett, R. Cleve, D.P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin and H. Weinfurter, 'Elementary gates for quantum computation,' Phys. Rev. A 52, 3457, 1995. [71] R. Bryant, 'Graph-based Algorithms for Boolean Function Manipulation', IEEE Trans. On Computers, C35, pp. 677-691, Aug 1986. [72] R. I. Bahar er al., 'Algebraic Decision Diagrams and their Applications', Journal of Formal Methods in System Design, 10, no. 2/3, April/May 1997. [73] A. Al-Rabadi, L. Casperson, M. Perkowski, 'Multiple-valued Quantum Logic,' Quantum Computers and Computing, Vol. 3, No. 1, pp.63-91, 2002 [74] D. Maslov, G. Dueck, and N. Scott, 'Reversible Logic Synthesis Benchmarks Page', http://www.cs.uvic.ca/~dmaslov/ [75] F. Somenzi, 'CUDD: CU Decision Diagram Package', ver. 2.3.1, Univ. of Colorado at Boulder, 2001 | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/37818 | - |
dc.description.abstract | 近年來,一些研究已將量子力學應用在通訊領域如量子密鑰傳遞、量子安全直接通訊等。在本論文中,我們提出一個利用EPR量子對的量子安全直接通訊協定。以往的量子安全直接通訊協定為了要傳遞一個量子位元,通常需要消耗一對EPR量子。假如使用者甲想要傳遞一個n位元的訊息給使用者乙,他需要使用至少n/2對EPR量子。且這是當他使用高密度編碼的方式才做得到。在我們所提出的協定中,如果使用者甲、乙和一個可信賴的伺服器事先分享2c+1對EPR量子,在這裡c是一個常數。使用者甲便可以傳遞任意多位元的訊息給使用者乙。而且在傳遞秘密訊息之前,不需要先傳遞EPR量子對。我們的協定可以防止任何竊聽者得知或破壞這個秘密訊息。這個方法可以降低量子通道的使用量以及風險。除此之外,可以透過伺服器驗證使用者的身分以避免任何的冒充者。
量子電路的設計是建造一部量子電腦的基礎。驗證設計好的量子電路是否能執行正確的功能是很重要的。我們提出了一個可以驗證不同量子電路的演算法,而這些量子電路可以是由不同的量子閘所組成的。這個演算法使用一個以二元決策圖(BDD)為基礎的資料結構,這個新的資料結構稱為XQDD(X-分解量子決策圖)。在這個方法中,量子運算可以用圖形的方式表示。藉由比較二個圖形,我們就可以驗證二個量子電路是否具有相同的功能。如果二個量子電路轉換成相同的XQDD,則表示這二個量子電路具有相同的功能。我們也提出了一個可以驗證可逆電路的演算法。即使這些可逆電路含有不同數量的垃圾量子位元,這個演算法也可以用來驗證它們。在大多數的情況下,XQDD所需要的節點數比其他的方法(如QuIDD)來的少。所以這個方法在時間和空間上的使用上都是比較有效率的,甚至可以在多項式時間驗證許多的量子電路。 XQDD可以表示量子運算也可以用來執行矩陣運算,我們用它來驗證量子電路和可逆電路,不論在時間上或空間上都是相當有效率的。所以接下來,我們將XQDD擴充到多值量子邏輯上。我們用XQDD來表示一個多值量子運算及執行矩陣運算。即使多值量子電路或可逆電路是用不同的設計方法設計出來的,XQDD也可以用來檢查這些電路是否執行正確的功能。根據我們的實驗結果也顯示XQDD所需的空間少於其他的表示方法。 | zh_TW |
dc.description.abstract | Quantum mechanics has been applied in the field of communication in the last couple of decades. Quantum Key Distribution (QKD) and Quantum Secure Direction Communication (QSDC) protocols have been presented. In this dissertation, we propose a quantum secure direct communication protocol based on Einstein-Podolsky-Rosen (EPR) pairs. Previous QSDC protocols usually consume one EPR pair to transmit a single qubit. If Alice wants to transmit an n-bit message, she needs at least n/2 EPR pairs when dense coding scheme is used. In our protocol, if both Alice and Bob pre-share 2c+1 EPR pairs with the trusted server where c is a constant, Alice can transmit arbitrary number of qubits to Bob. It is not necessary to transmit EPR pairs before transmitting the secret message. No eavesdropper can steal or change the secret message without being detected. It reduces both the utilization of the quantum channel and the risk. In addition, the server can authenticate the users to avoid any pretender.
Synthesis of quantum circuits is essential for building quantum computers. It is important to verify that the designed circuits perform the correct functions. We propose an algorithm which can be used to verify the quantum circuits consisting of different quantum gates. The proposed data structure is based on BDD (Binary Decision Diagram) and is called X-decomposition Quantum Decision Diagram (XQDD). In this method, quantum operations are modeled using a graphic method and the verification process is based on comparing these graphic diagrams. If the XQDD representations of two quantum circuits are identical, they perform the same function. We also develop an algorithm to verify reversible circuits even if they have a different number of garbage qubits. In most cases, the number of nodes used in XQDD is less than that in other representations such as QuIDD. In general, the proposed method is more efficient in terms of space and time and can be used to verify many quantum circuits in polynomial time. X-decomposition Quantum Decision Diagram (XQDD) can represent a quantum operation and perform matrix operations. It can be used to verify quantum and reversible circuits even if the reversible circuits have different number of garbage qubits. It is efficient in terms of space and time. In this dissertation, we extend the original XQDD to multiple-valued quantum logic. The extended XQDD can represent a multiple-valued quantum operation and perform matrix operations. It can be used to check the equivalence of two multiple-valued quantum or reversible circuits which are synthesized by different approaches. We show that the number of nodes used in multiple-valued XQDD is less than other representations. | en |
dc.description.provenance | Made available in DSpace on 2021-06-13T15:45:25Z (GMT). No. of bitstreams: 1 ntu-97-D90921009-1.pdf: 631651 bytes, checksum: 088569ed47d860f1a9548b790d7975f6 (MD5) Previous issue date: 2008 | en |
dc.description.tableofcontents | Chapter 1 Introduction....................................1
Chapter 2 Notations and Preliminaries.....................7 2-1. Quantum State and Quantum Gate.......................7 2-2. Quantum Measurement and Entanglement................10 2-3. Binary Decision Diagram.............................12 2-4. Multiple-Valued Quantum Logic.......................13 Chapter 3 Quantum Secure Direct Communication with Constant Number of EPR Pairs...................17 3-1. The Scheme for Proposed Protocol....................17 3-1-1. Initialization and Authentication.................17 3-1-2. The Message Transmission Protocol.................21 3-2. Security Analysis...................................26 3-2-1. The Initialization Stage..........................26 3-2-2. The Authentication Stage..........................27 3-2-3. The Message Transmission Stage....................28 Chapter 4 An XQDD-Based Verification Method for Quantum Circuits...............................37 4-1. X-Decomposition Quantum Decision Diagram............37 4-1-1. XQDDs for atrices.................................37 4-1-2. XQDD Operations...................................40 4-2. Quantum Circuit Verification........................43 4-2-1. XQDD Representation of Quantum Circuits...........43 4-2-2. Verifying Circuits with the Same Number of Qubits............................................47 4-2-3. Verifying Circuits with Garbage Qubits............49 4-2-4. Reversible Circuit Verification...................57 4-3. Experimental Results................................60 Chapter 5 An Extended XQDD for Multiple-Valued Quantum Logic..................................67 5-1. Extended XQDD.......................................67 5-1-1. Extended XQDDs for Matrices.......................67 5-1-2. XQDD Operations...................................70 5-2. XQDD-Based Verification Method......................72 5-2-1. Multiple-Valued Quantum Circuit Verification......72 5-2-2. Verifying Circuits with Garbage Qudits............74 5-2-3. Multiple-Valued Reversible Circuit Verification...81 5-3. Experimental Results................................84 Chapter 6 Conclusions....................................89 Bibliography.............................................93 | |
dc.language.iso | en | |
dc.title | 量子安全直接通訊與量子電路驗證 | zh_TW |
dc.title | Quantum Secure Direct Communication and Quantum Circuit Verification | en |
dc.type | Thesis | |
dc.date.schoolyear | 96-2 | |
dc.description.degree | 博士 | |
dc.contributor.oralexamcommittee | 顏嗣鈞,黃彥男,陳俊良,王國禎,蔡一鳴,呂學坤,袁世一 | |
dc.subject.keyword | 量子計算,量子通訊,量子電路, | zh_TW |
dc.subject.keyword | quantum computing,quantum communication,quantum circuit, | en |
dc.relation.page | 98 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2008-07-02 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
顯示於系所單位: | 電機工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-97-1.pdf 目前未授權公開取用 | 616.85 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。