Fetching the paper…
Reading the bibliography…
We formulate code concatenation as the action of a unitary quantum circuit on an expanding tree geometry and find that for certain classes of gates, applied identically at each node, a binary tree circuit encodes a single logical qubit with code distance that grows exponentially in the depth of the tree.
H. Kesten and B. P. Stigum, Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes, The Annals of Mathematical Statistics 37
1966
Earlier work this paper cites.
H. Kesten and B. P. Stigum, Limit theorems for decomposable multi-dimensional Galton-Watson processes, Journal of Mathematical Analysis and Applications 17
1967
Earlier work this paper cites.
C. W. Helstrom, Quantum detection and estimation theory, Journal of Statistical Physics 1
1969
Earlier work this paper cites.
A. Holevo, Statistical decision theory for quantum systems, Journal of Multivariate Analysis 3
1973
Earlier work this paper cites.
Y. Higuchi, Remarks on the Limiting Gibbs States on a ( d + 1 d+1 )-Tree, Publications of the Research Institute for Mathematical Sciences 13
1977
Earlier work this paper cites.
M. E. Fisher, Walks, walls, wetting, and melting, Journal of Statistical Physics 34
1984
Earlier work this paper cites.
J. T. Chayes, L. Chayes, J. P. Sethna, and D. J. Thouless, A mean field spin glass with short-range interactions, Communications in Mathematical Physics 106
1986
Earlier work this paper cites.
J. M. Carlson, J. T. Chayes, L. Chayes, J. P. Sethna, and D. J. Thouless, Critical behavior of the bethe lattice spin glass, EPL 5
1988
Earlier work this paper cites.
P. D. Gujrati, Bethe or Bethe-like Lattice Calculations Are More Reliable Than Conventional Mean-Field Calculations, Physical Review Letters 74
1995
Earlier work this paper cites.
P. M. Bleher, J. Ruiz, and V. A. Zagrebnov, On the purity of the limiting gibbs state for the Ising model on the Bethe lattice, Journal of Statistical Physics 79
1995
Earlier work this paper cites.
O. Häggström, The random-cluster model on a homogeneous tree, Probability Theory and Related Fields 104
1996
Earlier work this paper cites.
D. Ioffe, On the extremality of the disordered state for the Ising model on the Bethe lattice, Letters in Mathematical Physics 37
1996
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.
A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Physical Review A 54
1996
Earlier work this paper cites.
A. 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.
C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, Mixed-state entanglement and quantum error correction, Physical Review A 54
1996
Earlier work this paper cites.
D. Aharonov and M. Ben-Or, Fault-tolerant quantum computation with constant error, in Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing , STOC ’97 (Association for Computing Machinery, New York, NY, USA, 1997) p. 176–188
1997
Earlier work this paper cites.
P. Shor and R. Laflamme, Quantum analog of the macwilliams identities for classical coding theory, Physical Review Letters 78
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.
G. Grimmett, Percolation , Grundlehren der mathematischen Wissenschaften (Springer Berlin Heidelberg, Berlin, Heidelberg, 1999)
1999
Earlier work this paper cites.
F. Wagner, D. Grensing, and J. Heide, Potts model on a Cayley tree and logistic equation, Journal of Physics A: Mathematical and General 33
2000
Earlier work this paper cites.
W. Evans, C. Kenyon, Y. Peres, and L. J. Schulman, Broadcasting on trees and the Ising model, The Annals of Applied Probability 10
2000
Earlier work this paper cites.
M. Mézard and G. Parisi, The Bethe lattice spin glass revisited, The European Physical Journal B 20
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.
E. Mossel and Y. Peres, Information flow on trees, Annals of Applied Probability 13
2003
Earlier work this paper cites.
E. Mossel, Survey: Information flow on trees, in Graphs, Morphisms and Statistical Physics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science , edited by J. Nesetril and P. Winkler (American Mathematical Society, Providence, RI, 2004) pp. 155–170
2004
Earlier work this paper cites.
D. Poulin, Stabilizer Formalism for Operator Quantum Error Correction, Physical Review Letters 95
2005
Earlier work this paper cites.
M. Mézard and A. Montanari, Reconstruction on trees and spin glass transition, Journal of statistical physics 124
2006
Earlier work this paper cites.
D. Poulin, Optimal and efficient decoding of concatenated quantum block codes, Phys. Rev. A 74
2006
Cited alongside, same era.
D. W. Kribs, R. Laflamme, D. Poulin, and M. Lesosky, Operator quantum error correction, Quantum Info. Comput. 6
2006
Cited alongside, same era.
D. Bacon, Operator quantum error-correcting subsystems for self-correcting quantum memories, Physical Review A 73
2006
Cited alongside, same era.
R. J. Baxter, Exactly solved models in statistical mechanics (Courier Corporation, 2007)
2007
Cited alongside, same era.
D. Aharonov and M. Ben-Or, Fault-tolerant quantum computation with constant error rate, SIAM Journal on Computing 38
2008
Cited alongside, same era.
C. T. Chubb and S. T. Flammia, Statistical mechanical models for quantum codes with correlated noise, Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions 8
2021
Later among the works it cites.
M. J. Gullans, S. Krastanov, D. A. Huse, L. Jiang, and S. T. Flammia, Quantum coding with low-depth random circuits, Phys. Rev. X 11
2021
Later among the works it cites.
Y. Li and M. P. A. Fisher, Statistical mechanics of quantum error correcting codes, Physical Review B 103
2021
Later among the works it cites.
The on-line encyclopedia of integer sequences (2022)
2022
Later among the works it cites.
G. Kalachev and S. Sadov, A linear-algebraic and lattice-theoretical look at the cleaning lemma of quantum coding theory, Linear Algebra and its Applications 649
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2009
Cited alongside, same era.
M. Mezard and A. Montanari, Information, physics, and computation (Oxford University Press, 2009)
2009
Cited alongside, same era.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, 2010)
2010
Cited alongside, same era.
A. Sly, Reconstruction for the potts model, Annals of Probability 39
2011
Cited alongside, same era.
J. van de Wetering, ZX-calculus for the working quantum computer scientist (2020), arXiv:2012.13966
2012
Cited alongside, same era.
2012
Cited alongside, same era.
W. Brown and O. Fawzi, Short random circuits define good quantum error correcting codes, in 2013 IEEE International Symposium on Information Theory (IEEE, 2013) pp. 346–350
2013
Cited alongside, same era.
T. Farrelly, D. K. Tuckett, and T. M. Stace, Local tensor-network codes, New Journal of Physics 24
2022
Later among the works it cites.
C. Cao and B. Lackey, Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks, PRX Quantum 3
2022
Later among the works it cites.
2022
Later among the works it cites.
Y. Wu, S. Kolkowitz, S. Puri, and J. D. Thompson, Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays, Nature Communications 13
2022
Later among the works it cites.
X. Feng, B. Skinner, and A. Nahum, Measurement-Induced Phase Transitions on Dynamical Quantum Trees, PRX Quantum 4
2023
Later among the works it cites.
2023
Later among the works it cites.
N. Delfosse and A. Paetznick, Spacetime codes of Clifford circuits (2023), arXiv:2304.05943
2023
Later among the works it cites.
Y. Li, S. Vijay, and M. P. A. Fisher, Entanglement Domain Walls in Monitored Quantum Circuits and the Directed Polymer in a Random Environment, PRX Quantum 4
2023
Later among the works it cites.
S. Sang, Z. Li, T. H. Hsieh, and B. Yoshida, Ultrafast entanglement dynamics in monitored quantum circuits, PRX Quantum 4
2023
Later among the works it cites.
K. Sahay, J. Jin, J. Claes, J. D. Thompson, and S. Puri, High-Threshold Codes for Neutral-Atom Qubits with Biased Erasure Errors, Physical Review X 13
2023
Later among the works it cites.
P. Scholl, A. L. Shaw, R. B.-s. Tsai, R. Finkelstein, J. Choi, and M. Endres, Erasure conversion in a high-fidelity Rydberg quantum simulator, Nature 622
2023
Later among the works it cites.
S. Ma, G. Liu, P. Peng, B. Zhang, S. Jandura, J. Claes, A. P. Burgers, G. Pupillo, S. Puri, and J. D. Thompson, High-fidelity gates and mid-circuit erasure conversion in an atomic qubit, Nature 622
2023
Later among the works it cites.
D. Gottesman, Surviving as a Quantum Computer in a Classical World (2024 draft)
2024
Closest in time.
C. Cao and B. Lackey, Quantum Weight Enumerators and Tensor Networks, IEEE Transactions on Information Theory 70
2024
Closest in time.
C. Cao, M. J. Gullans, B. Lackey, and Z. Wang, Quantum lego expansion pack: Enumerators from tensor networks, PRX Quantum 5
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
V. V. Albert and P. Faist, eds., The Error Correction Zoo (2024)
2024
Closest in time.
I. Lovas, U. Agrawal, and S. Vijay, Quantum coding transitions in the presence of boundary dissipation, PRX Quantum 5
2024
Closest in time.
G. M. Sommers, S. Gopalakrishnan, M. J. Gullans, and D. A. Huse, Zero-temperature entanglement membranes in quantum circuits, Phys. Rev. B 110
2024
Closest in time.
X. Feng, N. Fishchenko, S. Gopalakrishnan, and M. Ippoliti, Charge and Spin Sharpening Transitions on Dynamical Quantum Trees, Quantum 9
2025
Closest in time.