2026-05-20T02:08:44Z https://ipsj.ixsq.nii.ac.jp/oai

oai:ipsj.ixsq.nii.ac.jp:00217627 2025-01-19T15:26:16Z 1164:10193:10905:10906

Divide-and-conquer verification method for noisy intermediate-scale quantum computation Divide-and-conquer verification method for noisy intermediate-scale quantum computation Yuki, Takeuchi Yasuhiro, Takahashi Tomoyuki, Morimae Seiichiro, Tani Yuki, Takeuchi Yasuhiro, Takahashi Tomoyuki, Morimae Seiichiro, Tani Several noisy intermediate-scale quantum computations can be regarded as logarithmic-depth quantum circuits on a sparse quantum computing chip, where two-qubit gates can be directly applied on only some pairs of qubits. In this talk, we propose a method to efficiently verify such noisy intermediate-scale quantum computation. To this end, we first characterize small-scale quantum operations with respect to the diamond norm. Then by using these characterized quantum operations, we estimate the fidelity <ψt Several noisy intermediate-scale quantum computations can be regarded as logarithmic-depth quantum circuits on a sparse quantum computing chip, where two-qubit gates can be directly applied on only some pairs of qubits. In this talk, we propose a method to efficiently verify such noisy intermediate-scale quantum computation. To this end, we first characterize small-scale quantum operations with respect to the diamond norm. Then by using these characterized quantum operations, we estimate the fidelity <ψt technical report 情報処理学会 2022-03-17 application/pdf 量子ソフトウェア（QS） 5 2022-QS-5 1 8 2435-6492 AA12894105 https://ipsj.ixsq.nii.ac.jp/record/217627/files/IPSJ-QS22005005.pdf eng