@techreport{oai:ipsj.ixsq.nii.ac.jp:00217627, author = {Yuki, Takeuchi and Yasuhiro, Takahashi and Tomoyuki, Morimae and Seiichiro, Tani and Yuki, Takeuchi and Yasuhiro, Takahashi and Tomoyuki, Morimae and Seiichiro, Tani}, issue = {5}, month = {Mar}, note = {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}, title = {Divide-and-conquer verification method for noisy intermediate-scale quantum computation}, year = {2022} }