請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/103744完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 洪士涵 | zh_TW |
| dc.contributor.advisor | Shih-Han Hung | en |
| dc.contributor.author | 蔡名峴 | zh_TW |
| dc.contributor.author | Ming-Hsien Tsai | en |
| dc.date.accessioned | 2026-08-19T16:24:58Z | - |
| dc.date.available | 2026-08-20 | - |
| dc.date.copyright | 2026-08-19 | - |
| dc.date.issued | 2026 | - |
| dc.date.submitted | 2026-08-12 13:23:26 | - |
| dc.identifier.citation | [Aar07] Scott Aaronson. The learnability of quantum states. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 463(2088):3089–3114, 2007.
[Aar18] Scott Aaronson. Shadow tomography of quantum states, 2018. [BBK+25] Ainesh Bakshi, John Bostanci, William Kretschmer, Zeph Landau, Jerry Li, Allen Liu, Ryan O'Donnell, and Ewin Tang. Learning the closest product state. In Proceedings of the 57th Annual ACM Symposium on Theory of Computing, page 1212–1221. ACM, 2025. [BBP+96] Charles H. Bennett, Gilles Brassard, Sandu Popescu, Benjamin Schumacher, John A. Smolin, and William K. Wootters. Purification of noisy entanglement and faithful teleportation via noisy channels. Physical Review Letters, 76(5):722–725, January 1996. [BCH06] Dave Bacon, Isaac L. Chuang, and Aram W. Harrow. Efficient quantum circuits for schur and clebsch-gordan transforms. Physical Review Letters, 97(17), October 2006. [BCJ03] Stephen M. Barnett, Anthony Chefles, and Igor Jex. Comparison of two unknown pure quantum states. Physics Letters A, 307(4):189–195, February 2003. [BCWdW01] Harry Buhrman, Richard Cleve, John Watrous, and Ronald de Wolf. Quantum fingerprinting. Physical Review Letters, 87(16), 2001. [BGLW26] Harry Buhrman, Dmitry Grinko, Philip Verduyn Lunel, and Jordi Weggemans. Permutation tests for quantum state identity, 2026. [CFL+25] Andrew M. Childs, Honghao Fu, Debbie Leung, Zhi Li, Maris Ozols, and Vedang Vyas. Streaming quantum state purification. Quantum, 9:1603, January 2025. [CMN22] Benoît Collins, Sho Matsumoto, and Jonathan Novak. The weingarten calculus. Notices of the American Mathematical Society, 69(05), May 2022. [CŚ06] Benoît Collins and Piotr Śniady. Integration with respect to the haar measure on unitary, orthogonal and symplectic group. Communications in Mathematical Physics, 264(3):773–795, March 2006. [dB04] J. Niel de Beaudrap. One-qubit fingerprinting schemes. Physical Review A, 69(2), February 2004. [Fey82] Richard P. Feynman. Simulating physics with computers. International Journal of Theoretical Physics, 21(6):467–488, June 1982. [FMMC12] Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland. Surface codes: Towards practical large-scale quantum computation. Physical Review A, 86(3), 2012. [FvdG98] Christopher A. Fuchs and Jeroen van de Graaf. Cryptographic distinguishability measures for quantum mechanical states, 1998. [GBO23] Dmitry Grinko, Adam Burchardt, and Maris Ozols. Gelfand-tsetlin basis for partially transposed permutations, with applications to quantum information, 2023. [GIKL26] Sabee Grewal, Vishnu Iyer, William Kretschmer, and Daniel Liang. Agnostic tomography of stabilizer product states. Quantum, 10:2027, March 2026. [Gro96] Lov K. Grover. A fast quantum mechanical algorithm for database search, 1996. [Har05] Aram W. Harrow. Applications of coherent classical communication and the schur transform to quantum information theory, 2005. [HKP20] Hsin-Yuan Huang, Richard Kueng, and John Preskill. Predicting many properties of a quantum system from very few measurements. Nature Physics, 16(10):1050–1057, 2020. [KMY01] Hirotada Kobayashi, Keiji Matsumoto, and Tomoyuki Yamakami. Quantum certificate verification: Single versus multiple quantum certificates, 2001. [KNY08] Masaru Kada, Harumichi Nishimura, and Tomoyuki Yamakami. The efficiency of quantum identity testing of multiple states. Journal of Physics A: Mathematical and Theoretical, 41(39):395309, 2008. [KS18] William M. Kirby and Frederick W. Strauch. A practical quantum algorithm for the schur transform. Quantum Information and Computation, 18(910):721–742, August 2018. [Kus97] Eyal Kushilevitz. Communication complexity. volume 44 of Advances in Computers, pages 331–360. Elsevier, 1997. [LFI+25] Zhaoyi Li, Honghao Fu, Takuya Isogawa, Caio Silva, and Isaac Chuang. Optimal quantum purity amplification, 2025. [NC00] Michael A Nielsen and Isaac L Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000. [Ngu23] Quynh T. Nguyen. The mixed schur transform: efficient quantum circuit and applications, 2023. [OOR04] R.C. Orellana, M.E. Orrison, and D.N. Rockmore. Rooted trees and iterated wreath products of cyclic groups. Advances in Applied Mathematics, 33(3):531–547, 2004 [PMS+14] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Alán Aspuru-Guzik, and Jeremy L. O'Brien. A variational eigenvalue solver on a photonic quantum processor. Nature Communications, 5(1), 2014. [Pre18] John Preskill. Quantum computing in the nisq era and beyond. Quantum, 2:79, August 2018. [Sho94] P.W. Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th Annual Symposium on Foundations of Computer Science, pages 124–134, 1994. [SSW26] Thilo Scharnhorst, Jack Spilecki, and John Wright. Nonasymptotic bounds for quantum purity amplification, 2026. [WS24] Adam Wills and Sergii Strelchuk. Generalised coupling and an elementary algorithm for the quantum schur transform, 2024. [Yao79] Andrew Chi-Chih Yao. Some complexity questions related to distributive computing(preliminary report). In Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC ’79, page 209–213, New York, NY, USA, 1979. Association for Computing Machinery. | - |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/103744 | - |
| dc.description.abstract | 量子態同一性測試是量子資訊處理中的一項基本原語。雖然全域排列測試對於純態且完全相同的狀態具有嚴格的最優性,環境退相干等物理限制使得必須採用能處理有界誤差與混合態的測試協定。本論文系統性地研究放寬條件下的 QSI_n 問題。
首先,我們從數學上證明,標準排列測試在雙邊輸入放寬下,會因局部誤差在張量積空間中的乘法式累積而導致完備性發生災難性崩潰。為了克服這項根本限制並降低電路複雜度,我們研究一種以 SWAP tree 為基礎的驗證架構。此階層式架構將全域對稱性檢查分解為局部成對測量,並以良好的對數樣本複雜度達成高可區分性。 此外,為了處理去極化通道所引起的嚴重雜訊,我們提出一種穩健的兩階段架構。此方法將串流式量子態純化模組整合為識別測試前的預處理階段,從結構上分離誤差抑制與同一性驗證。分析結果證實,此整合可將初始環境雜訊有效降低至可忽略的殘餘參數,使後續的同一性測試維持近乎最優的成功機率。綜合而言,這些理論與演算法貢獻為現實物理環境中的量子態驗證提供了一個高效率且具抗雜訊能力的框架。 | zh_TW |
| dc.description.abstract | Quantum State Identity testing is a fundamental primitive in quantum information processing. While the global Permutation Test is strictly optimal for pure and perfectly identical states, physical constraints such as environmental decoherence necessitate testing protocols capable of handling bounded errors and mixed states. In this thesis, we systematically investigate the QSI_n problem under relaxed conditions. We first mathematically demonstrate that the standard Permutation Test suffers from a catastrophic collapse in completeness under a two-sided inputs relaxation due to the multiplicative accumulation of local errors. To circumvent this fundamental limitation and reduce circuit complexity, we study a SWAP-tree-based verification architecture. This hierarchical architecture decomposes the global symmetry check into localized pairwise measurements, achieving high distinguishability with a favorable logarithmic sample complexity. Furthermore, to combat severe noise induced by depolarizing channels, we introduce a robust two-stage architecture. By integrating a streaming quantum state purification gadget as a state preprocessing phase, this approach structurally decouples error suppression from identity verification. Analytical results confirm that this integration successfully drives the initial environmental noise down to a negligible residual parameter, allowing the subsequent identity tests to maintain near-optimal success probabilities. Collectively, these theoretical and algorithmic contributions provide a highly efficient and noise-resilient framework for quantum state verification in realistic physical environments. | en |
| dc.description.provenance | Submitted by admin ntu (admin@lib.ntu.edu.tw) on 2026-08-19T16:24:58Z No. of bitstreams: 0 | en |
| dc.description.provenance | Made available in DSpace on 2026-08-19T16:24:58Z (GMT). No. of bitstreams: 0 | en |
| dc.description.tableofcontents | Acknowledgements iii
摘要 v Abstract vii Contents ix List of Figures xi Chapter 1 Introduction 1 1.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Literature Review . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.3 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Chapter 2 Preliminaries 13 2.1 Quantum States and Density Operators . . . . . . . . . . . . . . . . 13 2.2 Distance Measures . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 2.3 Quantum Channels and Purity . . . . . . . . . . . . . . . . . . . . . 15 2.3.1 The Depolarizing Channel . . . . . . . . . . . . . . . . . . . . . . 15 2.4 Notation for States Partition . . . . . . . . . . . . . . . . . . . . . . 16 2.5 Representation Theory Background . . . . . . . . . . . . . . . . . . 17 2.5.1 Weingarten Calculus . . . . . . . . . . . . . . . . . . . . . . . . . 18 Chapter 3 Analysis of Relaxed Quantum State Identity Problems 21 3.1 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . . . . . 21 3.2 The Permutation Test . . . . . . . . . . . . . . . . . . . . . . . . . . 23 3.3 One-sided inputs relaxation . . . . . . . . . . . . . . . . . . . . . . 25 3.4 Two-sided inputs relaxation . . . . . . . . . . . . . . . . . . . . . . 33 Chapter 4 Efficient Protocol under Two-Sided Inputs Relaxation 39 4.1 The SWAP Tree Protocol . . . . . . . . . . . . . . . . . . . . . . . . 40 4.2 Performance Analysis and Sample Complexity . . . . . . . . . . . . 41 Chapter 5 Efficient Algorithm for Noisy Quantum State Identity Problem 47 5.1 Decoherence and the Depolarizing Channel . . . . . . . . . . . . . . 47 5.2 Quantum State Purification via SWAP Test . . . . . . . . . . . . . . 48 5.3 Two-Stage Architecture for Noisy QSI . . . . . . . . . . . . . . . . . 51 Chapter 6 Discussion 55 Chapter 7 Future Work 57 References 59 | - |
| dc.language.iso | en | - |
| dc.subject | 量子態識別排列測試 | - |
| dc.subject | 量子態純化 | - |
| dc.subject | 交換測試 | - |
| dc.subject | 樣本複雜度 | - |
| dc.subject | 去極化通道 | - |
| dc.subject | Quantum State Identity | - |
| dc.subject | Permutation Test | - |
| dc.subject | Quantum State Purification | - |
| dc.subject | Swap Test | - |
| dc.subject | Sample Complexity | - |
| dc.subject | Depolarizing Channel | - |
| dc.title | 量子態識別問題之高效率演算法 | zh_TW |
| dc.title | Efficient Algorithms for Quantum State Identity Problem | en |
| dc.type | Thesis | - |
| dc.date.schoolyear | 114-2 | - |
| dc.description.degree | 碩士 | - |
| dc.contributor.oralexamcommittee | 鐘楷閔;鄭皓中 | zh_TW |
| dc.contributor.oralexamcommittee | Kai-Min Chung;Hao-Chung Cheng | en |
| dc.subject.keyword | 量子態識別排列測試; 量子態純化; 交換測試; 樣本複雜度; 去極化通道 | zh_TW |
| dc.subject.keyword | Quantum State Identity; Permutation Test; Quantum State Purification; Swap Test; Sample Complexity; Depolarizing Channel | en |
| dc.relation.page | 63 | - |
| dc.identifier.doi | 10.6342/NTU202601265 | - |
| dc.rights.note | 同意授權(全球公開) | - |
| dc.date.accepted | 2026-08-16 | - |
| dc.contributor.author-college | 電機資訊學院 | - |
| dc.contributor.author-dept | 電機工程學系 | - |
| dc.date.embargo-lift | 2026-08-20 | - |
| 顯示於系所單位: | 電機工程學系 | |
文件中的檔案:
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-114-2.pdf | 3.83 MB | Adobe PDF | 檢視/開啟 |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。
