Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation

We present magic state factory constructions for producing |CCZrangle states and |Trangle states. For the |CCZrangle factory we apply the surface code lattice surgery construction techniques described by Fowler et al. to the fault-tolerant Toffoli. The resulting factory has a footprint of 12d times 6d (where d is the code distance) and produces one |CCZrangle every 5.5d surface code cycles. Our |Trangle state factory uses the |CCZrangle factory's output and a catalyst |Trangle state to exactly transform one |CCZrangle state into two |Trangle states. It has a footprint 25% smaller than the factory of Fowler et al. but outputs |Trangle states twice as quickly. We show how to generalize the catalyzed transformation to arbitrary phase angles, and note that the case θ=22.5^circ produces a particularly efficient circuit for producing |sqrt{T}rangle states. Compared to using the 12d times 8d times 6.5d |Trangle factory of Fowler et al., our |CCZrangle factory can quintuple the speed of algorithms that are dominated by the cost of applying Toffoli gates, including Shor's algorithm and the chemistry algorithm of Babbush et al.. Assuming a physical gate error rate of 10^-3, our CCZ factory can produce sim 10¹⁰ states on average before an error occurs. This is sufficient for classically intractable instantiations of the chemistry algorithm, but for more demanding algorithms such as Shor's algorithm the mean number of states until failure can be increased to sim 10¹² by increasing the factory footprint 20%.