Fetching the paper…
Reading the bibliography…
We introduce a morphing procedure that can be used to generate new quantum codes from existing quantum codes.
1901
Earlier work this paper cites.
1905
Earlier work this paper cites.
D. Litinski, Magic State Distillation: Not as Costly as You Think, Quantum 3
1905
Earlier work this paper cites.
C. Vuillot and N. P. Breuckmann, Quantum Pin Codes, arXiv preprint (2019), arXiv:1906.11394
1906
Earlier work this paper cites.
1911
Earlier work this paper cites.
H. S. M. Coxeter, Regular Polytopes (Dover, New York, 1973)
1973
Earlier work this paper cites.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes , North-Holland Mathematical Library ; v. 16 (North-Holland Pub. Co., Amsterdam, 1977)
1977
Earlier work this paper cites.
J. E. Humphreys, Reflection Groups and Coxeter Groups , 1st ed. (Cambridge University Press, 1990)
1990
Earlier work this paper cites.
A. M. Steane, Multiple-particle interference and quantum error correction, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 452
1996
Earlier work this paper cites.
A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Physical Review A 54
1996
Earlier work this paper cites.
D. Gottesman, Stabilizer Codes and Quantum Error Correction, arXiv preprint (1997), arXiv:quant-ph/9705052
1997
Earlier work this paper cites.
A. Y. Kitaev, Quantum Error Correction with Imperfect Gates, in Quantum Communication, Computing, and Measurement , edited by O. Hirota, A. S. Holevo, and C. M. Caves (Springer US, Boston, MA, 1997) pp. 181–188
1997
Earlier work this paper cites.
E. Knill, R. Laflamme, and W. H. Zurek, Resilient Quantum Computation, Science 279
1998
Earlier work this paper cites.
A. Steane, Quantum Reed-Muller codes, IEEE Transactions on Information Theory 45
1999
Earlier work this paper cites.
A. Honecker, M. Picco, and P. Pujol, Universality Class of the Nishimori Point in the 2D $\pm J$ Random-Bond Ising Model, Physical Review Letters 87
2001
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, Journal of Mathematical Physics 43
2002
Earlier work this paper cites.
F. Merz and J. T. Chalker, Two-dimensional random-bond Ising model, free fermions, and the network model, Physical Review B 65
2002
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.
A. Y. Kitaev, Fault-tolerant quantum computation by anyons, Annals of Physics 303
2003
Earlier work this paper cites.
E. Knill, Fault-Tolerant Postselected Quantum Computation: Schemes, arXiv preprint (2004), arXiv:quant-ph/0402171
2004
Earlier work this paper cites.
J. Harrington, Analysis of Quantum Error-Correcting Codes Symplectic Lattice Codes and Toric Codes , Ph.D. thesis , Caltech (2004)
2004
Earlier work this paper cites.
S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, Physical Review A 71
2005
Earlier work this paper cites.
E. Knill, Quantum computing with realistically noisy devices, Nature 434
2005
Earlier work this paper cites.
D. Poulin, Stabilizer Formalism for Operator Quantum Error Correction, Physical Review Letters 95
2005
Earlier work this paper cites.
H. Bombín and M. A. Martin-Delgado, Topological Quantum Distillation, Physical Review Letters 97
2006
Earlier work this paper cites.
R. Raussendorf and J. Harrington, Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions, Physical Review Letters 98
2007
Earlier work this paper cites.
G. Vidal, Entanglement renormalization, Phys. Rev. Lett. 99
2007
Earlier work this paper cites.
D. Aharonov and M. Ben-Or, Fault-Tolerant Quantum Computation with Constant Error Rate, SIAM Journal on Computing 38
2008
Cited alongside, same era.
M. Davis, The Geometry and Topology of Coxeter Groups , London Mathematical Society Monographs Series (Princeton University Press, Princeton, 2008)
2008
Cited alongside, same era.
2009
Cited alongside, same era.
V. Kolmogorov, Blossom V: A new implementation of a minimum cost perfect matching algorithm, Mathematical Programming Computation 1
2009
Cited alongside, same era.
B. J. Brown, N. H. Nickerson, and D. E. Browne, Fault-tolerant error correction with the gauge color code, Nature Communications 7
2016
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
H. Poulsen Nautrup, N. Friis, and H. J. Briegel, Fault-tolerant interface between quantum memories and quantum processors, Nature Communications 8
2017
Later among the works it cites.
N. P. Breuckmann, C. Vuillot, E. Campbell, A. Krishna, and B. M. Terhal, Hyperbolic and semi-hyperbolic surface codes for quantum storage, Quantum Science and Technology 2
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2009
Cited alongside, same era.
H. G. Katzgraber, H. Bombín, and M. A. Martin-Delgado, Error Threshold for Color Codes and Random Three-Body Ising Models, Physical Review Letters 103
2009
Cited alongside, same era.
2009
Cited alongside, same era.
2010
Cited alongside, same era.
2010
Cited alongside, same era.
H. Bombín, Topological Order with a Twist: Ising Anyons from an Abelian Model, Physical Review Letters 105
2010
Cited alongside, same era.
2012
Cited alongside, same era.
S. Bravyi and J. Haah, Magic-state distillation with low overhead, Physical Review A 86
2012
Cited alongside, same era.
2017
Later among the works it cites.
O. Fawzi, A. Grospellier, and A. Leverrier, Constant Overhead Quantum Fault-Tolerance with Quantum Expander Codes, in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, Paris, 2018) pp. 743–754
2018
Later among the works it cites.
A. M. Kubica, The ABCs of the Color Code: A Study of Topological Quantum Codes as Toy Models for Fault-Tolerant Quantum Computation and Quantum Phases of Matter , Ph.D. thesis , Caltech (2018)
2018
Later among the works it cites.
M. B. Hastings and J. Haah, Distillation with Sublogarithmic Overhead, Physical Review Letters 120
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.
2018
Later among the works it cites.
2019
Later among the works it cites.
M. Vasmer and D. E. Browne, Three-dimensional surface codes: Transversal gates and fault-tolerant architectures, Physical Review A 100
2019
Later among the works it cites.
2019
Later among the works it cites.
A. Krishna and J.-P. Tillich, Towards Low Overhead Magic State Distillation, Physical Review Letters 123
2019
Later among the works it cites.
M. Vasmer, Fault-Tolerant Quantum Computing with Three-Dimensional Surface Codes , Ph.D. thesis , University College London (2019)
2019
Later among the works it cites.
C. K. Andersen, A. Remm, S. Lazar, S. Krinner, N. Lacroix, G. J. Norris, M. Gabureac, C. Eichler, and A. Wallraff, Repeated quantum error detection in a surface code, Nature Physics 16
2020
Later among the works it cites.
J. K. Iverson, Aspects of Fault-Tolerant Quantum Computation , Ph.D. thesis , Caltech (2020)
2020
Later among the works it cites.
2021
Closest in time.
M. E. Beverland, A. Kubica, and K. M. Svore, Cost of Universality: A Comparative Study of the Overhead of State Distillation and Code Switching with Color Codes, PRX Quantum 2
2021
Closest in time.
A. Erhard, H. Poulsen Nautrup, M. Meth, L. Postler, R. Stricker, M. Stadler, V. Negnevitsky, M. Ringbauer, P. Schindler, H. J. Briegel, R. Blatt, N. Friis, and T. Monz, Entangling logical qubits with lattice surgery, Nature 589
2021
Closest in time.
E. T. Campbell, The smallest interesting colour code, https://earltcampbell.com/2016/09/26/the-smallest-interesting-colour-code/ (2016), accessed: 2021-07-20
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
2022
Closest in time.
J. Iverson and A. Kubica, (2022), in preparation
2022
Closest in time.