A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
In this work we improve the runtime of recent classical algorithms for strong simulation of quantum circuits composed of Clifford and T gates. The improvement is obtained by establishing a new upper bound on the stabilizer rank of m copies of the magic state |T⟩=2−1(|0⟩+eiπ/4|1⟩) in the limit of large m. In particular, we show that |T⟩⊗m can be exactly expressed as a superposition of at most O(2αm) stabilizer states, where α≤0.3963, improving on the best previously known bound α≤0.463. Thisdoi:10.22331/q-2021-12-20-606 fatcat:jr2kutctwzfyznf4jul2gb2goa