Fetching the paper…
Reading the bibliography…
We analyze the resource overhead of recently proposed methods for universal fault-tolerant quantum computation using concatenated codes.
D. Aharonov and M. Ben-Or, “Fault-tolerant quantum computation with constant error,” in Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
1997
Earlier work this paper cites.
A. Y. Kitaev, “Quantum computations: algorithms and error correction,” Russian Mathematical Surveys
1997
Earlier work this paper cites.
A. W. Steane, “Active stabilization, quantum computation, and quantum state synthesis,” Phys. Rev. Lett
1997
Earlier work this paper cites.
J. Preskill, “Reliable quantum computers,” Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
1998
Earlier work this paper cites.
Cambridge University Press, Cambridge, England, 2000
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information · 2000
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” Journal of Mathematical Physics
2002
Earlier work this paper cites.
A. M. Steane, “Fast fault-tolerant filtering of quantum codewords,” arXiv preprint quant-ph/0202036
2002
Earlier work this paper cites.
Y. S. Weinstein, C. S. Hellberg, and J. Levy, “Quantum-dot cluster-state computing with encoded qubits,” Phys. Rev. A
2005
Earlier work this paper cites.
H. Häffner, W. Hänsel, C. Roos, J. Benhelm, M. Chwalla, T. Körber, U. Rapol, M. Riebe, P. Schmidt, C. Becher, et al
2005
Earlier work this paper cites.
S. Bravyi and A. Kitaev, “Universal quantum computation with ideal Clifford gates and noisy ancillas,” Phys. Rev. A
2005
Earlier work this paper cites.
P. Aliferis, D. Gottesman, and J. Preskill, “Quantum accuracy threshold for concatenated distance–3 codes,” Quant. Inf. Comput
2006
Earlier work this paper cites.
PhD thesis, California Institute of Technology, 2007
P. P. Aliferis, Level reduction and the quantum threshold theorem · 2007
Earlier work this paper cites.
R. Stock and D. F. James, “Scalable, high-speed measurement-based quantum computer using trapped ions,” Physical review letters
2009
Earlier work this paper cites.
S. J. Devitt, A. G. Fowler, A. M. Stephens, A. D. Greentree, L. C. Hollenberg, W. J. Munro, and K. Nemoto, “Architectural design for a topological cluster state quantum computer,” New Journal of Physics
2009
Cited alongside, same era.
B. Eastin and E. Knill, “Restrictions on transversal encoded quantum gate sets,” Phys. Rev. Lett
2009
Cited alongside, same era.
R. Van Meter, T. D. Ladd, A. G. Fowler, and Y. Yamamoto, “Distributed quantum computation architecture using semiconductor nanophotonics,” International Journal of Quantum Information
2010
Cited alongside, same era.
A. Paetznick and B. W. Reichardt, “Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit golay code,” Quant. Inf. Compt
2011
Cited alongside, same era.
B. Zeng, A. W. Cross, and I. L. Chuang, “Transversality Versus Universality for Additive Quantum Codes,” IEEE Transactions on Information Theory
R. Barends, J. Kelly, A. Megrant, A. Veitia, D. Sank, E. Jeffrey, T. C. White, J. Mutus, A. G. Fowler, B. Campbell, et al
2014
Later among the works it cites.
J. M. Chow, J. M. Gambetta, E. Magesan, D. W. Abraham, A. W. Cross, B. R. Johnson, N. A. Masluk, C. A. Ryan, J. A. Smolin, S. J. Srinivasan, et al
2014
Later among the works it cites.
T. Jochym-O’Connor and R. Laflamme, “Using concatenated quantum codes for universal fault-tolerant quantum gates,” Phys. Rev. Lett
2014
Later among the works it cites.
J. T. Anderson, G. Duclos-Cianci, and D. Poulin, “Fault-tolerant conversion between the steane and reed-muller quantum codes,” Phys. Rev. Lett
2014
Later among the works it cites.
J. Kelly, R. Barends, A. G. Fowler, A. Megrant, E. Jeffrey, T. C. White, D. Sank, J. Y. Mutus, B. Campbell, Y. Chen, et al
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
N. C. Jones, R. Van Meter, A. G. Fowler, P. L. McMahon, J. Kim, T. D. Ladd, and Y. Yamamoto, “Layered architecture for quantum computing,” Physical Review X
2012
Cited alongside, same era.
N. Y. Yao, L. Jiang, A. V. Gorshkov, P. C. Maurer, G. Giedke, J. I. Cirac, and M. D. Lukin, “Scalable architecture for a room temperature solid-state quantum information processor,” Nature communications
2012
Cited alongside, same era.
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, “Surface codes: Towards practical large-scale quantum computation,” Phys. Rev. A
2012
Cited alongside, same era.
2012
Cited alongside, same era.
M. H. Devoret and R. J. Schoelkopf, “Superconducting circuits for quantum information: an outlook,” Science
2013
Cited alongside, same era.
S. J. Devitt, A. M. Stephens, W. J. Munro, and K. Nemoto, “Requirements for fault-tolerant factoring on an atom-optics quantum computer,” Nature communications
2013
Cited alongside, same era.
J. T. Anderson and G. Duclos-Cianci, “Private communication,” 2013
2013
Cited alongside, same era.
F. Pastawski and B. Yoshida, “Fault-tolerant logical gates in quantum error-correcting codes,” Phys. Rev. A
2015
Later among the works it cites.
S. Bravyi and A. Cross, “Doubled color codes,” arXiv:1509.03239
2015
Later among the works it cites.
2016
Closest in time.
C. Chamberland, T. Jochym-O’Connor, and R. Laflamme, “Thresholds for universal concatenated quantum codes,” Phys. Rev. Lett
2016
Closest in time.
2016
Closest in time.
T. Jochym-O’Connor and S. D. Bartlett, “Stacked codes: Universal fault-tolerant quantum computation in a two-dimensional layout,” Phys. Rev. A
2016
Closest in time.
C. Jones, P. Brooks, and J. Harrington, “Gauge color codes in two dimensions,” Phys. Rev. A
2016
Closest in time.