14
Physics 21, 013003 (2019).
[20] Nishad Maskara, Aleksander Kubica, and Tomas
Jochym-O’Connor, “Advantages of versatile neural-
network decoding for topological codes,” Phys. Rev. A
99, 052351 (2019).
[21] D. Bacon, S. T. Flammia, A. W. Harrow, and J. Shi,
“Sparse quantum codes from quantum circuits,” in Pro-
ceedings of the Forty-Seventh Annual ACM on Sympo-
sium on Theory of Computing, STOC ’15 (ACM, New
York, NY, USA, 2015) pp. 327–334, 1411.3334.
[22] D. Bacon, S. T. Flammia, A. W. Harrow, and J. Shi,
“Sparse quantum codes from quantum circuits,” IEEE
Transactions on Information Theory 63, 2464–2479
(2017).
[23] Jozef Streˇcka, “Generalized algebraic transformations
and exactly solvable classical-quantum models,” Physics
Letters A 374, 3718 – 3722 (2010).
[24] Christopher Chamberland and Michael E. Beverland,
“Flag fault-tolerant error correction with arbitrary dis-
tance codes,” Quantum 2, 53 (2018), 1708.02246.
[25] C. Chamberland and A. W. Cross, “Fault-tolerant magic
state preparation with flag qubits,” Quantum 3, 143
(2019), 1811.00566.
[26] Rui Chao and Ben W. Reichardt, “Quantum error correc-
tion with only two extra qubits,” Phys. Rev. Lett. 121,
050502 (2018).
[27] H´ector Bomb´ın, “Single-shot fault-tolerant quantum er-
ror correction,” Phys. Rev. X 5, 031043 (2015).
[28] Benjamin J. Brown, Naomi H. Nickerson, and Dan E.
Browne, “Fault-tolerant error correction with the gauge
color code,” Nature Communications 7, 12302 (2016).
[29] Earl T. Campbell, “A theory of single-shot error correc-
tion for adversarial noise,” Quantum Science and Tech-
nology 4, 025006 (2019), 1805.09271.
[30] I. Dumer, A. A. Kovalev, and L. P. Pryadko, “Thresh-
olds for correcting errors, erasures, and faulty syndrome
measurements in degenerate quantum codes,” Phys. Rev.
Lett. 115, 050502 (2015), 1412.6172.
[31] A. A. Kovalev, S. Prabhakar, I. Dumer, and L. P.
Pryadko, “Numerical and analytical bounds on threshold
error rates for hypergraph-product codes,” Phys. Rev. A
97, 062320 (2018), 1804.01950.
[32] David Poulin, “Stabilizer formalism for operator quan-
tum error correction,” Phys. Rev. Lett. 95, 230504
(2005).
[33] Dave Bacon, “Operator quantum error-correcting subsys-
tems for self-correcting quantum memories,” Phys. Rev.
A 73, 012340 (2006).
[34] Daniel Gottesman, Stabilizer Codes and Quantum Error
Correction, Ph.D. thesis, Caltech (1997).
[35] 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, 1369–1387
(1998).
[36] Jeroen Dehaene and Bart De Moor, “Clifford group, sta-
bilizer states, and linear and quadratic operations over
GF(2),” Phys. Rev. A 68, 042318 (2003).
[37] Scott Aaronson and Daniel Gottesman, “Improved sim-
ulation of stabilizer circuits,” Phys. Rev. A 70, 052328
(2004).
[38] Bin Dai, Shilin Ding, and Grace Wahba, “Multivariate
Bernoulli distribution,” Bernoulli 19, 1465–1483 (2013).
[39] F. Wegner, “Duality in generalized Ising models and
phase transitions without local order parameters,” J.
Math. Phys. 2259, 12 (1971).
[40] A. J. Landahl, J. T. Anderson, and P. R. Rice, “Fault-
tolerant quantum computing with color codes,” (2011),
presented at QIP 2012, December 12 to December 16,
arXiv:1108.5738.
[41] A. A. Kovalev and L. P. Pryadko, “Spin glass re-
flection of the decoding transition for quantum error-
correcting codes,” Quantum Inf. & Comp. 15, 0825
(2015), arXiv:1311.7688.
[42] Lars Onsager, “Crystal statistics. I. a two-dimensional
model with an order-disorder transition,” Phys. Rev. 65,
117–149 (1944).
[43] Shigeo Naya, “On the spontaneous magnetizations of
honeycomb and Kagom´e Ising lattices,” Progress of The-
oretical Physics 11, 53–62 (1954).
[44] Michael E. Fisher, “Transformations of Ising models,”
Phys. Rev. 113, 969–981 (1959).
[45] Sergey Bravyi, Martin Suchara, and Alexander Vargo,
“Efficient algorithms for maximum likelihood decoding
in the surface code,” Phys. Rev. A 90, 032326 (2014).
[46] Markus Hauru, Clement Delcamp, and Sebastian Miz-
era, “Renormalization of tensor networks using graph-
independent local truncations,” Phys. Rev. B 97, 045111
(2018).
[47] M. de Koning, Wei Cai, A. Antonelli, and S. Yip,
“Efficient free-energy calculations by the simulation of
nonequilibrium processes,” Computing in Science Engi-
neering 2, 88–96 (2000).
[48] Charles H. Bennett, “Efficient estimation of free energy
differences from Monte Carlo data,” Journal of Compu-
tational Physics 22, 245268 (1976).
[49] Tobias Preis, Peter Virnau, Wolfgang Paul, and Jo-
hannes J. Schneider, “{GPU} accelerated monte carlo
simulation of the 2d and 3d ising model,” Journal of Com-
putational Physics 228, 4468 – 4477 (2009).
[50] A. Gilman, A. Leist, and K. A. Hawick, “3D lat-
tice Monte Carlo simulations on FPGAs,” in Proceed-
ings of the International Conference on Computer De-
sign (CDES) (The Steering Committee of The World
Congress in Computer Science, Computer Engineering
and Applied Computing (WorldComp), 2013).
[51] Kun Yang, Yi-Fan Chen, Georgios Roumpos, Chris
Colby, and John Anderson, “High performance Monte
Carlo simulation of Ising model on TPU clusters,”
(2019), unpublished, 1903.11714.
[52] D. Poulin and Y. Chung, “On the iterative decoding of
sparse quantum codes,” Quant. Info. and Comp. 8, 987
(2008), arXiv:0801.1241.
[53] Ye-Hua Liu and David Poulin, “Neural belief-
propagation decoders for quantum error-correcting
codes,” Phys. Rev. Lett. 122, 200501 (2019), 1811.07835.
[54] Alex Rigby, J. C. Olivier, and Peter Jarvis, “Modi-
fied belief propagation decoders for quantum low-density
parity-check codes,” Phys. Rev. A 100, 012330 (2019),
1903.07404.
[55] A. A. Kovalev, I. Dumer, and L. P. Pryadko, “Design
of additive quantum codes via the code-word-stabilized
framework,” Phys. Rev. A 84, 062319 (2011).
[56] Pavithran Iyer and David Poulin, “Hardness of decoding
quantum stabilizer codes,” IEEE Transactions on Infor-
mation Theory 61, 5209–5223 (2015), arXiv:1310.3235.
[57] E. A. Kruk, “Decoding complexity bound for linear block
codes,” Probl. Peredachi Inf. 25, 103–107 (1989), (In
Russian).