Fetching the paper…
Reading the bibliography…
In this article we address the computational hardness of optimally decoding a quantum stabilizer code.
C. E. Shannon, “A mathematical theory of communication”, Bell System Tech
1948
Earlier work this paper cites.
E. Berlekamp, R. McEliece, and H. van Tilborg, “On the inherent intractability of certain coding problems (corresp.)”, Information Theory, IEEE Transactions on
1978
Earlier work this paper cites.
L. G. Valiant, “The complexity of enumeration and reliability problems”, SIAM Journal on Computing
1979
Earlier work this paper cites.
McGraw-Hill series in systems science, Aegean Park Press, 1984
E. Berlekamp, Algebraic Coding Theory · 1984
Earlier work this paper cites.
S. Toda, “PP is as hard as the polynomial-time hierarchy”, SIAM Journal on Computing
1991
Earlier work this paper cites.
P. W. Shor, “Scheme for reducing decoherence in quantum computer memory”, Phys. Rev. A
1995
Earlier work this paper cites.
A. Vardy, “The intractability of computing the minimum distance of a code”, IEEE Transactions on Information Theory
1997
Earlier work this paper cites.
PhD thesis, California Institute of Technology, 1997
D. Gottesman, Stabilizer codes and quantum error correction · 1997
Earlier work this paper cites.
A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, “Quantum error correction and orthogonal geometry”, Phys. Rev. Lett
1997
Earlier work this paper cites.
A. Barg, “Complexity issues in coding theory”, 1997
1997
Earlier work this paper cites.
J. Preskill, “Quantum Error Correction”, Ch.7, Lecture notes for physics 229: Quantum information and computation, 1998
1998
Earlier work this paper cites.
Cambridge Series on Information and the Natural Sciences, Cambridge University Press, 2000
M. Nielsen and I. Chuang, Quantum Computation and Quantum Information · 2000
Earlier work this paper cites.
S. Aji and R. McEliece, “The generalized distributive law”, IEEE Transactions on Information Theory
2000
Earlier work this paper cites.
A. Ashikhmin, A. Barg, E. Knill, and S. Litsyn, “Quantum error detection .II. bounds”, IEEE Transactions on Information Theory
2000
Cited alongside, same era.
M. Freedman and D. Meyer, “Projective plane and planar quantum codes”, Found. Comp. Math
2001
Cited alongside, same era.
A. Honecker, M. Picco, and P. Pujol, “Nishimori point in the 2D ± J \displaystyle\pm{J} random-bond Ising model”, Phys. Rev. Lett
2001
Cited alongside, same era.
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
2003
Cited alongside, same era.
M.N.Vyalyi, “Hardness of approximating the weight enumerator of a binary linear code”, 2003
2003
Cited alongside, same era.
Cambridge University Press, 2009
S. Arora and B. Barak, Computational Complexity: A Modern Approach · 2009
Later among the works it cites.
G. Duclos-Cianci and D. Poulin, “Fast decoders for topological quantum codes”, Phys. Rev. Lett
2010
Later among the works it cites.
M.-H. Hsieh and F. Le Gall, “NP-hardness of decoding quantum error-correction codes”, Phys. Rev. A
2011
Later among the works it cites.
PhD thesis, Ecole Normale de Lyon and City University of hong Kong, 2011
I. Briquel, Complexity issues in counting, polynomial calculation and zero finding · 2011
Later among the works it cites.
K.-Y. Kuo and C.-C. Lu, “On the hardness of decoding quantum stabilizer codes under the depolarizing channel”, in Information Theory and its Applications (ISITA), 2012 International Symposium on
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Y. Kitaev, “Fault-tolerant quantum computation by anyons”, Ann. Phys
2003
Cited alongside, same era.
D. J. C. MacKay, G. Mitchison, and P. L. McFadden, “Sparse graph codes for quantum error-correction”, IEEE Trans. Info. Theor
2004
Cited alongside, same era.
D. Poulin, “Optimal and efficient decoding of concatenated quantum block codes”, Physical Review A
2006
Cited alongside, same era.
T. Camara, H. Ollivier, and J.-P. Tillich, “A class of quantum LDPC codes: construction and performances under iterative decoding”, in ISIT
2007
Cited alongside, same era.
G. Smith and J. A. Smolin, “Degenerate coding for Pauli channels”, Phys. Rev. Lett
2007
Cited alongside, same era.
D. Poulin and Y. Chung, “On the iterative decoding of sparse quantum codes”, Quantum Information and Computation
2008
Cited alongside, same era.
J.-P. Tillich and G. Zemor, “Quantum LDPC codes with positive rate and minimum distance proportional to n \displaystyle\sqrt{n} ”, in IEEE International Symposium on Information Theory, 2009. ISIT 2009
2009
Cited alongside, same era.
H. Bombin, R. S. Andrist, M. Ohzeki, H. G. Katzgraber, and M. A. Martin-Delgado, “Strong resilience of topological codes to depolarization”, Physical Review X
2012
Later among the works it cites.
Technical University of Denmark, 2012
K. B. Petersen and M. S. Pedersen, The Matrix Cookbook · 2012
Later among the works it cites.
J. Haah and J. Preskill, “Logical operator tradeoff for local quantum codes”, Phys. Rev. A
2012
Later among the works it cites.
N. E. Bonesteel and D. P. DiVincenzo, “Quantum circuits for measuring Levin-Wen operators”, Physical Review B
2012
Later among the works it cites.
E. Pelchat and D. Poulin, “Degenerate Viterbi decoding”, IEEE Transactions on Information Theory
2013
Closest in time.
K.-Y. Kuo and C.-C. Lu, “On the hardnesses of several quantum decoding problems”, 2013
2013
Closest in time.
J. Napp and J. Preskill, “Optimal Bacon-Shor codes”, Quantum Information and Computation
2013
Closest in time.
O. Landon-Cardinal and D. Poulin, “Local topological order inhibits thermal stability in 2D”, Phys. Rev. Lett
2013
Closest in time.