@techreport{oai:ipsj.ixsq.nii.ac.jp:00225055,
 author = {浜田, 航宇 and 鈴木, 泰成 and 徳永, 裕己},
 issue = {19},
 month = {Mar},
 note = {実験的な実現が有望視される代表的な量子誤り訂正符号に表面符号がある．また，表面符号で符号化された論理量子ビット間での誤りに耐性のある演算は，論理量子ビットどうしを一時的につなぐ格子手術という手法により実現できる．格子手術ではトポロジー的な制約の下で 2 つの論理量子ビットを任意につなぐことができ，そのつなぎ方を最適化することで命令の並列性を向上できる．本論文では，ベル状態を利用すると格子手術のつなぎ方を時間軸方向に拡張できるという既知の性質を活用し，格子手術の命令列に対する効率的なスケジューリング手法を提案した．提案した手法を位相推定のサブルーチンに適用することで，貪欲法を用いた手法と比較して 2.9 倍の高速化を達成した．, Surface codes are one of the most promising quantum error-correcting codes, and logical operations on multiple logical qubits are fault-tolerantly achieved using lattice surgery. Lattice surgery operations are achieved by temporarily connecting target logical qubits, and the connection paths are arbitrary under several topological constraints. Thus they should be optimized so that the runtime of quantum computers is minimized. Here, we propose a fast and high-performance scheduling algorithm for lattice surgery. The key idea of our proposal is to use the Bell measurements and Bell state preparation for extending the flexibility of lattice-surgery mapping. As a result, the scheduling problems are reduced to path-search problems in the three-dimensional lattice. We proposed three methods to solve the path-finding problems. We also showed that the proposed algorithms reduce the runtime of a part of quantum phase estimation algorithms by 2.9 times compared with the naive methods based on greedy algorithms.},
 title = {時間軸方向を活用した効率的な格子手術のスケジューリング},
 year = {2023}
}