Quantum Computing (量子計算) 2025

Lecturer: 江振瑞
Teaching Assistants (TAs): 黃文翰林橋毅
Time: 週二 14:00~16:50
Place: 週二工五館 E6-A210
EEClass: (CE5082)

Goal: Leading students to understand the basic principles of quantum computing and the developments and the applications of the latest quantum computing technologies. (帶領學生了解量子計算基本原理及最新量子計算技術之發展與應用)

Scoring：

midterm project (programming) (30%)
oral report in class (25%)
term project (programming) (30%)
homework, reports and in-class participation (15%)

Textbooks:

江振瑞, 輕鬆學量子程式設計 -- 從量子位元到量子演算法, 碁峰資訊, ISBN: 9786263242715, 2022/08.

Reference Books:

張元翔, 量子電腦與量子計算, 碁峰資訊, 2020.
陳建宏(譯), 量子計算實戰, 碁峰資訊, 2020.
莊永裕(譯), 圖解量子電腦入門, 臉譜, 2020.
林志鴻, 張仁瑀, 徐育兆, 林橋毅, 劉子睿, 林侑恆, 量子電腦應用與世界級競賽實務, 2021.
Jack D. Hidary, Quantum Computing: An Applied Approach (2nd Ed), 2021.
Chris Bernhardt, Quantum Computing for Everyone, 2020.
Nihal Mehta, Quantum Computing -- Program Next-Gen Computers for Hard, Real-World Applications, 2020.
Michael A. Nielsen, and Isaac L. Chuang, Quantum Computation and Quantum Information, 2002.

Syllabus: (2025-Quantum-Computing.pdf)

(9/2) Week 1. Introduction to Quantum Computing -- From quantum bit to quantum algorithm (qc-talk.pptx)
(9/9) Week 2. Quantum programming for the first time (Introduction to IBM Q quantum computer and D-Wave quantum computer) (QBookCh1.zip)
Homework1:
Textbook Exercises (Select one from 1.1-1.3)(and 1.4)(and 1.5 Bonus) (deadline: by noon before next class)
(9/16) Week 3. QUBO建模、PyQUBO程式設計與量子位元疊加態程式設計(2025-0916-PyQUBO.zip) (QBookCh2.zip)(Quantum_Course_Slides(Week3).zip)
Homework 2: (A) Max-Cut Prob. PyQUBO programming for the G22 dataset and (B) Ex2.1 to Ex.2.5.
Deadline: 9/22 23:59
(9/23) Week 4. Quantum-inspired Annealers (2025-GPUA.zip), metaheuristic algorithms (metaheuristics.pptx) as well as Quantum Gates, Quantum Entanglement and Quantum Teleportation (QBookCh3.zip)(QBookCh4.zip)(qexp.pptx)
Homework 3: (A) Write a report to introduce ES, SA, DE, TCA, VNS, TS, or GSA (bonus: with an example using a program to solve an NP-hard problem). (TA will announce the problem assignment soon.) (B) Ex4.1 to Ex4.5. Deadline: 9/29 23:59
(9/30) Week 5. Paper Oral Reports (1/3)
(1) Introduction to Fujitsu Digital Annealer with Examples. (Fujitsu_DA_Constraints.docx)(TA: 林橋毅)
(2) de Queiroz, T. A., Iori, M., Locatelli, A., & Parizy, M. (2025, July).
Solving the Cubic Knapsack Problem using the Quantum-Inspired Digital Annealer Technology. In Proceedings of the Genetic and Evolutionary Computation Conference (pp. 890-897).
(3) Codognet, P., Diaz, D., & Abreu, S. (2022, July). Quantum and digital annealing for the quadratic assignment problem. In 2022 IEEE International Conference on Quantum Software (QSW) (pp. 1-8). IEEE.
(10/7) Week 6. Paper Oral Reports (2/3)
(4) Jehn-Ruey Jiang, and Chun-Wei Chu, "Classifying and Benchmarking Quantum Annealing Algorithms Based on Quadratic Unconstrained Binary Optimization for Solving NP-hard Problems," IEEE Access, vol. 11, pp. 104165-104178, 2023.
Jehn-Ruey Jiang, Yu-Chen Shu, and Qiao-Yi Lin, "Benchmarks and Recommendations for Quantum, Digital, and GPU Annealers in Combinatorial Optimization," IEEE Access, vol. 12, pp. 125014-125031, 2024.
(5) Zeng, Q. G., Cui, X. P., Liu, B., Wang, Y., Mosharev, P., & Yung, M. H. (2024). Performance of quantum annealing inspired algorithms for combinatorial optimization problems. Communications Physics, 7(1), 249.
(6) Lee, H., & Jun, K. (2025). Range dependent Hamiltonian algorithms for numerical QUBO formulation. Scientific Reports, 15(1), 8819.
(10/14) Week 7. Paper Oral Reports (3/3)
(7) Nakano, K., Takafuji, D., Ito, Y., Yazane, T., Yano, J., Ozaki, S., ... & Mori, R. (2023, May). Diverse adaptive bulk search: a framework for solving QUBO problems on multiple GPUs. In 2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (pp. 314-325). IEEE.
(8) Andreou, A., Mavromoustakis, C. X., Markakis, E., Bourdena, A., & Mastorakis, G. (2025). Sustainable AI With Quantum-Inspired Optimization: Enabling End-to-End Automation in Cloud-Edge Computing. IEEE Access.
(9) Kaseb, Z., Moller, M., Vergara, P. P., & Palensky, P. (2024). Power flow analysis using quantum and digital annealers: a discrete combinatorial optimization approach. Scientific Reports, 14(1), 23216.

