proved that a barren plateau can occur when the depth D of a hardware-efficient ansatz is D\in {\mathcal{O}}(\mathrm{poly}\,(n)). Here we extend ...
確定！ 回上一頁
