Fetching the paper…
Reading the bibliography…
We describe a general method for turning quantum circuits into sparse quantum subsystem codes.
1942
Earlier work this paper cites.
Elliott Lieb, Theodore Schultz, and Daniel Mattis, “Two soluble models of an antiferromagnetic chain,” Ann. Phys. 16
1961
Earlier work this paper cites.
Jeongwan Haah, “Local stabilizer codes in 3d without string logical operators,” Phys. Rev. A 83
1962
Earlier work this paper cites.
C. D. Thompson and H. T. Kung, “Sorting on a mesh-connected parallel computer,” Commun. ACM 20
1977
Earlier work this paper cites.
1983
Earlier work this paper cites.
Bélla Bollobás, “The isoperimetric number of random regular graphs,” European Journal of Combinatorics 9
1988
Earlier work this paper cites.
M. Morgenstern, “Existence and Explicit Constructions of q + 1 q+1 Regular Ramanujan Graphs for Every Prime Power q q ,” Journal of Combinatorial Theory, Series B 62
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.
D. A. Spielman, “Linear-time encodable and decodable error-correcting codes,” IEEE Trans. Info. Theory 42
1996
Earlier work this paper cites.
P. W. Shor, “Fault-tolerant quantum computation,” in FOCS (1996) pp. 56–65, quant-ph/9605011
1996
Earlier work this paper cites.
David P. DiVincenzo and Peter W. Shor, “Fault-tolerant error correction with efficient quantum codes,” Phys. Rev. Lett. 77
1996
Earlier work this paper cites.
A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, “Quantum error correction via codes over G F ( 4 ) GF(4) ,” IEEE Trans. Info. Theory 44
1998
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000)
2000
Earlier work this paper cites.
A. E. Ashikhmin, A. M. Barg, E. Knill, and S. N. Litsyn, “Quantum error detection II: Bounds,” IEEE Trans. Info. Theory 46
2000
Earlier work this paper cites.
Alexei Ashikhmin, Simon Litsyn, and Michael A. Tsfasman, “Asymptotically good quantum codes,” Phys. Rev. A 63
2001
Earlier work this paper cites.
Hao Chen, “Some good quantum error-correcting codes from algebraic-geometric codes,” IEEE Trans. Info. Theory 47
2001
Earlier work this paper cites.
H. Chen, S. Ling, and C. Xing, “Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound,” IEEE Trans. Info. Theory 47
2001
Earlier work this paper cites.
A Yu Kitaev, “Unpaired majorana fermions in quantum wires,” Phys.-Usp. 44
2001
Earlier work this paper cites.
M. Freedman, D. Meyer, and F. Luo, “ ℤ 2 \mathbb{Z}_{2} -systolic freedom and quantum codes,” in Math. of Quantum Computation , edited by Ranee K. Brylinski and Goong Chen (Chapman & Hall/CRC, 2002) pp. 287–320
2002
Earlier work this paper cites.
R. Matsumoto, “Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes,” IEEE Trans. Info. Theory 48
2002
Cited alongside, same era.
D. J. C. MacKay, Information Theory, Inference, and Learning Algorithms (Cambridge University Press, 2003)
2003
Cited alongside, same era.
A. Yu. Kitaev, “Fault-tolerant quantum computation by anyons,” Ann. Phys. 303
2003
Cited alongside, same era.
David Poulin, “Stabilizer formalism for operator quantum error correction,” Phys. Rev. Lett. 95
2005
Cited alongside, same era.
Emanuel Knill, “Quantum computing with realistically noisy devices,” Nature 434
2005
Cited alongside, same era.
Julien Dorier, Federico Becca, and Frédéric Mila, “Quantum compass model on the square lattice,” Phys. Rev. B 72
2011
Later among the works it cites.
2011
Later among the works it cites.
2011
Later among the works it cites.
Sergey Bravyi, “Subsystem codes with spatially local generators,” Phys. Rev. A 83
2011
Later among the works it cites.
Ethan Fetaya, “Bounding the distance of quantum surface codes,” J. Math. Phys. 53
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2005
Cited alongside, same era.
David W. Kribs, Raymond Laflamme, David Poulin, and Maia Lesosky, “Operator quantum error correction,” Quant. Inf. Comp. 6
2006
Cited alongside, same era.
Dave Bacon, “Operator quantum error-correcting subsystems for self-correcting quantum memories,” Phys. Rev. A 73
2006
Cited alongside, same era.
S. Hoory, N. Linial, and A. Wigderson, “Expander graphs and their applications,” Bulletin of the American Mathematical Society 43
2006
Cited alongside, same era.
R. Raussendorf and J. Harrington, “Fault-tolerant quantum computation with high threshold in two dimensions,” Phys. Rev. Lett. 98
2007
Cited alongside, same era.
Panos Aliferis and Andrew W. Cross, “Subsystem fault tolerance with the Bacon-Shor code,” Phys. Rev. Lett. 98
2007
Cited alongside, same era.
I. H. Kim, Quantum codes on Hurwitz surfaces , Master’s thesis , Massachusetts Institute of Technology (2007)
2007
Cited alongside, same era.
2012
Later among the works it cites.
2012
Later among the works it cites.
2013
Later among the works it cites.
2013
Later among the works it cites.
2013
Later among the works it cites.
2013
Later among the works it cites.
Daniel Gottesman, “Fault-tolerant quantum computation with constant overhead,” Quant. Inf. Comp. 14
2014
Closest in time.
2014
Closest in time.
2014
Closest in time.
2014
Closest in time.
2014
Closest in time.
Barbara M. Terhal, “Quantum error correction for quantum memories,” Rev. Mod. Phys. 87
2015
Closest in time.
2015
Closest in time.
Jeongwan Haah, (2015), personal communication
2015
Closest in time.