(10/20) Week 8. Midterm Project
Using QUBO solver to solve one of the following problems: maximum cut, vertex cover, 0/1 knapsack, graph coloring, Hamiltonian cycle, traveling salesperson, and job-shop scheduling problems. (TA will announce the problem assignment and prepare the dataset download.)

===VVV===The contents below are not up-to-date. ===VVV===
(9/28-10/11) (16+2彈性教學) + PBL (Problem-Based Learning, or Project-Based Learning): Distributed Quantum Computing System (DQCS), and Quantum Annealing Algorithm (QA)

* Dirac Notation
* Bloch Sphere
* H, X, CNOT Gates
* Quantum Entanglement (EPR pair)
* Quantum Teleportation
Homework 2: Select two out of Ex2.1,...,Ex2.5. Deadline: 10/4 noon
4. (10/4) (16+2彈性學習)(No Class)(學生自行研讀以下議題或論文，並於10/11分組報告)
#1. Topic: Quantum Key Distribution (QKD) : BB84 (Proposed by Bennett and Brassard in 1984)
#2. Topic: Quantum Key Distribution (QKD) with entanglement: E91 (Proposed by Ekert in 1991) with comparisons with BB84
#3. Topic: Quantum Key Distribution (QKD) : B92 (Proposed by Bennett in 1992) with comparisons with BB84 and E91
#4. Paper: Burr, J., Parakh, A., & Subramaniam, M. (2022). Quantum internet. Ubiquity, 2022 (August), 1-14.
#5. Paper: Caleffi, M., Cacciapuoti, A. S., & Bianchi, G. (2018, September). Quantum Internet: From communication to distributed computing!. In Proceedings of the 5th ACM International Conference on Nanoscale Computing and Communication (pp. 1-4).
#6. paper: Cuomo, D., Caleffi, M., & Cacciapuoti, A. S. (2020). Towards a distributed quantum computing ecosystem. IET Quantum Communication, 1(1), 3-8.
#7. Paper: Loke, S. W. (2022). From Distributed Quantum Computing to Quantum Internet Computing: an Overview. arXiv preprint arXiv:2208.10127.
#8. Paper: Loke, S. W. (2022). The Rise of Quantum Internet Computing. arXiv preprint arXiv:2208.00733.
#9. Topic: Quantum Tuneling + Ising Model + Quadratic Unconstrained Binary Optimization (QUBO) model + One example of QUBO to solve an NP-hard problem (For CSIE Undergraduate Project)
5. (10/11) 二人一組，分組報告，每組報告12分+3分鐘Q&A (投影片請在10/11中午前依照助教指定方式上傳完畢)
6. (10/18) Quantum Annealing + Single-bit Quantum Gates, Unitary Matrices, and Quantum Circuits
Paper: Solving NP-hard Problems with Quantum Annealing, presented at IEEE ECICE 2022(勘誤加分)(Slides)(QBookCh3.zip)
Homework 3: Select two out of Ex3.1,..., Ex3.5. Deadline: 10/25 noon
7. (10/25) Multi-bit Quantum gates, Phase Kickback, and Grover Algorithm
Paper: Quantum Circuit Based on Grover Algorithm to Solve Hamiltonian Cycle Problem, presented at IEEE ECICE 2022(勘誤加分)(Slides)(QBookCh4.zip)
(QBookCh6.zip) Homework 4: Select one out of Ex4.1,..., Ex4.5, and one out of Ex6.1,..., Ex6.5. Deadline: 11/8 noon
8. (11/1) No Class (for preparing midterm project)
Midterm Project: (Due: ~~11/11 noon~~ 11/15 noon)
Option 1: Write a quantum program based on Grover algorithm to find the ~~maximum,~~ minimum~~, mean, or median~~ of a given set of unstructured data. You should hand in an electronic-version report describing your method, your circuit, your program, and the results of running your program (circuit). (Let the number of index qubits be 3 or 4)
(Reference: Quantum Minimum Searching Algorithm and Circuit Implementation)(Paper and Slides)

