[8] A. G. Fowler and C. Gidney, Low over-
head quantum computation using lattice surgery,
arXiv:1808.06709 (2018).
[9] S. Bravyi and A. Kitaev, Universal quantum com-
putation with ideal Clifford gates and noisy ancil-
las, Phys. Rev. A 71, 022316 (2005).
[10] R. Babbush, C. Gidney, D. W. Berry, N. Wiebe,
J. McClean, A. Paler, A. Fowler, and H. Neven,
Encoding electronic spectra in quantum circuits
with linear T complexity, Phys. Rev. X 8, 041015
(2018).
[11] S. Bravyi and J. Haah, Magic-state distillation with
low overhead, Phys. Rev. A 86, 052329 (2012).
[12] A. G. Fowler, S. J. Devitt, and C. Jones, Surface
code implementation of block code state distillation,
Scientific Rep. 3, 1939 (2013).
[13] A. M. Meier, B. Eastin, and E. Knill, Magic-
state distillation with the four-qubit code, Quant.
Inf. Comp. 13, 195 (2013).
[14] C. Jones, Multilevel distillation of magic states
for quantum computing, Phys. Rev. A 87, 042305
(2013).
[15] G. Duclos-Cianci and K. M. Svore, Distillation of
nonstabilizer states for universal quantum compu-
tation, Phys. Rev. A 88, 042325 (2013).
[16] G. Duclos-Cianci and D. Poulin, Reducing the
quantum-computing overhead with complex gate
distillation, Phys. Rev. A 91, 042315 (2015).
[17] E. T. Campbell and M. Howard, Unified framework
for magic state distillation and multiqubit gate syn-
thesis with reduced resource cost, Phys. Rev. A 95,
022316 (2017).
[18] J. O’Gorman and E. T. Campbell, Quantum com-
putation with realistic magic-state factories, Phys.
Rev. A 95, 032338 (2017).
[19] J. Haah and M. B. Hastings, Codes and Protocols
for Distilling T , controlled-S, and Toffoli Gates,
Quantum 2, 71 (2018).
[20] E. T. Campbell and M. Howard, Magic state
parity-checker with pre-distilled components,
Quantum 2, 56 (2018).
[21] C. Gidney and A. G. Fowler, Efficient magic state
factories with a catalyzed |CCZi to 2|T i transfor-
mation, Quantum 3, 135 (2019).
[22] C. Jones, P. Brooks, and J. Harrington, Gauge
color codes in two dimensions, Phys. Rev. A 93,
052332 (2016).
[23] S. Bravyi and A. Cross, Doubled color codes,
arXiv:1509.03239 (2015).
[24] T. Jochym-O’Connor and S. D. Bartlett, Stacked
codes: Universal fault-tolerant quantum computa-
tion in a two-dimensional layout, Phys. Rev. A 93,
022323 (2016).
[25] H. Bombin, 2D quantum computation with 3D
topological codes, arXiv:1810.09571 (2018).
[26] C. Chamberland and A. W. Cross, Fault-tolerant
magic state preparation with flag qubits, Quantum
3, 143 (2019).
[27] B. J. Brown, A fault-tolerant non-Clifford
gate for the surface code in two dimensions,
arXiv:1903.11634 (2019).
[28] D. Litinski, A Game of Surface Codes: Large-Scale
Quantum Computing with Lattice Surgery, Quan-
tum 3, 128 (2019).
[29] M. Amy and M. Mosca, T-count optimization and
Reed-Muller codes, IEEE Transactions on Informa-
tion Theory , 1 (2019).
[30] J. Haah, M. B. Hastings, D. Poulin, and
D. Wecker, Magic state distillation with low space
overhead and optimal asymptotic input count,
Quantum 1, 31 (2017).
[31] A. J. Landahl and C. Ryan-Anderson, Quan-
tum computing by color-code lattice surgery,
arXiv:1407.5103 (2014).
[32] Y. Li, A magic states fidelity can be superior to the
operations that created it, New J. Phys. 17, 023037
(2015).
[33] J. Lodyga, P. Mazurek, A. Grudka, and
M. Horodecki, Simple scheme for encoding and de-
coding a qubit in unknown state for various topo-
logical codes, Scientific Rep. 5, 8975 (2015).
[34] L. Lao et al., Preparing high-fidelity magic states
with low costs, in preparation .
[35] Cramming more power into a quantum device,
https://www.ibm.com/blogs/research/2019/03/
power-quantum-device/, accessed: 2019-05-09.
[36] K. Wright, K. Beck, S. Debnath, J. Amini,
Y. Nam, N. Grzesiak, J.-S. Chen, N. Pisenti,
M. Chmielewski, C. Collins, et al., Benchmarking
an 11-qubit quantum computer, arXiv:1903.08181
(2019).
[37] The Python script and Mathematica
notebook can be found on GitHub, see
https://github.com/litinski/magicstates .
[38] E. T. Campbell and M. Howard, Unifying gate syn-
thesis and magic state distillation, Phys. Rev. Lett.
118, 060501 (2017).
[39] P. Selinger, Quantum circuits of T -depth one,
Phys. Rev. A 87, 042302 (2013).
[40] C. Jones, Low-overhead constructions for the fault-
tolerant Toffoli gate, Phys. Rev. A 87, 022328
(2013).
[41] C. Gidney, Halving the cost of quantum addition,
Quantum 2, 74 (2018).
[42] B. J. Brown and S. Roberts, Universal fault-
tolerant measurement-based quantum computation,
arXiv:1811.11780 (2018).
Accepted in Quantum 2019-10-30, click title to verify 19