Skip navigation

DSpace JSPUI

DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets

Learn More
DSpace logo
English
中文
  • Browse
    • Communities
      & Collections
    • Publication Year
    • Author
    • Title
    • Subject
    • Advisor
  • Search TDR
  • Rights Q&A
    • My Page
    • Receive email
      updates
    • Edit Profile
  1. NTU Theses and Dissertations Repository
  2. 重點科技研究學院
  3. 積體電路設計與自動化學位學程
Please use this identifier to cite or link to this item: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/101086
Title: 具變異數感知之分組量測與動態測量配置:應用於變分量子本徵值計算
Variance-Aware Grouped Measurement and Dynamic Shot Allocation for VQE
Authors: 劉承瀚
Cheng-Han Liu
Advisor: 江介宏
Jie-Hong Roland Jiang
Keyword: 期望值估計,分群測量變異數感知
Expectation value estimation,Grouped measurementVariance-aware
Publication Year : 2025
Degree: 碩士
Abstract: 變分量子本徵值計算(VQE)是一種可應用於化學模擬的量子演算法,其中需要計算許多包利字符串(Pauli strings)的期望值,相較於每個量子電路都只計算一個包利字符串的期望值,人們通常會透過分群量測(grouped measurement)來減少量測量子電路的次數。不過每一群的重要性不盡相同,較重要的群理應分配到較多的測量次數,而且各群之間還能允許有重疊的包利字符串,因此本文主要探討該如何進行分群還有每群應該分配多少測量次數才能盡可能的使用固定的測量數目來獲得更精確的結果。
本文主要改良在於提出一個精確公式來計算該如何分配量測次數給所有的完全子圖(clique partition),並且基於此公式設計一個演算法來利用量測結果來計算共變異數資訊以尋找更好的完全子圖集合,此外重疊的包利字符串並不是選愈多愈好,因此我們也設計一套流程來選擇想要的重疊包利字符串。實驗顯示,相比於最新的先前方法AEQuO,我們的演算法能夠在更短的時間找到更好的結果。此研究有助於減少VQE演算法所需的量測數目,此研究也可以延伸擴展至其他需要求取大量期望值的量子演算法。
The variational quantum eigensolver (VQE) is a quantum algorithm used in chemical simulations, specifically for calculating the expectation values of various Pauli strings. Typically, instead of computing the expectation value of each Pauli string individually for every quantum circuit, researchers reduce the number of quantum circuits by employing grouped measurements. However, the significance of each group can vary; more critical groups necessitate a larger number of measurements, and overlapping Pauli strings are permitted between groups. Consequently, this paper focuses on how to effectively conduct grouping and determine the appropriate number of measurement counts assigned to each group to achieve more accurate results with a fixed number of measurements.
The main contribution of this paper lies in proposing a precise formula for allocating measurement counts to the given clique partition, along with the designed algorithm based on this formula. This algorithm uses the measurement results to calculate covariance information, which helps identify improved clique coverings. Additionally, to avoid excessive selection of overlapping Pauli strings, we have developed a process for down-sampling the redundant overlapping information. Experiments demonstrate that our algorithm outperforms the latest method, AEQuO, by delivering better results in a shorter time. This research aids in reducing the number of measurements required by the VQE algorithm and can be extended to other quantum algorithms that have a requirement to obtain the expectation values of numerous Pauli strings.
URI: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/101086
DOI: 10.6342/NTU202502451
Fulltext Rights: 同意授權(限校園內公開)
metadata.dc.date.embargo-lift: 2030-06-30
Appears in Collections:積體電路設計與自動化學位學程

Files in This Item:
File SizeFormat 
ntu-114-1.pdf
  Restricted Access
22.62 MBAdobe PDFView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved