摘要-----------------------------------------------------------------i
誌謝----------------------------------------------------------------ii
目錄 --------------------------------------------------------------iii
圖目錄 --------------------------------------------------------------v
表目錄 ------------------------------------------------------------vii
第一章 緒論----------------------------------------------------------1
1.1 研究動機---------------------------------------------------------1
1.2 研究目的---------------------------------------------------------1
第二章 文獻探討------------------------------------------------------2
第三章 量子電腦是什麼------------------------------------------------4
3.1 古典電腦的最小單位-----------------------------------------------4
3.2 量子電腦的最小單位-----------------------------------------------4
3.3 量子位元疊加態的表示法-------------------------------------------4
3.4 量子位元的測量---------------------------------------------------4
3.5 古典電腦的邏輯閘-------------------------------------------------5
3.6 量子電腦的量子閘-------------------------------------------------5
3.7 單一量子位元閘---------------------------------------------------5
3.8 多量子位元閘-----------------------------------------------------5
3.9 量子閘表示方式---------------------------------------------------5
第四章 量子閘的介紹--------------------------------------------------6
4.1 X量子閘----------------------------------------------------------6
4.2 CNOT量子閘-------------------------------------------------------7
4.3 H量子閘----------------------------------------------------------8
4.4 SWAP量子閘------------------------------------------------------12
4.5 Fredkin量子閘---------------------------------------------------14
4.6 TOFFOLI量子閘---------------------------------------------------17
4.7 Y量子閘---------------------------------------------------------20
4.8 Z量子閘---------------------------------------------------------22
4.9 單位閘(Identity Gate)-------------------------------------------24
4.10 AND閘運算的介紹------------------------------------------------26
4.11 OR閘運算的介紹-------------------------------------------------28
4.12 XOR閘運算的介紹------------------------------------------------30
第五章 量子電路在IBM的實際應用-------------------------------------32
5.1 量子電路在IBM量子電腦上定義介紹與測量--------------------------32
5.2 第一個應用------------------------------------------------------34
5.3 第二個應用------------------------------------------------------35
5.4 第三個應用------------------------------------------------------36
5.5 第四個應用------------------------------------------------------38
5.6 第五個應用------------------------------------------------------41
第六章 結論---------------------------------------------------------43
參考文獻------------------------------------------------------------44

