Fetching the paper…
Reading the bibliography…
Error probability distribution associated with a given Clifford measurement circuit is described exactly in terms of the circuit error-equivalence group, or the circuit subsystem code previously introduced by Bacon, Flammia, Harrow, and Shi.
1903
Earlier work this paper cites.
1903
Earlier work this paper cites.
1904
Earlier work this paper cites.
Lars Onsager, “Crystal statistics. I. a two-dimensional model with an order-disorder transition,” Phys. Rev. 65
1944
Earlier work this paper cites.
Shigeo Naya, “On the spontaneous magnetizations of honeycomb and Kagomé Ising lattices,” Progress of Theoretical Physics 11
1954
Earlier work this paper cites.
Michael E. Fisher, “Transformations of Ising models,” Phys. Rev. 113
1959
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.
Andrew J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Transactions on Information Theory 13
1967
Earlier work this paper cites.
F. Wegner, “Duality in generalized Ising models and phase transitions without local order parameters,” J. Math. Phys. 2259
1971
Earlier work this paper cites.
Charles H. Bennett, “Efficient estimation of free energy differences from Monte Carlo data,” Journal of Computational Physics 22
1976
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.
E. A. Kruk, “Decoding complexity bound for linear block codes,” Probl. Peredachi Inf. 25
1989
Earlier work this paper cites.
J. T. Coffey and R. M. Goodman, “The complexity of information set decoding,” IEEE Trans. Info. Theory 36
1990
Earlier work this paper cites.
P. W. Shor, “Scheme for reducing decoherence in quantum computer memory,” Phys. Rev. A 52
1995
Earlier work this paper cites.
Daniel Gottesman, Stabilizer Codes and Quantum Error Correction , Ph.D. thesis , Caltech (1997)
1997
Earlier work this paper cites.
A. R. Calderbank, E. M. Rains, P. M. Shor, and N. J. A. Sloane, “Quantum error correction via codes over GF(4),” IEEE Trans. Info. Theory 44
1998
Earlier work this paper cites.
M. de Koning, Wei Cai, A. Antonelli, and S. Yip, “Efficient free-energy calculations by the simulation of nonequilibrium processes,” Computing in Science Engineering 2
2000
Earlier work this paper cites.
M. P. C. Fossorier, “Iterative reliability-based decoding of low-density parity check codes,” IEEE Journal on Selected Areas in Communications 19
2001
Earlier work this paper cites.
Thomas J. Richardson and Rüdiger L. Urbanke, “The capacity of low-density parity-check codes under message-passing decoding,” Information Theory, IEEE Transactions on 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.
Jeroen Dehaene and Bart De Moor, “Clifford group, stabilizer states, and linear and quadratic operations over GF(2),” Phys. Rev. A 68
2003
Earlier work this paper cites.
Scott Aaronson and Daniel Gottesman, “Improved simulation of stabilizer circuits,” Phys. Rev. A 70
2004
Earlier work this paper cites.
2004
Cited alongside, same era.
David Poulin, “Stabilizer formalism for operator quantum error correction,” Phys. Rev. Lett. 95
2005
Cited alongside, same era.
P. Aliferis, D. Gottesman, and J. Preskill, “Quantum accuracy threshold for concatenated distance-3 codes,” Quantum Inf. Comput. 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.
2008
Cited alongside, same era.
2017
Later among the works it cites.
D. Bacon, S. T. Flammia, A. W. Harrow, and J. Shi, “Sparse quantum codes from quantum circuits,” IEEE Transactions on Information Theory 63
2017
Later among the works it cites.
2017
Later among the works it cites.
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Tobias Preis, Peter Virnau, Wolfgang Paul, and Johannes J. Schneider, “{GPU} accelerated monte carlo simulation of the 2d and 3d ising model,” Journal of Computational Physics 228
2009
Cited alongside, same era.
Jozef Strečka, “Generalized algebraic transformations and exactly solvable classical-quantum models,” Physics Letters A 374
2010
Cited alongside, same era.
David S. Wang, Austin G. Fowler, and Lloyd C. L. Hollenberg, “Surface code quantum computing with error rates over 1 % 1\% ,” Phys. Rev. A 83
2011
Cited alongside, same era.
A. A. Kovalev, I. Dumer, and L. P. Pryadko, “Design of additive quantum codes via the code-word-stabilized framework,” Phys. Rev. A 84
2011
Cited alongside, same era.
2012
Cited alongside, same era.
Bin Dai, Shilin Ding, and Grace Wahba, “Multivariate Bernoulli distribution,” Bernoulli 19
2013
Cited alongside, same era.
A. Gilman, A. Leist, and K. A. Hawick, “3D lattice Monte Carlo simulations on FPGAs,” in Proceedings of the International Conference on Computer Design (CDES) (The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp), 2013)
2013
Cited alongside, same era.
2018
Later among the works it cites.
Paul Baireuther, Thomas E. O’Brien, Brian Tarasinski, and Carlo W. J. Beenakker, “Machine-learning-assisted correction of correlated qubit errors in a topological code,” Quantum 2
2018
Later among the works it cites.
Christopher Chamberland and Pooya Ronagh, “Deep neural decoders for near term fault-tolerant experiments,” Quantum Science and Technology 3
2018
Later among the works it cites.
2018
Later among the works it cites.
Rui Chao and Ben W. Reichardt, “Quantum error correction with only two extra qubits,” Phys. Rev. Lett. 121
2018
Later among the works it cites.
2018
Later among the works it cites.
Markus Hauru, Clement Delcamp, and Sebastian Mizera, “Renormalization of tensor networks using graph-independent local truncations,” Phys. Rev. B 97
2018
Later among the works it cites.
Omar Fawzi, Antoine Grospellier, and Anthony Leverrier, “Constant overhead quantum fault-tolerance with quantum expander codes,” in 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018 (2018) pp. 743–754
2018
Later among the works it cites.
2018
Later among the works it cites.
Christophe Vuillot, Lingling Lao, Ben Criger, Carmen García Almudéver, Koen Bertels, and Barbara M. Terhal, “Code deformation and lattice surgery are gauge fixing,” New Journal of Physics 21
2019
Closest in time.
Zhih-Ahn Jia, Yuan-Hang Zhang, Yu-Chun Wu, Liang Kong, Guang-Can Guo, and Guo-Ping Guo, “Efficient machine-learning representations of a surface code with boundaries, defects, domain walls, and twists,” Phys. Rev. A 99
2019
Closest in time.
P. Baireuther, M. D. Caio, B. Criger, C. W. J. Beenakker, and T. E. O’Brien, “Neural network decoder for topological color codes with circuit level noise,” New Journal of Physics 21
2019
Closest in time.
Nishad Maskara, Aleksander Kubica, and Tomas Jochym-O’Connor, “Advantages of versatile neural-network decoding for topological codes,” Phys. Rev. A 99
2019
Closest in time.
C. Chamberland and A. W. Cross, “Fault-tolerant magic state preparation with flag qubits,” Quantum 3
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
Weilei Zeng and Leonid P. Pryadko, “Iterative decoding of row-reduced quantum LDPC codes,” (2020), unpublished
2020
Closest in time.