Fetching the paper…
Reading the bibliography…
Universal fault-tolerant quantum computation will require real-time decoding algorithms capable of quickly extracting logical outcomes from the stream of data generated by noisy quantum hardware.
A Yu Kitaev, “Quantum error correction with imperfect gates,” in Quantum Communication, Computing, and Measurement (Springer, 1997) pp. 181–188
1997
Earlier work this paper cites.
John Preskill, “Lecture notes for physics 219: Quantum computation,” Caltech Lecture Notes (1999)
1999
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.
A Yu Kitaev, “Fault-tolerant quantum computation by anyons,” Annals of Physics 303
2003
Earlier work this paper cites.
Panos Aliferis, Daniel Gottesman, and John Preskill, “Quantum accuracy threshold for concatenated distance-3 codes,” arXiv preprint quant-ph/0504218 (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.
Simon Perdrix and Philippe Jorrand, “Classically controlled quantum computation,” Mathematical Structures in Computer Science 16
2006
Earlier work this paper cites.
Alexei Kitaev, “Anyons in an exactly solved model and beyond,” Annals of Physics 321
2006
Earlier work this paper cites.
Robert Raussendorf, Jim Harrington, and Kovid Goyal, “Topological fault-tolerance in cluster state quantum computation,” New Journal of Physics 9
2007
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.
H Bombin and MA Martin-Delgado, “Exact topological quantum order in d= 3 and beyond: Branyons and brane-net condensates,” Physical Review B 75
2007
Earlier work this paper cites.
Ken Matsumoto and Kazuyuki Amano, “Representation of quantum circuits with clifford and π / 8 \pi/8 gates,” (2008), 10.48550/arxiv.0806.3834
2008
Earlier work this paper cites.
Bob Coecke and Ross Duncan, “Interacting quantum observables,” in International Colloquium on Automata, Languages, and Programming (Springer, 2008) pp. 298–310
2008
Earlier work this paper cites.
Vladimir Kolmogorov, “Blossom v: a new implementation of a minimum cost perfect matching algorithm,” Mathematical Programming Computation 1
2009
Earlier work this paper cites.
Héctor Bombín and Miguel Angel Martin-Delgado, “Quantum measurements and gates by code deformation,” Journal of Physics A: Mathematical and Theoretical 42
2009
Earlier work this paper cites.
Héctor Bombín, “Topological order with a twist: Ising anyons from an abelian model,” Physical review letters 105
2010
Earlier work this paper cites.
M Kargarian, H Bombin, and MA Martin-Delgado, “Topological color codes and two-body quantum lattice hamiltonians,” New Journal of Physics 12
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
Earlier work this paper cites.
Austin G Fowler, Matteo Mariantoni, John M Martinis, and Andrew N Cleland, “Surface codes: Towards practical large-scale quantum computation,” Physical Review A 86
2012
Earlier work this paper cites.
Hector Bombin, Guillaume Duclos-Cianci, and David Poulin, “Universal topological phase of two-dimensional stabilizer codes,” New Journal of Physics 14
2012
Earlier work this paper cites.
Brett Giles and Peter Selinger, “Remarks on matsumoto and amano’s normal form for single-qubit clifford+t operators,” (2013)
2013
Earlier work this paper cites.
Maissam Barkeshli, Chao-Ming Jian, and Xiao-Liang Qi, “Twist defects and projective non-abelian braiding statistics,” Physical Review B 87
2013
Cited alongside, same era.
Michael Levin, “Protected edge modes without symmetry,” Physical Review X 3
2013
Cited alongside, same era.
2013
Cited alongside, same era.
Alexey A Kovalev and Leonid P Pryadko, “Fault tolerance of quantum low-density parity check codes with sublinear distance scaling,” Physical Review A 87
2013
Cited alongside, same era.
Austin Fowler, “Minimum weight perfect matching of fault-tolerant topological quantum error correction in average o(1) parallel time,” Quantum Information and Computation 15
2014
Niel de Beaudrap and Dominic Horsman, “The zx calculus is a language for surface code lattice surgery,” Quantum 4
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Sergey Bravyi, Martin Suchara, and Alexander Vargo, “Efficient algorithms for maximum likelihood decoding in the surface code,” Physical Review A 90
2014
Cited alongside, same era.
Barbara M Terhal, “Quantum error correction for quantum memories,” Reviews of Modern Physics 87
2015
Cited alongside, same era.
Aleksander Kubica, Beni Yoshida, and Fernando Pastawski, “Unfolding the color code,” New Journal of Physics 17
2015
Cited alongside, same era.
Neil J Ross and Peter Selinger, “Optimal ancilla-free clifford+ t approximation of z-rotations.” Quantum Inf. Comput. 16
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.
Héctor Bombín, “Dimensional jump in quantum error correction,” New Journal of Physics 18
2016
Cited alongside, same era.
2017
Cited alongside, same era.
2020
Later among the works it cites.
Joschka Roffe, David R White, Simon Burton, and Earl Campbell, “Decoding across the quantum low-density parity-check code landscape,” Physical Review Research 2
2020
Later among the works it cites.
Matthew B Hastings and Jeongwan Haah, “Dynamically generated logical qubits,” Quantum 5
2021
Later among the works it cites.
Nicolas Delfosse and Naomi H. Nickerson, “Almost-linear time decoding algorithm for topological codes,” Quantum 5
2021
Later among the works it cites.
Pavel Panteleev and Gleb Kalachev, “Degenerate quantum ldpc codes with good finite length performance,” Quantum 5
2021
Later among the works it cites.
Nikolas P Breuckmann and Jens Niklas Eberhardt, “Quantum low-density parity-check codes,” PRX Quantum 2
2021
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.
Isaac H. Kim, Ye-Hua Liu, Sam Pallister, William Pol, Sam Roberts, and Eunseok Lee, “Fault-tolerant resource estimate for quantum chemical simulations: Case study on li-ion battery electrolyte molecules,” Phys. Rev. Research 4
2022
Later among the works it cites.
2022
Later among the works it cites.
Pavel Panteleev and Gleb Kalachev, “Asymptotically good quantum and locally testable classical ldpc codes,” in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (2022) pp. 375–388
2022
Later among the works it cites.
Nouédyn Baspin and Anirudh Krishna, “Connectivity constrains quantum codes,” Quantum 6
2022
Later among the works it cites.
Sara Bartolucci, Patrick Birchall, Hector Bombin, Hugo Cable, Chris Dawson, Mercedes Gimeno-Segovia, Eric Johnston, Konrad Kieling, Naomi Nickerson, Mihir Pant, et al. , “Fusion-based quantum computation,” Nature Communications 14
2023
Closest in time.