Work

Efficient magic state factories with a catalyzed | C C Z ⟩ to 2 | T ⟩ transformation

Year: 2019
Type: article
Abstract: We present magic state factory constructions for producing | C C Z ⟩ states and | T ⟩ states. For the | C C Z ⟩ factory we apply the surface code lattice surgery construction techniques described in \cite{fowler2018} to the fault-tolerant Toffoli \cite{jones2013, eastin2013distilling}. The resulting factory has a footprint of 12 d × 6 d (where d is the code distance) and produces one | C C Z ⟩ every 5.5 d surface code cycles. Our | T ⟩ state factory uses the | C C Z ⟩ factory's output and a catalyst | T ⟩ state to exactly transform one | C C Z ⟩ state into two | T ⟩ states. It has a footprint 25 % smaller than the factory in \cite{fowler2018} but outputs | T ⟩ states twice as quickly. We show how to generalize the catalyzed transformation to arbitrary phase angles, and note that the case θ = 22.5 ∘ produces a particularly efficient circuit for producing | T ⟩ states. Compared to using the 12 d × 8 d × 6.5 d | T ⟩ factory of \cite{fowler2018}, our | C C Z ⟩ factory can quintuple the speed of algorithms that are dominated by the cost of applying Toffoli gates, including Shor's algorithm \cite{shor1994} and the chemistry algorithm of Babbush et al. \cite{babbush2018}. Assuming a physical gate error rate of 10 − 3 , our CCZ factory can produce ∼ 10 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 ∼ 10 12
Source: Quantum
Authors: Craig Gidney, Austin G. Fowler
Language: English
Open Access status: gold
Estimated APC paid: $215
OpenAlex ID: W2952708034
FWCI: 6.54
Cites: 36
Cited by: 321
Related to: 10