Fetching the paper…
Reading the bibliography…
The essential requirement for fault-tolerant quantum computation (FTQC) is the total protocol design to achieve a fair balance of all the critical factors relevant to its practical realization, such as the space overhead, the threshold, and the modularity.
R. W. Hamming, Error detecting and error correcting codes, The Bell system technical journal 29
1950
Earlier work this paper cites.
R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM 21
1978
Earlier work this paper cites.
P. Shor, Algorithms for quantum computation: discrete logarithms and factoring, in Proceedings 35th Annual Symposium on Foundations of Computer Science (1994) pp. 124–134
1994
Earlier work this paper cites.
A. M. Steane, Simple quantum error-correcting codes, Phys. Rev. A 54
1996
Earlier work this paper cites.
B. Schumacher, Sending entanglement through noisy quantum channels, Phys. Rev. A 54
1996
Earlier work this paper cites.
A. M. Steane, Active stabilization, quantum computation, and quantum state synthesis, Phys. Rev. Lett. 78
1997
Earlier work this paper cites.
D. Gottesman, Stabilizer codes and quantum error correction , Ph.D. thesis , California Institute of Technology (1997)
1997
Earlier work this paper cites.
A. Y. Kitaev, Quantum error correction with imperfect gates, in Quantum Communication, Computing, and Measurement , edited by O. Hirota, A. S. Holevo, and C. M. Caves (Springer US, Boston, MA, 1997) pp. 181–188
1997
Earlier work this paper cites.
S. B. Bravyi and A. Y. Kitaev, Quantum codes on a lattice with boundary, arXiv:quant-ph/9811052 [quant-ph] (1998)
1998
Earlier work this paper cites.
D. Gottesman, Fault-tolerant quantum computation with local gates, Journal of Modern Optics 47
2000
Earlier work this paper cites.
M. H. Freedman and D. A. Meyer, Projective plane and planar quantum codes, Foundations of Computational Mathematics 1
2001
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, Journal of Mathematical Physics 43
2002
Earlier work this paper cites.
A. M. Steane, Fast fault-tolerant filtering of quantum codewords, arXiv:quant-ph/0202036 (2002)
2002
Earlier work this paper cites.
A. M. Steane, Overhead and noise threshold of fault-tolerant quantum error correction, Phys. Rev. A 68
2003
Earlier work this paper cites.
C. Wang, J. Harrington, and J. Preskill, Confinement-higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory, Annals of Physics 303
2003
Earlier work this paper cites.
A. Y. Kitaev, Fault-tolerant quantum computation by anyons, Annals of physics 303
2003
Earlier work this paper cites.
S. Glancy, E. Knill, and H. M. Vasconcelos, Entanglement purification of any stabilizer state, Phys. Rev. A 74
2006
Earlier work this paper cites.
B. W. Reichardt, Postselection threshold against biased noise, in 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS’06) (2006) pp. 420–428
2006
Earlier work this paper cites.
D. Poulin, Optimal and efficient decoding of concatenated quantum block codes, Phys. Rev. A 74
2006
Earlier work this paper cites.
K. M. Svore, D. P. Divincenzo, and B. M. Terhal, Noise threshold for a fault-tolerant two-dimensional lattice architecture, Quantum Info. Comput. 7
2007
Earlier work this paper cites.
H. Bombin and M. A. Martin-Delgado, Optimal resources for topological two-dimensional stabilizer codes: Comparative study, Physical Review A 76
2007
Earlier work this paper cites.
P. Aliferis, D. Gottesman, and J. Preskill, Accuracy threshold for postselected quantum computation, Quantum Inf. Comput. 8
2008
Earlier work this paper cites.
A. W. Cross, D. P. Divincenzo, and B. M. Terhal, A comparative code study for quantum fault tolerance, Quantum Info. Comput. 9
2009
Earlier work this paper cites.
M. M. Wilde, Logical operators of quantum codes, Phys. Rev. A 79
2009
Earlier work this paper cites.
B. W. Reichardt, Error-detection-based quantum fault-tolerance threshold, Algorithmica 55
2009
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information (Cambridge university press, 2010)
2010
Cited alongside, same era.
D. Gottesman, An introduction to quantum error correction and fault-tolerant quantum computation, in Quantum information science and its contributions to mathematics, Proceedings of Symposia in Applied Mathematics , Vol. 68 (2010) pp. 13–58
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, Quantum Inf. Comput. 12
2011
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 86
2012
Cited alongside, same era.
D. Horsman, A. G. Fowler, S. Devitt, and R. Van Meter, Surface code quantum computing by lattice surgery, New Journal of Physics 14
L. Egan, D. M. Debroy, C. Noel, A. Risinger, D. Zhu, D. Biswas, M. Newman, M. Li, K. R. Brown, M. Cetina, et al. , Fault-tolerant control of an error-corrected qubit, Nature 598
2021
Later among the works it cites.
J. E. Bourassa, R. N. Alexander, M. Vasmer, A. Patil, I. Tzitrin, T. Matsuura, D. Su, B. Q. Baragiola, S. Guha, G. Dauphinais, K. K. Sabapathy, N. C. Menicucci, and I. Dhand, Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer, Quantum 5
2021
Later among the works it cites.
C. Gidney and M. Ekerå, How to factor 2048 bit rsa integers in 8 hours using 20 million noisy qubits, Quantum 5
2021
Later among the works it cites.
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
A. A. Kovalev and L. P. Pryadko, Fault tolerance of quantum low-density parity check codes with sublinear distance scaling, Phys. Rev. A 87
2013
Cited alongside, same era.
H. Goto and H. Uchikawa, Fault-tolerant quantum computation with a soft-decision decoder for error correction and detection by teleportation, Scientific reports 3
2013
Cited alongside, same era.
D. Gottesman, Fault-tolerant quantum computation with constant overhead, Quantum Info. Comput. 14
2014
Cited alongside, same era.
H. Goto, Step-by-step magic state encoding for efficient fault-tolerant quantum computation, Scientific Reports 4
2014
Cited alongside, same era.
H. Goto, Minimizing resource overheads for fault-tolerant preparation of encoded states of the steane code, Scientific Reports 6
2016
Cited alongside, same era.
E. Barker and Q. Dang, Nist special publication 800-57 part 1, revision 4, NIST, Tech. Rep 16
2016
Cited alongside, same era.
qpic, https://github.com/qpic/qpic (2016)
2016
Cited alongside, same era.
J. Lee, D. W. Berry, C. Gidney, W. J. Huggins, J. R. McClean, N. Wiebe, and R. Babbush, Even more efficient quantum computations of chemistry through tensor hypercontraction, PRX Quantum 2
2021
Later among the works it cites.
C. Gidney, Stim: a fast stabilizer circuit simulator, Quantum 5
2021
Later among the works it cites.
L. Z. Cohen, I. H. Kim, S. D. Bartlett, and B. J. Brown, Low-overhead fault-tolerant quantum computing using long-range connectivity, Science Advances 8
2022
Later among the works it cites.
M. A. Tremblay, N. Delfosse, and M. E. Beverland, Constant-overhead quantum error correction with thin planar connectivity, Phys. Rev. Lett. 129
2022
Later among the works it cites.
2022
Later among the works it cites.
M. Christandl and A. Müller-Hermes, Fault-tolerant coding for quantum communication, IEEE Transactions on Information Theory 70
2022
Later among the works it cites.
C. Chamberland and E. T. Campbell, Universal quantum computing with twist-free and temporally encoded lattice surgery, PRX Quantum 3
2022
Later among the works it cites.
C. Gidney, M. Newman, and M. McEwen, Benchmarking the planar honeycomb code, Quantum 6
2022
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
M. Fellous-Asiani, J. H. Chai, Y. Thonnart, H. K. Ng, R. S. Whitney, and A. Auffèves, Optimizing resource efficiencies for scalable full-stack quantum computers, PRX Quantum 4
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
H. Yamasaki and M. Koashi, Time-efficient constant-space-overhead fault-tolerant quantum computation, Nature Physics 20
2024
Closest in time.
2024
Closest in time.
D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, et al. , Logical quantum processor based on reconfigurable atom arrays, Nature 626
2024
Closest in time.
H. Goto, High-performance fault-tolerant quantum computing with many-hypercube codes, Science Advances 10
2024
Closest in time.