Fetching the paper…
Reading the bibliography…
There has been a rise in decoding quantum error correction codes with neural network based decoders, due to the good decoding performance achieved and adaptability to any noise model.
J. Edmonds, “Paths, trees, and flowers,” Canadian Journal of Mathematics , vol. 17, pp. 449–467, 1965. [Online]. Available: http://dx.doi.org/10.4153/CJM-1965-045-4
1965
Earlier work this paper cites.
D. Gottesman, Stabilizer Codes and Quantum Error Correction . Caltech Ph.D. Thesis, 1997
1997
Earlier work this paper cites.
S. B. Bravyi and A. Y. Kitaev, “Quantum codes on a lattice with boundary,” quant-ph/9811052 , 1998
1998
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information . Cambridge University Press, 2000
2000
Earlier work this paper cites.
M. H. Freedman and D. A. Meyer, “Projective plane and planar quantum codes,” Foundations of Computational Mathematics , vol. 1, no. 3, pp. 325–332, 2001
2001
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” Journal of Mathematical Physics , vol. 43, no. 9, pp. 4452–4505, 2002. [Online]. Available: http://dx.doi.org/10.1063/1.1499754
2002
Earlier work this paper cites.
A. Kitaev, “Fault-tolerant quantum computation by anyons,” Annals of Physics , vol. 303, no. 1, pp. 2 – 30, 2003. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0003491602000180
2003
Earlier work this paper cites.
R. Raussendorf and J. Harrington, “Fault-tolerant quantum computation with high threshold in two dimensions,” Phys. Rev. Lett. , vol. 98, p. 190504, May 2007. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.98.190504
2007
Earlier work this paper cites.
R. Raussendorf, J. Harrington, and K. Goyal, “Topological fault-tolerance in cluster state quantum computation,” New Journal of Physics , vol. 9, no. 6, pp. 199–199, jun 2007. [Online]. Available: https://doi.org/10.1088%2F1367-2630%2F9%2F6%2F199
2007
Earlier work this paper cites.
V. Kolmogorov, “Blossom V: a new implementation of a minimum cost perfect matching algorithm,” Mathematical Programming Computation , vol. 1, pp. 43–67, 2009. [Online]. Available: http://dx.doi.org/10.1007/s12532-009-0002-8
2009
Earlier work this paper cites.
A. G. Fowler, A. M. Stephens, and P. Groszkowski, “High-threshold universal quantum computation on the surface code,” Phys. Rev. A , vol. 80, p. 052312, Nov 2009. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.80.052312
2009
Earlier work this paper cites.
H. Bombin and M. A. Martin-Delgado, “Quantum measurements and gates by code deformation,” Journal of Physics A: Mathematical and Theoretical , vol. 42, no. 9, p. 095302, feb 2009. [Online]. Available: https://doi.org/10.1088%2F1751-8113%2F42%2F9%2F095302
2009
Earlier work this paper cites.
G. Duclos-Cianci and D. Poulin, “A renormalization group decoding algorithm for topological quantum codes,” Information Theory Workshop (ITW), IEEE , pp. 1 – 5, 2010. [Online]. Available: http://dx.doi.org/10.1109/CIG.2010.5592866
2010
Earlier work this paper cites.
D. Poulin and G. Duclos-Cianci, “Fast decoders for topological quantum codes,” Phys. Rev. Lett. , vol. 104, p. 050504, Feb 2010. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.104.050504
2010
Earlier work this paper cites.
S. Bravyi, “Stabilizer subsystem codes with spatially local generators,” IEEE Information Theory Workshop , pp. 1–5, 2010. [Online]. Available: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5592872&isnumber=5592637
2010
Cited alongside, same era.
H. Bombin, “Topological subsystem codes,” Phys. Rev. A , vol. 81, p. 032301, Mar 2010. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.81.032301
2010
Cited alongside, same era.
2011
Cited alongside, same era.
M. Suchara, S. Bravyi, and B. Terhal, “Constructions and noise threshold of topological subsystem codes,” Journal of Physics A: Mathematical and Theoretical , vol. 44, no. 15, p. 155301, 2011. [Online]. Available: http://stacks.iop.org/1751-8121/44/i=15/a=155301
2011
Cited alongside, same era.
A. G. Fowler, “Minimum weight perfect matching of fault-tolerant topological quantum error correction in average o ( 1 ) o(1) parallel time,” Quantum Information & Computation , vol. 15, pp. 145–158, 2015
2015
Later among the works it cites.
M. Herold, E. T. Campbell, J. Eisert, and M. J. Kastoryano, “Cellular-automaton decoders for topological quantum memories,” Npj Quantum Information , vol. 1, 2015. [Online]. Available: https://www.nature.com/articles/npjqi201510
2015
Later among the works it cites.
B. M. Terhal, “Quantum error correction for quantum memories,” Rev. Mod. Phys. , vol. 87, pp. 307–346, Apr 2015. [Online]. Available: https://link.aps.org/doi/10.1103/RevModPhys.87.307
2015
Later among the works it cites.
G. Torlai and R. G. Melko, “Neural decoder for topological codes,” Phys. Rev. Lett. , vol. 119, p. 030501, 7 2017. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.119.030501
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. S. Wang, A. G. Fowler, and L. C. L. Hollenberg, “Surface code quantum computing with error rates over 1%,” Phys. Rev. A , vol. 83, p. 020302, Feb 2011. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.83.020302
2011
Cited alongside, same era.
H. Bombin, “Clifford gates by code deformation,” New Journal of Physics , vol. 13, no. 4, p. 043005, apr 2011. [Online]. Available: https://doi.org/10.1088%2F1367-2630%2F13%2F4%2F043005
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 , vol. 86, p. 032324, Sep 2012. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.86.032324
2012
Cited alongside, same era.
A. G. Fowler, A. C. Whiteside, and L. C. L. Hollenberg, “Towards practical classical processing for the surface code,” Phys. Rev. Lett. , vol. 108, p. 180501, May 2012. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.108.180501
2012
Cited alongside, same era.
C. Horsman, A. G. Fowler, S. Devitt, and R. V. Meter, “Surface code quantum computing by lattice surgery,” New Journal of Physics , vol. 14, no. 12, p. 123011, dec 2012. [Online]. Available: https://doi.org/10.1088%2F1367-2630%2F14%2F12%2F123011
2012
Cited alongside, same era.
——, “Optimal complexity correction of correlated errors in the surface code,” arXiv:1310.0863 , 2013
2013
Cited alongside, same era.
S. Bravyi, G. Duclos-Cianci, D. Poulin, and M. Suchara, “Subsystem surface codes with three-qubit check operators,” Quantum Info. Comput. , vol. 13, no. 11-12, pp. 963–985, Nov. 2013. [Online]. Available: http://dl.acm.org/citation.cfm?id=2535639.2535643
2013
Cited alongside, same era.
S. J. Devitt, W. J. Munro, and K. Nemoto, “Quantum error correction for beginners,” Reports on Progress in Physics , vol. 76, no. 7, p. 076001, jun 2013. [Online]. Available: https://doi.org/10.1088%2F0034-4885%2F76%2F7%2F076001
2013
Cited alongside, same era.
S. Krastanov and L. Jiang, “Deep neural network probabilistic decoder for stabilizer codes,” Scientific Reports , vol. 7, no. 11003, 2017
2017
Later among the works it cites.
P. Baireuther, T. E. O’Brien, B. Tarasinski, and C. W. J. Beenakker, “Machine-learning-assisted correction of correlated qubit errors in a topological code,” Quantum , vol. 2, p. 48, Jan. 2018. [Online]. Available: https://doi.org/10.22331/q-2018-01-29-48
2018
Later among the works it cites.
2018
Later among the works it cites.
X. Ni, “Neural network decoders for large-distance 2d toric codes,” arXiv:1809.06640 , 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
A. S. Darmawan and D. Poulin, “Linear-time general decoding algorithm for the surface code,” Phys. Rev. E , vol. 97, p. 051302, May 2018. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevE.97.051302
2018
Later among the works it cites.
2018
Later among the works it cites.
S. Varsamopoulos, B. Criger, and K. Bertels, “Decoding small surface codes with feedforward neural networks,” Quantum Science and Technology , vol. 3, no. 1, p. 015004, 2018. [Online]. Available: http://stacks.iop.org/2058-9565/3/i=1/a=015004
2058
Closest in time.