[1] B. Berger and T. Leighton, “Protein folding in the hydrophobic– hydrophilic (HP) model is NP-complete,” J. Comput. Biol., vol. 5, no. 1, pp. 27–40, Jan. 1998.
[2] C. B. Anfinsen, “Principles that govern the folding of protein chains,” Science, vol. 181, no. 4096, pp. 223–230, Jul. 1973.
[3] E. Haber and C. B. Anfinsen, “Side-chain interactions governing the pairing of half-cystine residues in ribonuclease,” J. Biol. Chem., vol. 237, pp. 1839–1844, Jun. 1962.
[4] K. A. Dill, S. B. Ozkan, M. S. Shell, and T. R. Weikl, “The protein folding problem,” Annu. Rev. Biophys., vol. 37, pp. 289–316, Jun. 2008.
[5] C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, “Strengths and weaknesses of quantum computing,” SIAM J. Comput., vol. 26, no. 5, pp. 1510–1523, Oct. 1997.
[6] L. K. Grover, “Quantum computers can search rapidly by using almost any transformation,” Phys. Rev. Lett., vol. 80, no. 19, pp. 4329–4332, May 1998.
[7] L. K. Grover, “Synthesis of quantum superpositions by quantum com-putation,” Phys. Rev. Lett., vol. 85, no. 6, pp. 1334–1337, Aug. 2000.
[8] I. L. Chuang, N. Gershenfeld, and M. Kubinec, “Experimental imple-mentation of fast quantum searching,” Phys. Rev. Lett., vol. 80, no. 15, pp. 3408–3411, Apr. 1998.
[9] I. L. Chuang, L. M. K. Vandersypen, X. Zhou, D. W. Leung, and S. Lloyd, “Experimental realization of a quantum algorithm,” Nature, vol. 393, no. 6681, pp. 143–146, May 1998.
[10] M. O. Scully and M. S. Zubairy, “Quantum optical implementation of Grover’s algorithm,” Proc. Nat. Acad. Sci. USA, vol. 98, no. 17, pp. 9490–9493, 2001.
[11] C. Figgatt, D. Maslov, K. A. Landsman, N. M. Linke, S. Debnath, and C. Monroe, “Complete 3-Qubit Grover search on a programmable quantum computer,” Nature Commun., vol. 8, no. 1, p. 1918, Dec. 2017.
[12] G. Brassard, P. Høyer, and A. Tapp, “Quantum counting,” in Automata, Languages and Programming, K. G. Larsen, S. Skyum, and G. Winskel, Eds. Berlin, Germany: Springer, 1998, pp. 820–831.
[13] J. A. Jones and M. Mosca, “Approximate quantum counting on an NMR ensemble quantum computer,” Phys. Rev. Lett., vol. 83, no. 5, pp. 1050–1053, Aug. 1999.
[14] W.-L. Chang, Q. Yu, Z. Li, J. Chen, X. Peng, and M. Feng, “Quantum speedup in solving the maximal-clique problem,” Phys. Rev. A, Gen. Phys., vol. 97, no. 3, Mar. 2018, Art. no. 032344.
[15] G. L. Long, “Grover algorithm with zero theoretical failure rate,” Phys. Rev. A, Gen. Phys., vol. 64, no. 2, Jul. 2001, Art. no. 022307.
[16] G. Long and Y. Liu, “Search an unsorted database with quantum mechanics,” Frontiers Comput. Sci. China, vol. 1, no. 3, pp. 247–271, Jul. 2007.
[17] L. K. Grover and J. Radhakrishnan, “Is partial quantum search of a database any easier?” in Proc. 17th Annu. ACM Symp. Parallelism Algorithms Archit. (SPAA), 2005, pp. 186–194.
[18] F. M. Toyama, W. van Dijk, and Y. Nogami, “Quantum search with certainty based on modified Grover algorithms: Optimum choice of parameters,” Quantum Inf. Process., vol. 12, no. 5, pp. 1897–1914, May 2013.
[19] G. Castagnoli, “Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics,” Found. Phys., vol. 46, no. 3, pp. 360–381, Mar. 2016.
[20] Y. Liu and F. H. Zhang, “First experimental demonstration of an exact quantum search algorithm in nuclear magnetic resonance system,” Sci. China Phys. Mech. Astron., vol. 58, no. 7, 2015, Art. no. 070301.
[21] P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM J. Comput., vol. 26, no. 5, pp. 1484–1509, Oct. 1997.
[22] B. P. Lanyon et al., “Experimental demonstration of a compiled version of Shor’s algorithm with quantum entanglement,” Phys. Rev. Lett., vol. 99, no. 25, Dec. 2007, Art. no. 250505.
[23] T. Monz et al., “Realization of a scalable Shor algorithm,” Science, vol. 351, no. 6277, pp. 1068–1070, Mar. 2016.
[24] F. Arute et al., “Quantum supremacy using a programmable supercon-ducting processor,” Nature, vol. 574, no. 7779, pp. 505–510, 2019.
[25] T. P. Xiong et al., “Experimental verification of a Jarzynski-related information-theoretic equality using a single trapped ion,” Phys. Rev. Lett., vol. 121, no. 8, Aug. 2018, Art. no. 010601.
[26] 布洛赫球面https://zh.wikipedia.org/wiki/%E5%B8%83%E6%B4%9B%E8%B5%AB%E7%90%83%E9%9D%A2
https://journals.aps.org/pr/abstract/10.1103/PhysRev.70.460
[27] Nielsen and Chuang 2000; Imre and Balazs 2007; Lipton and Regan 2014，Quantum Computation and Quantum Information
http://mmrc.amss.cas.cn/tlb/201702/W020170224608149940643.pdf
[28] R. P. Feynman，「Quantum mechanical computers」，Optics News，February
1985，11，p. 11; reprinted in Foundations of Physics 16(6) 507–531
[29] 量子電腦與量子計算 IBM Q Experience 實作，張元翔著，2020.06
[30] Weng-Long Chang,Renata Wong "Quantum Speedup for Protein Structure Prediction." It was accepted and being published by IEEE Transaction on NanoBioScience, March 2021.