請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/104811完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 黃鐘揚 | zh_TW |
| dc.contributor.advisor | Chung-Yang Ric Huang | en |
| dc.contributor.author | 陳冠維 | zh_TW |
| dc.contributor.author | Kuan-Wei Chen | en |
| dc.date.accessioned | 2026-09-02T16:20:50Z | - |
| dc.date.available | 2026-09-03 | - |
| dc.date.copyright | 2026-09-02 | - |
| dc.date.issued | 2026 | - |
| dc.date.submitted | 2026-08-11 11:50:39 | - |
| dc.identifier.citation | [1] S. Aaronson and D. Gottesman. Improved simulation of stabilizer circuits. Physical Review A, 70(5):052328, 2004.
[2] S. B. Bravyi and A. Y. Kitaev. Fermionic quantum computation. Annals of Physics, 298(1):210–226, 2002. [3] R. B. Cattell. The scree test for the number of factors. Multivariate Behavioral Research, 1(2):245–276, 1966. [4] C.-Y. Cheng. Improving double-qubit-gate extraction in ZX-diagram-based quantum circuit optimization. Master’s thesis, National Taiwan University, 2024. [5] A. M. Childs and Y. Su. Nearly optimal lattice simulation by product formulas. Physical Review Letters, 123(5):050503, 2019. [6] A. M. Childs, Y. Su, M. C. Tran, N. Wiebe, and S. Zhu. A theory of Trotter error. Physical Review X, 11(1):011020, 2021. [7] O. Cole. Quantum circuit optimisation through stabiliser reduction of pauli exponentials. MSc thesis, University of Oxford, 2022. [8] C. Eckart and G. Young. The approximation of one matrix by another of lower rank. Psychometrika, 1(3):211–218, 1936. [9] A. Gilchrist, N. K. Langford, and M. A. Nielsen. Distance measures to compare real and ideal quantum processes. Physical Review A, 71(6):062310, 2005. [10] D. Gottesman. The Heisenberg representation of quantum computers. In S. P. Corney, R. Delbourgo, and P. D. Jarvis, editors, Group22: Proceedings of the XXII International Colloquium on Group Theoretical Methods in Physics, pages 32–43, Cambridge, MA, 1999. International Press. Long version: arXiv:quant-ph/9807006. [11] H. Hotelling. Analysis of a complex of statistical variables into principal components. Journal of Educational Psychology, 24(6):417–441, 1933. [12] I. T. Jolliffe. Principal Component Analysis. Springer, New York, 2 edition, 2002. [13] P. Jordan and E. Wigner. Paulische äquivalenzverbot. Zeitschrift für Physik, 47(9–10):631–651, 1928. [14] M.-T. Lau, C.-Y. Cheng, C.-H. Lu, C.-H. Chuang, Y.-H. Kuo, H.-C. Yang, C.-T. Kuo, H.-Y. Chen, C.-Y. Tung, C.-E. Tsai, G.-H. Chen, L.-K. Lin, C.-H. Wang, T.-H. Wang, and C.-Y. R. Huang. Qsyn: A developer-friendly quantum circuit synthesis framework for NISQ era and beyond. In IEEE International Conference on Quantum Computing and Engineering (QCE), 2024. [15] Y. Li, X. Tang, P. Hovland, and J. Liu. Non-Clifford fusion: T-gate optimization for quantum simulation, 2025. [16] C.-H. Lu. Dynamic quantum circuit optimization by ZX-calculus using Qsyn. Master’s thesis, National Taiwan University, 7 2023. [17] M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, UK, 10th anniversary edition, 2010. [18] K. Pearson. On lines and planes of closest fit to systems of points in space. Philosophical Magazine, 2(11):559–572, 1901. [19] N. J. Ross and P. Selinger. Optimal ancilla-free Clifford+T approximation of zrotations. Quantum Information and Computation, 16(11-12):901–953, 2016. [20] J. T. Seeley, M. J. Richard, and P. J. Love. The Bravyi-Kitaev transformation for quantum computation of electronic structure. The Journal of Chemical Physics, 137(22):224109, 2012. [21] M. Suzuki. General theory of fractal path integrals with applications to many-body theories and statistical physics. Journal of Mathematical Physics, 32(2):400–407, 1991. [22] J. D. Whitfield, J. Biamonte, and A. Aspuru-Guzik. Simulation of electronic structure Hamiltonians using quantum computers. Molecular Physics, 109(5):735–750, 2011. | - |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/104811 | - |
| dc.description.abstract | 哈密頓量(Hamiltonian)電路合成對量子模擬至關重要。由於在容錯編譯中 T 閘成本高昂,於目標保真度下合成模擬電路自然成為近似合成(approximate synthesis)問題:經 Gridsynth 後,Pauli 旋轉數量大致決定 T 閘數量。本論文研究可擴展(scalable)的近似哈密頓量電路合成,在目標保真度 F_approx 約束下,最小化 non-Clifford Pauli 旋轉閘數量。本方法於 Qsyn 的 Continuous Phase Folding(CPF)流程中,在 Pauli-list 層級運作,結合主成分分析(PCA)啟發之縮減策略,並於化學與晶格基準進行系統性評估。
我們提出係數層級的保真度代理指標(fidelity surrogate),以及統一的 Pauli-list 近似架構,整合截斷(truncation)、前 k 項選取、預算約束(budget constraints)、結構合併(structure merge)、Clifford 吸收與混合縮減,並可在 O(#Pauli) 時間內完成。我們進一步提出 zero-sweep 貪婪啟發式方法,無需窮舉參數掃描(parameter sweeps),即可在目標保真度下獲得較低的 Pauli 旋轉數量。在 F_approx ≥ 0.99 下,以 LiH、H2O 與 N2 對照 Non-Clifford Fusion(NCF)單量子位元基準,本流程可將 Pauli 旋轉數量最多減少 99.7%(分子基準平均約 99%)。經後續 Qsyn 量子電路最佳化(QCO)後,T 閘數量與 Clifford 閘數量最多分別減少 90.7%(平均 82%)與 98.6%(平均 98%)。本流程實作於 Qsyn,並於 13 組 NCF 基準驗證,涵蓋分子與自旋晶格,規模達 60 量子位元。分子電路可大幅壓縮;相對地,均勻 Ising 與 Heisenberg 晶格需採較低目標保真度,始能達到相近的縮減效果。本研究使保真度感知(fidelity-aware)的哈密頓量合成得以在 Pauli-list 層級進行,並銜接量子模擬前端工作負載與高效的 Clifford+T 編譯後端。 | zh_TW |
| dc.description.abstract | Hamiltonian circuit synthesis is vital for quantum simulation. Because T gates are expensive in fault-tolerant compilation, synthesizing simulation circuits under a target fidelity naturally becomes an approximate synthesis problem: after Gridsynth, the number of Pauli rotations largely determines T-count. This thesis studies scalable approximate Hamiltonian circuit synthesis that minimizes non-Clifford Pauli rotations under a target compress fidelity F_approx. Our approach operates at the Pauli-list level within Qsyn's Continuous Phase Folding (CPF) flow, combining principal component analysis (PCA)-inspired reduction with systematic evaluation on chemistry and lattice benchmarks.
We develop a coefficient-level fidelity surrogate and a unified Pauli-list approximation framework that integrates truncation, top-$k$ selection, budget constraints, structure merge, Clifford absorption, and hybrid reduction in O(#Pauli) time. We further introduce a zero-sweep greedy heuristic that attains low rotation counts at target fidelities without exhaustive parameter sweeps. At F_approx ≥ 0.99, on LiH, H2O, and N2 against Non-Clifford Fusion (NCF) single-qubit baselines, our flow reduces Pauli rotations by up to 99.7% (avg. 99% over molecular benchmarks). After subsequent Qsyn quantum circuit optimization (QCO), T-count and Clifford count decrease by up to 90.7% (avg. 82%) and 98.6% (avg. 98%), respectively. Implemented in Qsyn, the flow is validated on 13 NCF benchmarks spanning molecules and spin lattices up to 60 qubits. Molecular circuits compress strongly, whereas uniform Ising and Heisenberg lattices require lower target fidelities to achieve comparable reduction. This work enables fidelity-aware Hamiltonian synthesis at the Pauli-list level, linking quantum simulation front-end workloads to efficient Clifford+T compilation back-ends. | en |
| dc.description.provenance | Submitted by admin ntu (admin@lib.ntu.edu.tw) on 2026-09-02T16:20:50Z No. of bitstreams: 0 | en |
| dc.description.provenance | Made available in DSpace on 2026-09-02T16:20:50Z (GMT). No. of bitstreams: 0 | en |
| dc.description.tableofcontents | Acknowledgements i
摘要 iii Abstract v Contents vii List of Figures xiii List of Tables xiv Denotation xvi Chapter 1 Introduction 1 1.1 Background and Motivation 1 1.2 Related Work 3 1.3 Thesis Contributions 5 1.4 Thesis Organization 7 Chapter 2 Preliminaries 8 2.1 Quantum Circuit Synthesis 8 2.1.1 Quantum Circuits 8 2.1.2 Pauli Operators and Pauli Rotations 9 2.1.3 Approximate Rz Synthesis 10 2.1.4 Tableau Representation 11 2.2 Hamiltonian Simulation 12 2.2.1 Time-Evolution Operator 12 2.2.2 Fermion–Qubit Mappings 13 2.2.3 Product Formula 14 2.2.4 Suzuki–Trotter Decomposition 15 2.3 Principal Component Analysis 16 2.3.1 Data Variance and Principal Components 17 2.3.2 Rank-k Truncation and Scree Plots 17 2.4 Process Fidelity 19 2.4.1 Definition and Approximation Error 19 2.4.2 Coefficient-Level Surrogate 20 Chapter 3 Proposed Synthesis Flow 22 3.1 Overview 22 3.2 Continuous Phase Folding in Qsyn 24 3.2.1 Tableau-Based Phase Folding 24 3.2.2 Pauli DAG Folding 25 3.3 Pauli-List Representation 27 3.4 Approximate Compression Stage 28 3.5 Clifford+T Synthesis Stage 30 3.6 Chapter Summary 32 Chapter 4 Pauli Compression 33 4.1 PCA-Inspired Coefficient-Energy Analogy 33 4.2 Problem Formulation 35 4.3 Compression Methods 38 4.3.1 Truncation (Method A) 39 4.3.2 Top-k Selection (Method B) 40 4.3.3 Budget Constraints (Method C) 40 4.3.4 Structure Merge (Method D) 41 4.3.5 Near-Clifford Absorption (Method E) 42 4.3.6 Hybrid Reduction (HYBRID) 44 4.4 Zero-Sweep Greedy Heuristic 45 4.5 Chapter Summary 48 Chapter 5 Qsyn Implementations 50 5.1 Integration with Qsyn 50 5.1.1 Continuous Phase Folding entry points 51 5.1.2 Pauli-list exchange format 51 5.1.3 Where compression sits in the host pipeline 52 5.2 Interfaces to Gridsynth and NCF Baselines 53 5.2.1 Gridsynth and Qsyn QCO 53 5.2.2 NCF benchmark loading 54 5.2.3 NCF baseline compilation adapters 55 5.3 Chapter Summary 57 Chapter 6 Experimental Results 58 6.1 Experimental Setup 58 6.1.1 Software stack and host environment 59 6.1.2 Benchmarks and Trotterization 59 6.1.3 Default CPF and compression schedule 60 6.1.4 Clifford+T back-end para 60 6.1.5 Fidelity tiers and operating-point selection 61 6.1.6 Ablation and comparison axes 61 6.1.7 Reproducibility notes 62 6.2 Benchmarks and Evaluation Metrics 62 6.2.1 Benchmarks 63 6.2.2 Evaluation metr 64 6.3 Compression and Fidelity Trade-offs 65 6.3.1 Trade-off shape 65 6.3.2 High-fidelity regime (F⋆ = 0.99) 66 6.3.3 Relaxing the fidelity target 67 6.3.4 Implications for the synthesis flow 68 6.4 Ablation of Pipeline Stages 68 6.4.1 With/Without Pauli Compression 69 6.4.2 With/Without Phase Folding 70 6.4.3 With/Without Qsyn QCO 71 6.5 Comparison with NCF Baselines 72 6.5.1 Discussion of the comparison 75 6.6 Effect of Fermion–Qubit Mappings 75 6.6.1 Mapping experiment setup 76 6.6.2 Energy concentration before and after CPF 76 6.6.3 Compression under matched fidelity tiers 79 6.6.4 Post-synthesis cost by mapping 80 6.6.5 Discussion of mapping effects 81 6.7 Ablation of Compression Methods and the Zero-Sweep Heuristic 82 6.7.1 Method families under review 82 6.7.2 Which methods win the fidelity tiers? 83 6.7.3 Zero-sweep heuristic versus the parameter sweep 84 6.7.4 Discussion of method and heuristic ablations 86 6.8 Chapter Summary 86 Chapter 7 Conclusion and Future Work 88 7.1 Conclusions 88 7.2 Future Work 90 References 93 Appendix A — Derivation of the Compress-Fidelity Surrogate 96 A.1 Setup and process fidelity 96 A.2 Residual product and the intermediate surrogate 97 A.3 Euler expansion and the closed form 98 A.4 Working surrogate used in the thesis 102 A.5 Summary of the logical chain 102 Appendix B — Zero-Sweep Fidelity Budget as a Unit-Profit Knapsack 103 B.1 Objective and fidelity constraint 103 B.2 Logarithm transforms the product into a sum 104 B.3 Cost and budget 104 B.4 Unit-profit knapsack and the greedy rule 105 B.5 Summary 105 | - |
| dc.language.iso | en | - |
| dc.subject | 量子近似合成 | - |
| dc.subject | 哈密頓量模擬 | - |
| dc.subject | 目標保真度 | - |
| dc.subject | 包立旋轉 | - |
| dc.subject | 壓縮 | - |
| dc.subject | Quantum Approximate Synthesis | - |
| dc.subject | Hamiltonian Simulation | - |
| dc.subject | Target Fidelity | - |
| dc.subject | Pauli Rotations | - |
| dc.subject | Compression | - |
| dc.title | 基於主成分分析啟發之可擴展包立旋轉最小化演算法實現目標保真度之近似哈密頓量電路合成 | zh_TW |
| dc.title | A PCA-Inspired Scalable Pauli Rotation Minimization Algorithm for Approximate Hamiltonian Circuit Synthesis with Target Fidelity | en |
| dc.type | Thesis | - |
| dc.date.schoolyear | 114-2 | - |
| dc.description.degree | 碩士 | - |
| dc.contributor.oralexamcommittee | 江介宏;陳郁方;邱大維 | zh_TW |
| dc.contributor.oralexamcommittee | Jie-Hong Roland Jiang;Yu-Fang Chen;Dah-Wei Chiou | en |
| dc.subject.keyword | 量子近似合成; 哈密頓量模擬; 目標保真度; 包立旋轉; 壓縮 | zh_TW |
| dc.subject.keyword | Quantum Approximate Synthesis; Hamiltonian Simulation; Target Fidelity; Pauli Rotations; Compression | en |
| dc.relation.page | 106 | - |
| dc.identifier.doi | 10.6342/NTU202604134 | - |
| dc.rights.note | 同意授權(限校園內公開) | - |
| dc.date.accepted | 2026-08-13 | - |
| dc.contributor.author-college | 重點科技研究學院 | - |
| dc.contributor.author-dept | 積體電路設計與自動化學位學程 | - |
| dc.date.embargo-lift | 2027-07-21 | - |
| 顯示於系所單位: | 積體電路設計與自動化學位學程 | |
文件中的檔案:
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-114-2.pdf 未授權公開取用 | 1.29 MB | Adobe PDF | 檢視/開啟 |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。
