Improved upper bounds on the stabilizer rank of magic states
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\rangle=\sqrt{2}^{-1}(|0\rangle+e^{i...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2021-12-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2021-12-20-606/pdf/ |