Fetching the paper…
Reading the bibliography…
We use a map to quantum error-correcting codes and a subspace projection to get lower bounds for minimal homological distances in a tensor product of two chain complexes of vector spaces over a finite field.
J. Pierpont, Area of curved surfaces, Transactions of the American Mathematical Society 7
1906
Earlier work this paper cites.
R. Gallager, Low-density parity-check codes, IRE Trans. Inf. Theory 8
1962
Earlier work this paper cites.
E. Prange, The use of information sets in decoding cyclic codes, Information Theory, IRE Transactions on 8
1962
Earlier work this paper cites.
R. G. Gallager, Low-Density Parity-Check Codes (M.I.T. Press, Cambridge, Mass., 1963)
1963
Earlier work this paper cites.
S. T. Hedetniemi, Homomorphisms of graphs and automata , Tech. Rep. 03105-44-T (University of Michigan, (1966))
1966
Earlier work this paper cites.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes (North-Holland, Amsterdam, 1981)
1981
Earlier work this paper cites.
L. O. Chua and L. Yang, Cellular neural networks: theory, IEEE Transactions on Circuits and Systems 35
1988
Earlier work this paper cites.
C. A. Weibel, An introduction to homological algebra , Cambridge Studies in Advanced Mathematics, Vol. 38 (Cambridge University Press, Cambridge, 1994)
1994
Earlier work this paper cites.
A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A 54
1996
Earlier work this paper cites.
A. M. Steane, Simple quantum error-correcting codes, Phys. Rev. A 54
1996
Earlier work this paper cites.
P. W. Shor, Fault-tolerant quantum computation, in Proc. 37th Ann. Symp. on Fundamentals of Comp. Sci. , IEEE (IEEE Comp. Soc. Press, Los Alamitos, 1996) pp. 56–65, quant-ph/9605011
1996
Earlier work this paper cites.
S. B. Bravyi and A. Y. Kitaev, Quantum codes on a lattice with boundary, quant-ph/9811052 (1998), unpublished
1998
Earlier work this paper cites.
E. M. Rains and N. J. A. Sloane, Self-dual codes, in Handbook of coding theory , Vol. I, edited by V. S. P. and. W. C. Huffman (North-Holland, Amsterdam, 1998) pp. 177–294
1998
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.
T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, Design of capacity-approaching irregular low-density parity-check codes, Information Theory, IEEE Transactions on 47
2001
Earlier work this paper cites.
A. Ashikhmin and E. Knill, Nonbinary quantum stabilizer codes, IEEE Trans. Info. Th. 47
2001
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, J. Math. Phys. 43
2002
Earlier work this paper cites.
S. Litsyn and V. Shevelev, On ensembles of low-density parity-check codes: asymptotic distance distributions, IEEE Trans. Inf. Theory 48
2002
Earlier work this paper cites.
T. Kaczynski, K. Mischaikow, and M. Mrozek, Computing homology, Homology, Homotopy and Applications 5
2003
Earlier work this paper cites.
A. Y. Kitaev, Fault-tolerant quantum computation by anyons, Ann. Phys. 303
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.
T. Kaczynski, K. Mischaikow, and M. Mrozek, Computational homology , Applied Mathematical Sciences, Vol. 157 (Springer-Verlag, New York, 2004)
2004
Earlier work this paper cites.
D. Poulin, Stabilizer formalism for operator quantum error correction, Phys. Rev. Lett. 95
2005
Earlier work this paper cites.
A. Ketkar, A. Klappenecker, S. Kumar, and P. K. Sarvepalli, Nonbinary stabilizer codes over finite fields, IEEE Trans. Info. Th. 52
2006
Earlier work this paper cites.
D. Bacon, Operator quantum error-correcting subsystems for self-correcting quantum memories, Phys. Rev. A 73
2006
Earlier work this paper cites.
H. Bombin and M. A. Martin-Delgado, Homological error correction: Classical and quantum codes, Journal of Mathematical Physics 48
2007
Cited alongside, same era.
S. S. Bullock and G. K. Brennen, Qudit surface codes and gauge theory with finite cyclic groups, Journal of Physics A: Mathematical and Theoretical 40
2007
Cited alongside, same era.
L. Ioffe and M. Mézard, Asymmetric quantum error-correcting codes, Phys. Rev. A 75
2007
Cited alongside, same era.
2007
Cited alongside, same era.
C. Castelnovo and C. Chamon, Topological order in a three-dimensional toric code at finite temperature, Phys. Rev. B 78
2008
Cited alongside, same era.
A. Ashikhmin, C. Y. Lai, and T. A. Brun, Robust quantum error syndrome extraction by classical coding, in 2014 IEEE International Symposium on Information Theory (2014) pp. 546–550
2014
Later among the works it cites.
D. Gottesman, Stabilizer codes with prime power qudits (2014b), invited talk at QEC 2014 (ETH Zurich)
2014
Later among the works it cites.
2015
Later among the works it cites.
2015
Later among the works it cites.
A. Frolov, An upper bound on the minimum distance of LDPC codes over GF(q), in 2015 IEEE International Symposium on Information Theory (ISIT) (2015) pp. 2885–2888
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. M. Stephens, Z. W. E. Evans, S. J. Devitt, and L. C. L. Hollenberg, Asymmetric quantum error correction via code conversion, Phys. Rev. A 77
2008
Cited alongside, same era.
P. Aliferis and J. Preskill, Fault-tolerant quantum computation against biased noise, Phys. Rev. A 78
2008
Cited alongside, same era.
S. Bravyi and B. Terhal, A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes, New Journal of Physics 11
2009
Cited alongside, same era.
G. Zémor, On Cayley graphs, surface codes, and the limits of homological coding for quantum error correction, in Coding and Cryptology: Second International Workshop, IWCC 2009, Proc. , edited by Y. M. Chee, C. Li, S. Ling, H. Wang, and C. Xing (Springer, Berlin, Heidelberg, 2009) pp. 259–273
2009
Cited alongside, same era.
J.-P. Tillich and G. Zémor, Quantum LDPC codes with positive rate and minimum distance proportional to n \sqrt{n} , in Proc. IEEE Int. Symp. Inf. Theory (ISIT) (2009) pp. 799–803
2009
Cited alongside, same era.
P. K. Sarvepalli, A. Klappenecker, and M. Rötteler, Asymmetric quantum codes: constructions, bounds and performance, Proc. R. Soc. A 465
2009
Cited alongside, same era.
2010
Cited alongside, same era.
2015
Later among the works it cites.
A. Gonzalez-Lorenzo, A. Bac, J.-L. Mari, and P. Real, Two Measures for the Homology Groups of Binary Volumes, in 19th IAPR International Conference on Discrete Geometry for Computer Imagery (DGCI 2016) , Discrete Geometry for Computer Imagery, Vol. 9647, edited by Springer (Nantes, France, 2016) pp. 154–165
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
2017
Later among the works it cites.
Y. Fan and L. Zgang, Galois self-dual constacyclic codes, Designs, Codes and Cryptography 84
2017
Later among the works it cites.
I. Dumer, A. A. Kovalev, and L. P. Pryadko, Distance verification for classical and quantum LDPC codes, IEEE Trans. Inf. Th. 63
2017
Later among the works it cites.
T. K. Dey, T. Li, and Y. Wang, Efficient algorithms for computing a minimal homology basis, in LATIN 2018: Theoretical Informatics , edited by M. A. Bender, M. Farach-Colton, and M. A. Mosteiro (Springer International Publishing, Cham, 2018) pp. 376–398
2018
Later among the works it cites.
D. K. Tuckett, S. D. Bartlett, and S. T. Flammia, Ultrahigh error threshold for surface codes with biased noise, Phys. Rev. Lett. 120
2018
Later among the works it cites.
2018
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
T. J. Yoder, Optimal quantum subsystem codes in 2-dimensions, 1901.06319 (2019), unpublished
2019
Later among the works it cites.
Y. Shitov, Counterexamples to Hedetniemi’s conjecture, arXiv:1905.02167 (2019), unpublished
2019
Later among the works it cites.
G. Kalai, A sensation in the morning news—Yaroslav Shitov: Counterexamples to Hedetniemi’s conjecture, Combinatorics and More (2019)
2019
Later among the works it cites.
2019
Later among the works it cites.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
Y. Jiang, A. A. Kovalev, W. Zeng, and L. P. Pryadko, Quantum codes over ℤ q \mathbb{Z}_{q} and q q -state Potts models (2020), unpublished
2020
Closest in time.