We describe techniques to reduce the T-count based on the effective application of “spider nest identities,” easily recognised products of parity-phase operations which are equivalent to the identity operation. We demonstrate the effectiveness of such techniques by obtaining improvements in the T-counts of a number of circuits in run-times, which are typically less than the time required to make a fresh cup of coffee.

Download PDF