Fetching the paper…
Reading the bibliography…
Bias-tailoring allows quantum error correction codes to exploit qubit noise asymmetry.
Claude Elwood Shannon, A mathematical theory of communication, Bell System Technical Journal 27
1948
Earlier work this paper cites.
Robert Gallager, Low-density parity-check codes, IRE Transactions on Information Theory 8
1962
Earlier work this paper cites.
Jack Edmonds, Paths, trees, and flowers, Canadian Journal of Mathematics 17
1965
Earlier work this paper cites.
Peter W. Shor, Scheme for reducing decoherence in quantum computer memory, Physical Review A 52
1995
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.
A. Steane, Error correcting codes in quantum theory, Phys. Rev. Lett. 77
1996
Earlier work this paper cites.
Claude Berrou and Alain Glavieux, Near optimum error correcting coding and decoding: Turbo-codes, IEEE Transactions on Communications 44
1996
Earlier work this paper cites.
Charles H. Bennett, David P. DiVincenzo, John A. Smolin, and William K. Wootters, Mixed-state entanglement and quantum error correction, Phys. Rev. A 54
1996
Earlier work this paper cites.
1996
Earlier work this paper cites.
A. M. Steane, Active stabilization, quantum computation, and quantum state synthesis, Physical Review Letters 78
1997
Earlier work this paper cites.
David JC MacKay and Radford M Neal, Near shannon limit performance of low density parity check codes, Electronics Letters 33
1997
Earlier work this paper cites.
David P. DiVincenzo, Peter W. Shor, and John A. Smolin, Quantum-channel capacity of very noisy channels, Phys. Rev. A 57
1998
Earlier work this paper cites.
Frank R Kschischang, Brendan J Frey, Hans-Andrea Loeliger, et al. , Factor graphs and the sum-product algorithm, IEEE Transactions on Information Theory 47
2001
Earlier work this paper cites.
Xiao-Yu Hu, E. Eleftheriou, and D.-M. Arnold, Progressive edge-growth tanner graphs, in IEEE Global Telecommunications Conference , Vol. 2 (2001) pp. 995–1001 vol.2
2001
Earlier work this paper cites.
Marc PC Fossorier, Iterative reliability-based decoding of low-density parity check codes, IEEE Journal on Selected Areas in Communications 19
2001
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.
Xiao-Gang Wen, Quantum orders in an exact soluble model, Phys. Rev. Lett. 90
2003
Earlier work this paper cites.
Marc PC Fossorier, Quasicyclic low-density parity-check codes from circulant permutation matrices, IEEE Transactions on Information Theory 50
2004
Earlier work this paper cites.
2004
Earlier work this paper cites.
J. D. Hunter, Matplotlib: A 2d graphics environment, Computing in Science & Engineering 9
2007
Earlier work this paper cites.
P Aliferis, F Brito, D P DiVincenzo, J Preskill, M Steffen, and B M Terhal, Fault-tolerant computing with biased-noise superconducting qubits: a case study, New Journal of Physics 11
2009
Earlier work this paper cites.
Lindsay N Childs, A concrete introduction to higher algebra (Springer, 2009)
2009
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.
Erdal Arikan, Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels, IEEE Transactions on Information Theory 55
2009
Earlier work this paper cites.
Sergey Bravyi, David Poulin, and Barbara Terhal, Tradeoffs for reliable quantum information storage in 2d systems, Physical review letters 104
2010
Earlier work this paper cites.
Stéfan van der Walt, S Chris Colbert, and Gael Varoquaux, The numpy array: a structure for efficient numerical computation, Computing in Science & Engineering 13
2011
Earlier work this paper cites.
2012
Cited alongside, same era.
Alexey A. Kovalev and Leonid P. Pryadko, Improved quantum hypergraph-product LDPC codes, in IEEE International Symposium on Information Theory Proceedings (2012) pp. 348–352
2012
Cited alongside, same era.
Héctor Bombin, Ruben S Andrist, Masayuki Ohzeki, Helmut G Katzgraber, and Miguel A Martin-Delgado, Strong resilience of topological codes to depolarization, Physical Review X 2
2012
Cited alongside, same era.
Radford M. Neal, Software for low density parity check codes, (2012) , http://radfordneal.github.io/{LDPC}-codes/
2012
Cited alongside, same era.
2021
Later among the works it cites.
2021
Later among the works it cites.
Matthew B Hastings, Jeongwan Haah, and Ryan O’Donnell, Fiber bundle codes: breaking the n 1/2 polylog (n) barrier for quantum LDPC codes, in Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (2021) pp. 1276–1288
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.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Abbas Al-Shimary, James R Wootton, and Jiannis K Pachos, Lifetime of topological quantum memories in thermal environment, New Journal of Physics 15
2013
Cited alongside, same era.
Jean-Pierre Tillich and Gilles Zémor, Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength, IEEE Transactions on Information Theory 60
2013
Cited alongside, same era.
Georgios Tzimpragos, Christoforos Kachris, Ivan B Djordjevic, Milorad Cvijetic, Dimitrios Soudris, and Ioannis Tomkos, A survey on fec codes for 100 g and beyond optical networks, IEEE Communications Surveys & Tutorials 18
2014
Cited alongside, same era.
Héctor Bombín, Single-shot fault-tolerant quantum error correction, Physical Review X 5
2015
Cited alongside, same era.
S. Debnath, N. M. Linke, C. Figgatt, K. A. Landsman, K. Wright, and C. Monroe, Demonstration of a small programmable quantum computer with atomic qubits, Nature 536
2016
Cited alongside, same era.
Maika Takita, Andrew W. Cross, A.D. Córcoles, Jerry M. Chow, and Jay M. Gambetta, Experimental demonstration of fault-tolerant state preparation with superconducting qubits, Physical Review Letters 119
2017
Cited alongside, same era.
Ben Criger and Imran Ashraf, Multi-path Summation for Decoding 2D Topological Codes, Quantum 2
2018
Cited alongside, same era.
Joschka Roffe, Quantum error correction: an introductory guide, Contemporary Physics 60
2019
Cited alongside, same era.
Armanda O. Quintavalle, Michael Vasmer, Joschka Roffe, and Earl T. Campbell, Single-shot error correction of three-dimensional homological product codes, PRX Quantum 2
2021
Later among the works it cites.
Andrew S. Darmawan, Benjamin J. Brown, Arne L. Grimsmo, David K. Tuckett, and Shruti Puri, Practical quantum error correction with the XZZX code and kerr-cat qubits, PRX Quantum 2
2021
Later among the works it cites.
Javier Valls, Francisco Garcia-Herrero, Nithin Raveendran, and Bane Vasić, Syndrome-based min-sum vs osd-0 decoders: Fpga implementation and analysis for quantum ldpc codes, IEEE Access 9
2021
Later among the works it cites.
Nouédyn Baspin and Anirudh Krishna, Connectivity constrains quantum codes, Quantum 6
2022
Closest in time.
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 , STOC 2022 (Association for Computing Machinery, New York, NY, USA, 2022) p. 375–388
2022
Closest in time.
Armanda O. Quintavalle and Earl T. Campbell, Reshape: A decoder for hypergraph product codes, IEEE Transactions on Information Theory 68
2022
Closest in time.
Oscar Higgott, Pymatching: A python package for decoding quantum codes with minimum-weight perfect matching, ACM Transactions on Quantum Computing 3
2022
Closest in time.
Joschka Roffe, LDPC: Python tools for low density parity check codes, https://pypi.org/project/ldpc/ (2022)
2022
Closest in time.
Arpit Dua, Aleksander Kubica, Liang Jiang, Steven T. Flammia, and Michael J. Gullans, Clifford-deformed surface codes, (2022), 10.48550/ARXIV.2201.07802
2022
Closest in time.
Konstantin Tiurev, Peter-Jan H. S. Derks, Joschka Roffe, Jens Eisert, and Jan-Michael Reiner, Correcting non-independent and non-identically distributed errors with surface codes, (2022), 10.48550/ARXIV.2208.02191
2022
Closest in time.
Eric Huang, Arthur Pesah, Christopher T. Chubb, Michael Vasmer, and Arpit Dua, Tailoring three-dimensional topological codes for biased noise, (2022)
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
Nicolas Delfosse, Vivien Londe, and Michael E. Beverland, Toward a union-find decoder for quantum ldpc codes, IEEE Transactions on Information Theory 68
2022
Closest in time.
2022
Closest in time.
Julien Du Crest, Mehdi Mhalla, and Valentin Savin, Stabilizer inactivation for message-passing decoding of quantum ldpc codes, in 2022 IEEE Information Theory Workshop (ITW) (2022) pp. 488–493
2022
Closest in time.
Kao-Yueh Kuo and Ching-Yi Lai, Exploiting degeneracy in belief propagation decoding of quantum codes, npj Quantum Information 8
2022
Closest in time.
2023
Closest in time.
Lucas Berent, Lukas Burgholzer, and Robert Wille, Software tools for decoding quantum low-density parity-check codes, in Proceedings of the 28th Asia and South Pacific Design Automation Conference , ASPDAC ’23 (Association for Computing Machinery, New York, NY, USA, 2023) p. 709–714
2023
Closest in time.
2023
Closest in time.
Earl Campbell, A theory of single-shot error correction for adversarial noise, Quantum Science and Technology (2019), 10.1088/2058-9565/aafc8f
2058
Closest in time.