Fig. 2: Number of tests required to verify a general qudit graph state in the adversarial scenario within infidelity ϵ = 0.01, significance level δ, and robustness r = 1/2.
From: Robust and efficient verification of graph states in blind measurement-based quantum computation
The red dots correspond to \({N}_{\min }(\epsilon ,\delta ,\lambda ,r)\) in Eq. (18) with λ = 1/2, and the red dashed curve corresponds to the RHS of Eq. (20), which is an upper bound for \({N}_{\min }(\epsilon ,\delta ,\lambda ,r)\). The blue dashed curve corresponds to the HM protocol16, and the green solid curve corresponds to the ZH protocol31 with λ = 1/2. The performances of the TMMMF protocol20 and TM protocol32 are not shown because the numbers of tests required are too large (see Supplementary Note 3).
