Fetching the paper…
Reading the bibliography…
Fault-tolerant Z rotations by pi/2^k are important as they arise in numerous quantum algorithms, most notably those involving quantum Fourier transforms.
Scheme for reducing decoherence in quantum computer memory
P. W. Shor · 1995
Earlier work this paper cites.
Good quantum error-correcting codes exist
A. R. Calderbank and P. W. Shor · 1996
Earlier work this paper cites.
Multiple particle interference and quantum error correction
A. M. Steane · 1996
Earlier work this paper cites.
Perfect quantum error correcting code
R. Laflamme, C. Miquel, J. P. Paz, and W. H. Zurek · 1996
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.
Topological quantum memory
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill · 2002
Earlier work this paper cites.
Quantum computing with realistically noisy devices
E. Knill · 2005
Earlier work this paper cites.
Universal quantum computation with ideal Clifford gates and noisy ancillas
S. Bravyi and A. Kitaev · 2005
Earlier work this paper cites.
Quantum universality from magic states distillation applied to CSS codes
B. W. Reichardt · 2005
Earlier work this paper cites.
Operator quantum error-correcting subsystems for self-correcting quantum memories
D. Bacon · 2006
Earlier work this paper cites.
Topological quantum distillation
H. Bombin and M. A. Martin-Delgado · 2006
Earlier work this paper cites.
The Solovay-Kitaev algorithm
C. M. Dawson and M. A. Nielsen · 2006
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
Cited alongside, same era.
Accuracy thresholds of topological color codes on the hexagonal and square-octagonal lattices
M. Ohzeki · 2009
Cited alongside, same era.
Topological color codes on Union Jack lattices: A stable implementation of the whole Clifford group
H. G. Katzgraber, H. Bombin, R. S. Andrist, and M. A. Martin-Delgado · 2010
Cited alongside, same era.
H. Bombin · 2010
Cited alongside, same era.
Clifford gates by code deformation
H. Bombin · 2011
Cited alongside, same era.
Multilevel distillation of magic states for quantum computing
Cody Jones · 2012
Later among the works it cites.
A bridge to lower overhead quantum computation
A. G. Fowler and S. J. Devitt · 2012
Later among the works it cites.
A. J. Landahl and C. Cesare · 2013
Later among the works it cites.
Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates
V. Kliuchnikov, D. Maslov, and M. Mosca · 2013
Later among the works it cites.
Efficient decomposition of single-qubit gates into v v basis circuits
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2-D color code quantum computation
A. G. Fowler · 2011
Cited alongside, same era.
Surface code quantum computing with error rates over 1%
D. S. Wang, A. G. Fowler, and L. C. L. Hollenberg · 2011
Cited alongside, same era.
Constructing arbitrary Steane code single logical qubit fault-tolerant gates
A. G. Fowler · 2011
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.
Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits
V. Kliuchnikov, D. Maslov, and M. Mosca · 2012
Cited alongside, same era.
Magic-state distillation with the four-qubit code
A. M. Meier, B. Eastin, and E. Knill · 2012
Cited alongside, same era.
Magic-state distillation with low overhead
S. Bravyi and J. Haah · 2012
Cited alongside, same era.
A. Bocharov, Y. Gurevich, and K. M. Svore · 2013
Later among the works it cites.
Repeat-until-success: Non-deterministic decomposition of single-qubit unitaries
A. Paetznick and K. M. Svore · 2013
Later among the works it cites.
Optimal complexity correction of correlated errors in the surface code
A. G. Fowler · 2013
Later among the works it cites.
Superconducting quantum circuits at the surface code threshold for fault tolerance
R. Barends, J. Kelly, A. Megrant, A. Veitia, D. Sank, E. Jeffrey, T. C. White, J. Mutus, A. G. Fowler, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, C. Neill, P. O’Malley, P. Roushan, A. Vainsencher, J. Wenner, A. N. Korotkov, A. N. Cleland, and John M. Martinis · 2014
Closest in time.
Optimal ancilla-free Clifford+T approximation of Z-rotations
N. J. Ross and P. Selinger · 2014
Closest in time.
Reducing the quantum computing overhead with complex gate distillation
G. Duclos-Cianci and D. Poulin · 2014
Closest in time.
Efficient synthesis of universal repeat-until-success circuits
A. Bocharov, M. Roetteler, and K. M. Svore · 2014
Closest in time.
Topological one-way quantum computation on verified logical cluster states
K. Fujii and K. Yamamoto · 2048
Closest in time.