政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/147295
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 114420/145447 (79%)
造訪人次 : 53249147      線上人數 : 651
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋


    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/147295


    題名: 從雜訊的 I/Q 訊號中識別量子位元狀態
    Identification of qubit states from noisy I/Q signals
    作者: 朱宗彥
    Chu, Tsung-Yen
    貢獻者: 陳啟東
    林瑜琤
    Chen, Chii-Dong
    Lin, Yu-Cheng
    朱宗彥
    Chu, Tsung-Yen
    關鍵詞: 量子態斷層掃描
    超導量子位元
    單點量測
    高斯混合模型
    射頻
    數位讀出
    quantum state tomography
    superconducting quantum bit
    single shot measurement
    Gaussian mixture model
    radio frequency
    digital readout
    日期: 2023
    上傳時間: 2023-09-01 16:27:53 (UTC+8)
    摘要: 量子計算為運用量子力學原理，如量子疊加及量子糾纏，之計算方法。量子電腦之基本元件為作爲訊息單位的量子位元，以及可在一個或數個量子位元操縱么正轉換的量子邏輯閘。
    量子位元有兩截然不同的|0>狀態（對應到古典位元的 0）及|1>狀態（對應到古典位元的 1），但不同於古典位元，
    量子位元可處於 |0> 及 |1> 的疊加態。在當今許多可實現量子位元的物理系統中，transmon 超導量子位元算是最具前景可實現可擴充性量子計算的平台。
    本論文聚焦於在量子位元的單點量測及量子態斷層掃描實驗。為了利用分群演算法來分類量子位元的基態（|0>）及激發態（|1>）
    在 I/Q 平面的讀取訊號分佈。除了以距離為基準的分類方法，我們進一步透過高斯混合模型算法來找出兩分布的中心點及共變異矩陣(寬窄及走向)，以提高分類之精確度；
    此模型可應用於所有同一讀出參數的量測，生成該狀態基態和激發態各自的機率。我們也展示以量子態斷層掃描來檢測分類結果之可行性。
    Quantum computing is a computational approach that utilizes principles of quantum mechanics, such as quantum superposition and entanglement. The essential parts of a quantum computing system are the quantum bit (or the qubit) as the basic unit of quantum information and quantum logic gates which implement unitary transformations acting on one or a small number of qubits. A qubit has two distinct states, one represented by |0> (equivalent to ``0`` for a classical bit) and the other represented by |1> (equivalent to ``1`` for a classical bit). Unlike a classical bit, a qubit can also exist
    in a coherent superposition of the |0> and |1> states, rather than being limited to just one of the states. Among many possible physical realizations of qubits, the superconducting transmon qubit is the most promising platform for realizing scalable quantum computing. In this thesis, we focus on single-shot measurements and quantum state tomography performed on transmon qubits. We use clustering algorithms to classify single-shot readout results for the ground (|0>) state and the excited (|1>) state
    of the transmon qubit in the in-phase and quadrature (I-Q) signal plane.
    In addition to distance-based approaches, we have employed the Gaussian mixture model to determine the centers of the two distributions for the two corresponding states and their covariance matrices in order to further improve the
    accuracy in classification. This model can then be directly applied to all measurements with the same readout parameters, generating the probabilities of the |0> and |1> states. We also demonstrate the feasibility of
    using quantum state tomography experiments to verify the results obtained through the classification methods.
    參考文獻: [1] Bagnall, Anthony, et al. “The great time series classification bake off: a review and
    experimental evaluation of recent algorithmic advances,” Data Mining and Knowledge
    Discovery, 31 (05 2017).
    [2] Chen, Zijun. Metrology of Quantum Control and Measurement in Superconducting
    Qubits. PhD dissertation, University of California, Santa Barbara, 2018.
    [3] Devoret, Michel H., “Quantum Fluctuations in Electrical Circuits,” 1997.
    [4] Fink, Johannes M. Quantum nonlinearities in strong coupling circuit QED. Doctoral
    Thesis, University of Vienna, 2010.
    [5] Giusti, Rafael and Gustavo E.A.P.A. Batista. “An Empirical Comparison of Dissimilarity
    Measures for Time Series Classification.” 2013 Brazilian Conference on Intelligent
    Systems. 82–88. 2013.
    [6] Jaynes, E.T. and F.W. Cummings. “Comparison of quantum and semiclassical radiation
    theories with application to the beam maser,” Proceedings of the IEEE, 51(1):89–109
    (1963).
    [7] Kerimbekov, Yerzhan, et al. “The use of Lorentzian distance metric in classification
    problems,” Pattern Recognition Letters, 84:170–176 (2016).
    [8] Martinis, John M. and Kevin Osborne, “Superconducting Qubits and the Physics of
    Josephson Junctions,” 2004.
    [9] Rempe, Gerhard, et al. “Observation of quantum collapse and revival in a one-atom
    maser,” Phys. Rev. Lett., 58:353–356 (Jan 1987).
    [10] Smolin, John A., et al. “Efficient Method for Computing the Maximum-Likelihood
    Quantum State from Measurements with Additive Gaussian Noise,” Phys. Rev. Lett.,
    108:070502 (Feb 2012).
    [11] Tsai, Yu. A. Pashkin · O. Astafiev · T. Yamamoto · Y. Nakamura · J. S. “Josephson charge
    qubits: a brief review,” Quantum Inf Process (2009) 8, 55–80 (2009).
    [12] Y. Nakamura, Yu. A. Pashkin, J. S. Tsai. “Coherent control of macroscopic quantum
    states in a single-Cooper-pair box,” Nature, 398:786–788 (4 1999).
    描述: 碩士
    國立政治大學
    應用物理研究所
    110755001
    資料來源: http://thesis.lib.nccu.edu.tw/record/#G0110755001
    資料類型: thesis
    顯示於類別:[應用物理研究所 ] 學位論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    500101.pdf22976KbAdobe PDF2240檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