Option 2: Write a quantum program based on Grover algorithm to find the number of solutions to the Hamiltonian cycle problem for 4-clique. You should hand in an electronic-version report describing your method, your circuit, your program, and the results of running your program (circuit).
(Reference: https://qiskit.org/textbook/ch-algorithms/quantum-counting.html)
9. (11/8) Paper: 使用量子線路模擬量子網際網路核心機制, 2022 臺灣網際網路研討會(TANET 2022, 12/15-17)論文 (Slides)
10. (11/15) Quantum Fourier Transform (QFT), Inverse Quantum Fourier Transform (IQFT), and Quantum Phase Estimation (QPE) (FFT.zip)
(QBookCh7.zip), and Quantum Counting (QCount.zip)
Homework 5: Select two out of Ex7.1, Ex7.2, and Ex7.3. Deadline: 11/22 noon
練習 7.1
設計量子程式將 5 個量子位元初始狀態設定為 '11011'，先以布洛赫球面顯示量子位元狀態，然後加入量子傅立葉變換線路後，再以布洛赫球面顯示量子位元經過量子傅立葉變換之後的狀態，最後再加入逆量子傅立葉變換線路，而且同樣以布洛赫球面顯示量子位元狀態。在程式的最後必須顯示整體量子線路，程式可以直接呼叫本章提供的 qft 及 iqft 函數建構量子傅立葉變換線路及逆量子傅立葉變換線路，並且以量子閘的形式加入量子線路中。請注意，程式無須加入定義 qft 及 iqft函數的細節，但是在呼叫這 2 個函數之前要先執行定義這 2 個函數的程式。
練習 7.2
設計量子程式透過量子相位估測，以 3 個計數位元的測量結果推導出么正變換T閘本徵值對應的相位。程式必須顯示整體量子線路，計數位元的測量結果直方圖，以及由測量結果推導出的相位。程式可以直接呼叫本章提供的 iqft 函數建構逆量子傅立葉變換線路，並且以量子閘的形式加入量子線路中。請注意，程式無須加入定義 iqft 函數的細節，但是在呼叫 iqft 函數之前要先執行定義 iqft 函數的程式。
練習 7.3
設計量子程式透過量子相位估測，以 6 個計數位元的測量結果推導出帶 𝜋/3 參數么正變換 P 閘本徵值對應的相位。程式只需要顯示計數位元的測量結果直方圖，以及由測量結果推導出的相位。程式可以直接呼叫本章提供的 iqft 函數建構逆量子傅立葉變換線路，並且以量子閘的形式加入量子線路中。請注意，程式無須加入定義 iqft 函數的細節，但是在呼叫 iqft 函數之前要先執行定義 iqft 函數的程式。
11. (11/22) RAS algorithm (RSA.zip), and Shor’s algorithm (QBookCh7.zip)
Homework 6: Select one out of Ex5.1, Ex5.2, and Ex5.3, and one out of Ex7.4 and Ex7.5. Deadline: 11/29 noon
練習 7.4
設計量子程式建構使用 2 個量子計數位元，對應 𝑓(𝑥) = 11^𝑥 (mod 15) 的量子相位估測線路，並使用量子電腦模擬器執行量子線路，獲得量子計數位元的測量結果，以求出𝑓(𝑥)的週期。程式可以直接呼叫本章提供的 qc_mod15 及 iqft 函數建構量子模冪線路及逆量子傅立葉變換線路，並且以量子閘的形式加入量子線路中。程式的最後必須顯示整體量子線路，並顯示量子計數位元的測量結果以及根據測量結果得到的週期估測值。請注意，程式無須加入定義 qc_mod15 及 idft 函數的細節，但是在呼叫這 2 個函數之前要先執行定義這 2 個函數的程式。
練習 7.5
設計量子程式建構使用 4 個量子計數位元，對應 𝑓(𝑥) = 7^𝑥 (mod 15) 的量子相位估測線路，並使用量子電腦模擬器執行量子線路，獲得量子計數位元的測量結果，以求出𝑓(𝑥)的週期。程式可以直接呼叫本章提供的 qc_mod15 及 iqft 函數建構量子模冪線路及逆量子傅立葉變換線路，並且以量子閘的形式加入量子線路中。程式的最後必須顯示整體量子線路，並顯示量子計數位元的測量結果以及根據測量結果得到的週期估測值。請注意，程式無須加入定義 qc_mod15 及 idft 函數的細節，但是在呼叫這 2 個函數之前要先執行定義這 2 個函數的程式。
12. (11/29) Quantum Teleportation (QTeleport.pptx)
Machine Learning/Deep Learning and Their Applications (ML4QC(2022-1128).pptx)(DL4QC(2022-1128).pptx)
Papers:
(1). Industrial Control System Anomaly Detection and Classification Based on Network Traffic, IEEE Access, 2022. (Slides)
(2). Deep Learning Anomaly Classification Using Multi-Attention Residual Blocks for Industrial Control Systems, Sensors, 2022. (Slides)
Homework 7: Derive the general quantum state equation of the following Bell-state quantum circuit and validate your equation with the histogram. Deadline: 12/6 noon
13, 14, 15. (12/6, 12/13, 12/20) Second Oral Report (Upload Slides by noon before the class starts)
Paper: Jehn-Ruey Jiang, “Quantum Entanglement with Self-stabilizing Token Ring for Fault-tolerant Distributed Quantum Computing System,” accepted to present at the 26th Conference on Quantum Information Processing (QIP 2023), Ghent, Belgium, February 4-10, 2023. (https://arxiv.org/abs/2209.11361)(Slides)
#1 Quantum Fourier Convolutional Network
#2 Entanglement in Phase Estimation Algorithm and Quantum Counting Algorithm
#3 Distributed Quantum Machine Learning
#4 Quantum Phase Estimation Based Algorithms for Machine Learning
#5 Machine Learning in the Quantum Realm: The State-of-the-art, Challenges, and Future Vision
#6 A Review of Various Quantum Routing Protocols Designed for Quantum Network Environment
#7 DQRA: Deep Quantum Routing Agent for Entanglement Routing in Quantum Networks
#8 Order Matters: On the Impact of Swapping Order on an Entanglement Path in a Quantum Network
(2nd-Oral-Papers.zip)
16. (12/27) Deutsch-Jozsa (DJ) algorithm (QBookCh5.zip) and Term Project Announcement (Slides)
Term Project Problem: Designing quantum circuits for calculating the Hamming distance of 2-qubit Boolean functions f(x) and g(x) for the cases of the distance = 2, 3, and 4 (33% per case).
Related Paper: Zidan, M., Eldin, M. G., Shams, M. Y., Tolan, M., Abd-Elhamed, A., & Abdel-Aty, M. (2022). A Quantum Algorithm for Evaluating the Hamming Distance. CMC-COMPUTERS MATERIALS & CONTINUA, 71(1), 1065-1078.
17. (1/3) No Class (For you to prepare for the Final Project)

Term Project (30%) Due Day: 2023/01/10 13:00
依照助教公告方式繳交程式及報告，詳細說明term project完成的過程及程式的實作細節。