Fetching the paper…
Reading the bibliography…
The typical model for measurement noise in quantum error correction is to randomly flip the binary measurement outcome.
J. Edmonds, Paths, trees, and flowers, Canadian Journal of mathematics 17
1965
Earlier work this paper cites.
C. Berge, Graphs and hypergraphs (North-Holland Pub. Co., 1973)
1973
Earlier work this paper cites.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman & Co., USA, 1979)
1979
Earlier work this paper cites.
V. V. Vazirani, A theory of alternating paths and blossoms for proving correctness of the O ( V E ) {O}(\sqrt{V}{E}) general graph maximum matching algorithm, Combinatorica 14
1994
Earlier work this paper cites.
P. Shor, Fault-tolerant quantum computation, in Proceedings of 37th Conference on Foundations of Computer Science (1996) pp. 56–65
1996
Earlier work this paper cites.
W. Cook and A. Rohe, Computing minimum-weight perfect matchings, INFORMS journal on computing 11
1999
Earlier work this paper cites.
D. Gottesman, A. Kitaev, and J. Preskill, Encoding a qubit in an oscillator, Physical Review A 64
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.
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. Blais, R.-S. Huang, A. Wallraff, S. M. Girvin, and R. J. Schoelkopf, Cavity quantum electrodynamics for superconducting electrical circuits: An architecture for quantum computation, Phys. Rev. A 69
2004
Earlier work this paper cites.
H. Bombin 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.
D. J. Costello and G. D. Forney, Channel coding: The road to channel capacity, Proceedings of the IEEE 95
2007
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
Earlier work this paper cites.
J. Gambetta, W. A. Braff, A. Wallraff, S. M. Girvin, and R. J. Schoelkopf, Protocols for optimal readout of qubits using a continuous quantum nondemolition measurement, Phys. Rev. A 76
2007
Earlier work this paper cites.
K. M. Svore, D. P. Divincenzo, and B. M. Terhal, Noise threshold for a fault-tolerant two-dimensional lattice architecture, Quantum Info. Comput. 7
2007
Earlier work this paper cites.
J. Gambetta, A. Blais, M. Boissonneault, A. A. Houck, D. I. Schuster, and S. M. Girvin, Quantum trajectory approach to circuit qed: Quantum jumps and the zeno effect, Phys. Rev. A 77
2008
Cited alongside, same era.
A. G. Fowler, A. M. Stephens, and P. Groszkowski, High-threshold universal quantum computation on the surface code, Physical Review A 80
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.
J. Wang, T. Courtade, H. Shankar, and R. D. Wesel, Soft information for LDPC decoding in flash: Mutual-information optimized quantization, in 2011 IEEE Global Telecommunications Conference-GLOBECOM 2011 (IEEE, 2011) pp. 1–6
2011
Cited alongside, same era.
M. Nielsen and I. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, 2011)
D. Litinski, A game of surface codes: Large-scale quantum computing with lattice surgery, Quantum 3
2019
Later among the works it cites.
A. Crippa, R. Ezzouch, A. Aprá, A. Amisse, R. Laviéville, L. Hutin, B. Bertrand, M. Vinet, M. Urdampilleta, T. Meunier, M. Sanquer, X. Jehl, R. Maurand, and S. De Franceschi, Gate-reflectometry dispersive readout and coherent control of a spin qubit in silicon, Nature Communications 10
2019
Later among the works it cites.
K. Noh and C. Chamberland, Fault-tolerant bosonic quantum error correction with the surface–Gottesman-Kitaev-Preskill code, Physical Review A 101
2020
Later among the works it cites.
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Physical Review A 86
2012
Cited alongside, same era.
J. I. Colless, A. C. Mahoney, J. M. Hornibrook, A. C. Doherty, H. Lu, A. C. Gossard, and D. J. Reilly, Dispersive readout of a few-electron double quantum dot with fast rf gate sensors, Phys. Rev. Lett. 110
2013
Cited alongside, same era.
A. Gelman, J. B. Carlin, H. S. Stern, D. B. Dunson, A. Vehtari, and D. B. Rubin, Bayesian data analysis (CRC press, 2013)
2013
Cited alongside, same era.
N. Delfosse, Decoding color codes by projection onto surface codes, Physical Review A 89
2014
Cited alongside, same era.
Y. Tomita and K. M. Svore, Low-distance surface codes under realistic quantum noise, Physical Review A 90
2014
Cited alongside, same era.
K. Fukui, A. Tomita, and A. Okamoto, Analog quantum error correction with encoding a qubit into an oscillator, Physical Review Letters 119
2017
Cited alongside, same era.
2017
Cited alongside, same era.
R. Chao, M. E. Beverland, N. Delfosse, and J. Haah, Optimization of the surface code design for majorana-based qubits, Quantum 4
2020
Later among the works it cites.
S. Huang, M. Newman, and K. R. Brown, Fault-tolerant weighted Union-Find decoding on the toric code, Phys. Rev. A 102
2020
Later among the works it cites.
N. Delfosse and G. Zémor, Linear-time maximum likelihood decoding of surface codes over the quantum erasure channel, Physical Review Research 2
2020
Later among the works it cites.
2021
Closest in time.
M. B. Hastings and J. Haah, Dynamically generated logical qubits (2021), arXiv:2107.02194 [quant-ph]
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.
V. Negîrneac, H. Ali, N. Muthusubramanian, F. Battistel, R. Sagastizabal, M. S. Moreira, J. F. Marques, W. J. Vlothuizen, M. Beekman, C. Zachariadis, N. Haider, A. Bruno, and L. DiCarlo, High-fidelity controlled- z z gate with maximal intermediate leakage operating at the speed limit in a superconducting quantum processor, Phys. Rev. Lett. 126
2021
Closest in time.
P. Jurcevic, A. Javadi-Abhari, L. S. Bishop, I. Lauer, D. F. Bogorin, M. Brink, L. Capelluto, O. Günlük, T. Itoko, N. Kanazawa, A. Kandala, G. A. Keefe, K. Krsulich, W. Landers, E. P. Lewandowski, D. T. McClure, G. Nannicini, A. Narasgond, H. M. Nayfeh, E. Pritchett, M. B. Rothwell, S. Srinivasan, N. Sundaresan, C. Wang, K. X. Wei, C. J. Wood, J.-B. Yau, E. J. Zhang, O. E. Dial, J. M. Chow, and J. M. Gambetta, Demonstration of quantum volume 64 on a superconducting quantum computing system, Quantum Science and Technology 6
2021
Closest in time.
2021
Closest in time.
J. P. B. Ataides, D. K. Tuckett, S. D. Bartlett, S. T. Flammia, and B. J. Brown, The xzzx surface code, Nature communications 12
2021
Closest in time.
C. Gidney, Decorrelated depolarization, https://algassert.com/post/2001 (2020), accessed: 2021-07-26
2021
Closest in time.