Fetching the paper…
Reading the bibliography…
Despite significant overhead reductions since its first proposal, magic state distillation is often considered to be a very costly procedure that dominates the resource cost of fault-tolerant quantum computers.
J. Preskill, Reliable quantum computers, Proc. Roy. Soc. Lond. A 454
1998
Earlier work this paper cites.
A. Y. Kitaev, Fault-tolerant quantum computation by anyons, Ann. Phys. 303
2003
Earlier work this paper cites.
S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, Phys. Rev. A 71
2005
Earlier work this paper cites.
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Phys. Rev. A 86
2012
Earlier work this paper cites.
C. Horsman, A. G. Fowler, S. Devitt, and R. V. Meter, Surface code quantum computing by lattice surgery, New J. Phys. 14
2012
Earlier work this paper cites.
S. Bravyi and J. Haah, Magic-state distillation with low overhead, Phys. Rev. A 86
2012
Earlier work this paper cites.
A. G. Fowler, S. J. Devitt, and C. Jones, Surface code implementation of block code state distillation, Scientific Rep. 3
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
G. Duclos-Cianci and K. M. Svore, Distillation of nonstabilizer states for universal quantum computation, Phys. Rev. A 88
2013
Earlier work this paper cites.
P. Selinger, Quantum circuits of T T -depth one, Phys. Rev. A 87
2013
Earlier work this paper cites.
2014
Earlier work this paper cites.
B. M. Terhal, Quantum error correction for quantum memories, Rev. Mod. Phys. 87
2015
Earlier work this paper cites.
G. Duclos-Cianci and D. Poulin, Reducing the quantum-computing overhead with complex gate distillation, Phys. Rev. A 91
2015
Cited alongside, same era.
S. Bravyi and A. Cross, Doubled color codes, arXiv:1509.03239 (2015)
2015
Cited alongside, same era.
Y. Li, A magic state’s fidelity can be superior to the operations that created it, New J. Phys. 17
2015
Cited alongside, same era.
J. Lodyga, P. Mazurek, A. Grudka, and M. Horodecki, Simple scheme for encoding and decoding a qubit in unknown state for various topological codes, Scientific Rep. 5
2015
Cited alongside, same era.
C. Jones, P. Brooks, and J. Harrington, Gauge color codes in two dimensions, Phys. Rev. A 93
2016
Cited alongside, same era.
J. Haah and M. B. Hastings, Codes and Protocols for Distilling T T , controlled- S S , and Toffoli Gates, Quantum 2
2018
Later among the works it cites.
E. T. Campbell and M. Howard, Magic state parity-checker with pre-distilled components, Quantum 2
2018
Later among the works it cites.
H. Bombin, 2D quantum computation with 3D topological codes, arXiv:1810.09571 (2018)
2018
Later among the works it cites.
C. Gidney, Halving the cost of quantum addition, Quantum 2
2018
Later among the works it cites.
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. Jochym-O’Connor and S. D. Bartlett, Stacked codes: Universal fault-tolerant quantum computation in a two-dimensional layout, Phys. Rev. A 93
2016
Cited alongside, same era.
E. T. Campbell, B. M. Terhal, and C. Vuillot, Roads towards fault-tolerant universal quantum computation, Nature 549
2017
Cited alongside, same era.
J. O’Gorman and E. T. Campbell, Quantum computation with realistic magic-state factories, Phys. Rev. A 95
2017
Cited alongside, same era.
J. Haah, M. B. Hastings, D. Poulin, and D. Wecker, Magic state distillation with low space overhead and optimal asymptotic input count, Quantum 1
2017
Cited alongside, same era.
D. Litinski and F. v. Oppen, Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes, Quantum 2
2018
Cited alongside, same era.
2018
Cited alongside, same era.
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
2018
Cited alongside, same era.
C. Gidney and A. G. Fowler, Efficient magic state factories with a catalyzed | C C Z ⟩ |CCZ\rangle to 2 | T ⟩ 2|T\rangle transformation, Quantum 3
2019
Closest in time.
C. Chamberland and A. W. Cross, Fault-tolerant magic state preparation with flag qubits, Quantum 3
2019
Closest in time.
2019
Closest in time.
D. Litinski, A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery, Quantum 3
2019
Closest in time.
M. Amy and M. Mosca, T-count optimization and Reed-Muller codes, IEEE Transactions on Information Theory , 1 (2019)
2019
Closest in time.
Cramming more power into a quantum device, https://www.ibm.com/blogs/research/2019/03/ power-quantum-device/ , accessed: 2019-05-09
2019
Closest in time.