{"id":238230,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00238230","sets":["6164:6165:7651:11699"]},"path":["11699"],"owner":"44499","recid":"238230","title":["重み付きグラフに対応したUnion-Findアルゴリズムによる表面符号デコーダの実装と評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-08-21"},"_buckets":{"deposit":"a0e15f17-10e4-44a0-a397-98838de01c00"},"_deposit":{"id":"238230","pid":{"type":"depid","value":"238230","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"重み付きグラフに対応したUnion-Findアルゴリズムによる表面符号デコーダの実装と評価","author_link":["652220","652223","652219","652222","652224","652221"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"重み付きグラフに対応したUnion-Findアルゴリズムによる表面符号デコーダの実装と評価"},{"subitem_title":"Implementation and Evaluation of a Surface Code Decoder Using Union-Find Algorithm on a Weighted Graph","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"量子コンピュータ","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2024-08-21","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学"},{"subitem_text_value":"東京大学"},{"subitem_text_value":"東京大学"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/238230/files/IPSJ-DAS2024006.pdf","label":"IPSJ-DAS2024006.pdf"},"date":[{"dateType":"Available","dateValue":"2026-08-21"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DAS2024006.pdf","filesize":[{"value":"3.6 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"e213918c-ecfb-489c-bc3b-95ecafb5c57e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"笠村, 卓矢"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"門本, 淳一郎"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"入江, 英嗣"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takuya, Kasamura","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Junichiro, Kadomoto","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hidetsugu, Irie","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"実用的な量子計算機を実現する上では，量子ビットのエラーが障壁となる．これに対処するため，表面符号によって量子ビットを符号化し，デコーダによって復号する量子誤り訂正（QEC）が広く用いられている．デコーダの性能は QEC の性能に大きく影響するため，高速かつ高精度な設計が重要となる．復号はグラフのマッチング問題として表現され，現実的な量子ビットのエラー率のばらつきを反映するため重み付きグラフが用いられる．本研究では，重み付きグラフに対応したデコーダを，高速に復号が可能な Union-Find アルゴリズムを用いて RTL 実装と評価を行った．結果として，エラー率のばらつきを反映しながら既存のデコーダと比べて回路面積の削減を確認した．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Achieving practical quantum computers is hindered by qubit errors. To address this, quantum error correction (QEC) using surface codes to encode qubits is widely employed. The performance of the decoder significantly impacts the overall performance of QEC, making high-speed and high-accuracy design crucial. Decoding can be represented as a graph matching problem, and using weighted graphs can reflect realistic variations in qubit error rates. In this study, we implemented and evaluated a decoder that supports weighted graphs using a Union-Find algorithm for fast decoding on an FPGA. As a result, a reduction in circuit area compared to existing decoders was confirmed while reflecting variations in error rates.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"34","bibliographic_titles":[{"bibliographic_title":"DAシンポジウム2024論文集"}],"bibliographicPageStart":"27","bibliographicIssueDates":{"bibliographicIssueDate":"2024-08-21","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2024"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T08:37:51.440090+00:00","created":"2025-01-19T01:41:20.076416+00:00","links":{}}