Fetching the paper…
Reading the bibliography…
We present magic state factory constructions for producing $|CCZ\rangle$ states and $|T\rangle$ states.
Algorithms for quantum computation: Discrete logarithms and factoring
Peter W Shor · 1994
Earlier work this paper cites.
Quantum codes on a lattice with boundary
S. B. Bravyi and A. Yu. Kitaev · 1998
Earlier work this paper cites.
Fast versions of shor’s quantum factoring algorithm
Christof Zalka · 1998
Earlier work this paper cites.
Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
Daniel Gottesman and Isaac L Chuang · 1999
Earlier work this paper cites.
Entanglement-assisted local manipulation of pure quantum states
Daniel Jonathan and Martin B Plenio · 1999
Earlier work this paper cites.
Topological quantum memory
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill · 2002
Earlier work this paper cites.
Classical and quantum computation
Alexei Yu Kitaev, Alexander Shen, Mikhail N Vyalyi, and Mikhail N Vyalyi · 2002
Earlier work this paper cites.
Universal quantum computation with ideal clifford gates and noisy ancillas
Sergey Bravyi and Alexei Kitaev · 2005
Earlier work this paper cites.
Fault-tolerant quantum computation with high threshold in two dimensions
R. Raussendorf and J. Harrington · 2007
Earlier work this paper cites.
Topological fault-tolerance in cluster state quantum computation
R. Raussendorf, J. Harrington, and K. Goyal · 2007
Earlier work this paper cites.
Yet another hat game
Maura B Paterson and Douglas R Stinson · 2010
Earlier work this paper cites.
Catalysis and activation of magic states in fault-tolerant architectures
Earl T Campbell · 2011
Cited alongside, same era.
Magic-state distillation with low overhead
Sergey Bravyi and Jeongwan Haah · 2012
Cited alongside, same era.
Surface codes: Towards practical large-scale quantum computation
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland · 2012
Cited alongside, same era.
A bridge to lower overhead quantum computation
Austin G Fowler and Simon J Devitt · 2012
Cited alongside, same era.
Surface code quantum computing by lattice surgery
Clare Horsman, Austin G Fowler, Simon Devitt, and Rodney Van Meter · 2012
Cited alongside, same era.
Distilling one-qubit magic states into toffoli states
A magic state’s fidelity can be superior to the operations that created it
Ying Li · 2015
Later among the works it cites.
Poking holes and cutting corners to achieve clifford gates with the surface code
Benjamin J Brown, Katharina Laubscher, Markus S Kesselring, and James R Wootton · 2017
Later among the works it cites.
Unified framework for magic state distillation and multiqubit gate synthesis with reduced resource cost
Earl T Campbell and Mark Howard · 2017
Later among the works it cites.
The zx calculus is a language for surface code lattice surgery
Niel de Beaudrap and Dominic Horsman · 2017
Later among the works it cites.
Encoding electronic spectra in quantum circuits with linear t complexity
Ryan Babbush, Craig Gidney, Dominic W Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler, and Hartmut Neven · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Bryan Eastin · 2013
Cited alongside, same era.
Surface code implementation of block code state distillation
Austin G Fowler, Simon J Devitt, and Cody Jones · 2013
Cited alongside, same era.
Low-overhead constructions for the fault-tolerant toffoli gate
Cody Jones · 2013
Cited alongside, same era.
Andrew J Landahl and Chris Cesare · 2013
Cited alongside, same era.
Resource comparison of two surface code implementations of small angle z rotations
Prashant Mishra and Austin Fowler · 2014
Cited alongside, same era.
Efficient synthesis of universal repeat-until-success quantum circuits
Alex Bocharov, Martin Roetteler, and Krysta M Svore · 2015
Cited alongside, same era.
Magic state parity-checker with pre-distilled components
Earl T Campbell and Mark Howard · 2018
Closest in time.
Low overhead quantum computation using lattice surgery
Austin G Fowler and Craig Gidney · 2018
Closest in time.
Halving the cost of quantum addition
Craig Gidney · 2018
Closest in time.
Approximate quantum fourier transform with o(n log(n)) t gates
Yunseong Nam, Yuan Su, and Dmitri Maslov · 2018
Closest in time.
A game of surface codes: Large-scale quantum computing with lattice surgery
Daniel Litinski · 2019
Closest in time.