Fetching the paper…
Reading the bibliography…
The requirements for fault-tolerant quantum error correction can be simplified by leveraging structure in the noise of the underlying hardware.
Peter W. Shor, “Scheme for reducing decoherence in quantum computer memory,” Phys. Rev. A 52
1995
Earlier work this paper cites.
P.W. Shor, “Fault-tolerant quantum computation,” in Proceedings of 37th Conference on Foundations of Computer Science (1996) pp. 56–65
1996
Earlier work this paper cites.
A. R. Calderbank and Peter W. Shor, “Good quantum error-correcting codes exist,” Phys. Rev. A 54
1996
Earlier work this paper cites.
Dorit Aharonov and Michael Ben-Or, “Fault-tolerant quantum computation with constant error,” in Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (1997) pp. 176–188
1997
Earlier work this paper cites.
M. Grassl, Th. Beth, and T. Pellizzari, “Codes for the quantum erasure channel,” Phys. Rev. A 56
1997
Earlier work this paper cites.
Charles H. Bennett, David P. DiVincenzo, and John A. Smolin, “Capacities of quantum erasure channels,” Phys. Rev. Lett. 78
1997
Earlier work this paper cites.
Emanuel Knill, Raymond Laflamme, and Wojciech H Zurek, “Resilient quantum computation,” Science 279
1998
Earlier work this paper cites.
Daniel Gottesman, “Theory of fault-tolerant quantum computation,” Physical Review A 57
1998
Earlier work this paper cites.
John Preskill, “Reliable quantum computers,” Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 454
1998
Earlier work this paper cites.
Hans J. Briegel and Robert Raussendorf, “Persistent entanglement in arrays of interacting particles,” Phys. Rev. Lett. 86
2001
Earlier work this paper cites.
Robert Raussendorf and Hans J Briegel, “A one-way quantum computer,” Physical Review Letters 86
2001
Earlier work this paper cites.
Robert Raussendorf, Daniel Browne, and Hans Briegel, “The one-way quantum computer–a non-network model of quantum computation,” Journal of Modern Optics 49
2002
Earlier work this paper cites.
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill, “Topological quantum memory,” Journal of Mathematical Physics 43
2002
Earlier work this paper cites.
Robert Raussendorf, Daniel E Browne, and Hans J Briegel, “Measurement-based quantum computation on cluster states,” Physical Review A 68
2003
Earlier work this paper cites.
Daniel E. Browne and Terry Rudolph, “Resource-efficient linear optical quantum computation,” Phys. Rev. Lett. 95
2005
Earlier work this paper cites.
Lorenza Viola and Emanuel Knill, “Random decoupling schemes for quantum dynamical control and error suppression,” Physical review letters 94
2005
Earlier work this paper cites.
Robert Raussendorf, Sergey Bravyi, and Jim Harrington, “Long-range quantum entanglement in noisy cluster states,” Physical Review A 71
2005
Earlier work this paper cites.
Panos Aliferis and Barbara M Terhal, “Fault-tolerant quantum computation for local leakage faults,” arXiv preprint quant-ph/0511065 (2005)
2005
Earlier work this paper cites.
Sergey Bravyi and Alexei Kitaev, “Universal quantum computation with ideal clifford gates and noisy ancillas,” Physical Review A 71
2005
Earlier work this paper cites.
Robert Raussendorf, Jim Harrington, and Kovid Goyal, “A fault-tolerant one-way quantum computer,” Annals of Physics 321
2006
Earlier work this paper cites.
Robert Raussendorf and Jim Harrington, “Fault-tolerant quantum computation with high threshold in two dimensions,” Physical review letters 98
2007
Earlier work this paper cites.
Jérôme Beugnon, Charles Tuchendler, Harold Marion, Alpha Gaëtan, Yevhen Miroshnychenko, Yvan R P Sortais, Andrew M Lance, Matthew P A Jones, Gaétan Messin, Antoine Browaeys, and Philippe Grangier, “Two-dimensional transport and transfer of a single atomic qubit in optical tweezers,” Nature Physics 3
2007
Earlier work this paper cites.
Robert Parviainen, “Estimation of bond percolation thresholds on the archimedean lattices,” Journal of Physics A: Mathematical and Theoretical 40
2007
Earlier work this paper cites.
Thomas M. Stace, Sean D. Barrett, and Andrew C. Doherty, “Thresholds for topological codes in the presence of loss,” Phys. Rev. Lett. 102
2009
Earlier work this paper cites.
Hans J Briegel, David E Browne, Wolfgang Dür, Robert Raussendorf, and Maarten Van den Nest, “Measurement-based quantum computation,” Nature Physics 5
2009
Earlier work this paper cites.
Sean D. Barrett and Thomas M. Stace, “Fault tolerant quantum computation with very high threshold for loss errors,” Phys. Rev. Lett. 105
2010
Earlier work this paper cites.
Clare Horsman, Austin G Fowler, Simon Devitt, and Rodney Van Meter, “Surface code quantum computing by lattice surgery,” New Journal of Physics 14
2012
Cited alongside, same era.
Austin G Fowler, “Coping with qubit leakage in topological codes,” Physical Review A 88
2013
Cited alongside, same era.
Adam C. Whiteside and Austin G. Fowler, “Upper bound for loss in practical topological-cluster-state quantum computing,” Phys. Rev. A 90
2014
Cited alongside, same era.
Yu Tomita and Krysta M. Svore, “Low-distance surface codes under realistic quantum noise,” Phys. Rev. A 90
2014
Cited alongside, same era.
Ying Li, Peter C. Humphreys, Gabriel J. Mendoza, and Simon C. Benjamin, “Resource costs for fault-tolerant linear optical quantum computing,” Phys. Rev. X 5
2015
Cited alongside, same era.
2021
Later among the works it cites.
Craig Gidney, “Stim: a fast stabilizer circuit simulator,” Quantum 5
2021
Later among the works it cites.
Craig Gidney, Michael Newman, Austin Fowler, and Michael Broughton, “A fault-tolerant honeycomb memory,” Quantum 5
2021
Later among the works it cites.
Christopher Chamberland, Kyungjoo Noh, Patricio Arrangoiz-Arriola, Earl T Campbell, Connor T Hann, Joseph Iverson, Harald Putterman, Thomas C Bohdanowicz, Steven T Flammia, Andrew Keller, et al. , “Building a fault-tolerant quantum computer using concatenated cat codes,” PRX Quantum 3
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Joydip Ghosh and Austin G Fowler, “Leakage-resilient approach to fault-tolerant quantum computing with superconducting elements,” Physical Review A 91
2015
Cited alongside, same era.
Martin Suchara, Andrew W Cross, and Jay M Gambetta, “Leakage suppression in the toric code,” in 2015 IEEE International Symposium on Information Theory (ISIT) (IEEE, 2015) pp. 1119–1123
2015
Cited alongside, same era.
Joel J Wallman and Joseph Emerson, “Noise tailoring for scalable quantum computation via randomized compiling,” Physical Review A 94
2016
Cited alongside, same era.
A Bolt, G Duclos-Cianci, D Poulin, and TM Stace, “Foliated quantum error-correcting codes,” Physical Review Letters 117
2016
Cited alongside, same era.
Manuel Endres, Hannes Bernien, Alexander Keesling, Harry Levine, Eric R Anschuetz, Alexandre Krajenbrink, Crystal Senko, Vladan Vuletic, Markus Greiner, and Mikhail D Lukin, “Atom-by-atom assembly of defect-free one-dimensional cold atom arrays,” Science 354
2016
Cited alongside, same era.
Daniel Barredo, Sylvain de Léséluc, V Lienhard, T Lahaye, and A Browaeys, “An atom-by-atom assembler of defect-free arbitrary two-dimensional atomic arrays,” Science 354
2016
Cited alongside, same era.
Benjamin J. Brown, Katharina Laubscher, Markus S. Kesselring, and James R. Wootton, “Poking holes and cutting corners to achieve clifford gates with the surface code,” Phys. Rev. X 7
2017
Cited alongside, same era.
Iris Cong, Harry Levine, Alexander Keesling, Dolev Bluvstein, Sheng-Tao Wang, and Mikhail D. Lukin, “Hardware-efficient, fault-tolerant quantum computation with Rydberg atoms,” Phys. Rev. X 12
2022
Later among the works it cites.
2022
Later among the works it cites.
Yue Wu, Shimon Kolkowitz, Shruti Puri, and Jeff D Thompson, “Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays,” Nature Communication 13
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
Dolev Bluvstein, Harry Levine, Giulia Semeghini, Tout T. Wang, Sepehr Ebadi, Marcin Kalinowski, Alexander Keesling, Nishad Maskara, Hannes Pichler, Markus Greiner, Vladan Vuletić, and Mikhail D. Lukin, “A quantum processor based on coherent transport of entangled atom arrays,” Nature 604
2022
Later among the works it cites.
T. M. Graham, Y. Song, J. Scott, C. Poole, L. Phuttitarn, K. Jooya, P. Eichler, X. Jiang, A. Marra, B. Grinkemeyer, M. Kwon, M. Ebert, J. Cherek, M. T. Lichtman, M. Gillette, J. Gilbert, D. Bowman, T. Ballance, C. Campbell, E. D. Dahl, O. Crawford, N. S. Blunt, B. Rogers, T. Noel, and M. Saffman, “Multi-qubit entanglement and algorithms on a neutral-atom quantum computer,” Nature 604
2022
Later among the works it cites.
Shuo Ma, Alex P. Burgers, Genyue Liu, Jack Wilson, Bichen Zhang, and Jeff D. Thompson, “Universal gate operations on nuclear spin qubits in an optical tweezer array of Yb 171 {}^{171}\mathrm{Yb} atoms,” Phys. Rev. X 12
2022
Later among the works it cites.
Nathan Schine, Aaron W. Young, William J. Eckner, Michael J. Martin, and Adam M. Kaufman, “Long-lived Bell states in an array of optical clock qubits,” Nature Physics 18
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
Oscar Higgott, “Pymatching: A python package for decoding quantum codes with minimum-weight perfect matching,” ACM Transactions on Quantum Computing 3
2022
Later among the works it cites.
TR Scruby, DE Browne, P Webster, and M Vasmer, “Numerical implementation of just-in-time decoding in novel lattice slices through the three-dimensional surface code,” Quantum 6
2022
Later among the works it cites.
2022
Later among the works it cites.
2023
Closest in time.
Yao Lu, Aniket Maiti, John W. O. Garmon, Suhas Ganjam, Yaxing Zhang, Jahan Claes, Luigi Frunzio, S. M. Girvin, and Robert J. Schoelkopf, “A high-fidelity microwave beamsplitter with a parity-protected converter,” Nature Communications 14, 5767 (2023)
2023
Closest in time.
2023
Closest in time.
Jahan Claes, J Eli Bourassa, and Shruti Puri, “Tailored cluster states with high threshold under biased noise,” npj Quantum Information 9
2023
Closest in time.