Fetching the paper…
Reading the bibliography…
Tensor network contraction is central to problems ranging from many-body physics to computer science.
L. Onsager, “Crystal statistics. i. a two-dimensional model with an order-disorder transition,” Physical Review
1944
Earlier work this paper cites.
N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, “Equation of State Calculations by Fast Computing Machines,” The Journal of Chemical Physics
1953
Earlier work this paper cites.
M. A. Beauchamp, “An improved index of centrality,” Behavioral science
1965
Earlier work this paper cites.
T. J. Schaefer, “The complexity of satisfiability problems,” in Proceedings of the Tenth Annual ACM Symposium on Theory of Computing
1978
Earlier work this paper cites.
USA: W. H. Freeman & Co., 1979
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness · 1979
Earlier work this paper cites.
B. Bollobás and B. D. McKay, “The number of matchings in random regular graphs and bipartite graphs,” Journal of Combinatorial Theory, Series B
1986
Earlier work this paper cites.
S. R. White, “Density matrix formulation for quantum renormalization groups,” Physical Review Letters
1992
Earlier work this paper cites.
S. R. White, “Density-matrix algorithms for quantum renormalization groups,” Physical Review B
1993
Earlier work this paper cites.
T. Nishino and K. Okunishi, “Corner Transfer Matrix Renormalization Group Method,” Journal of the Physical Society of Japan
1996
Earlier work this paper cites.
T. Nishino and K. Okunishi, “Corner transfer matrix renormalization group method,” Journal of the Physical Society of Japan
1996
Earlier work this paper cites.
T. Nishino and K. Okunishi, “Corner Transfer Matrix Algorithm for Classical Renormalization Group,” Journal of the Physical Society of Japan
1997
Earlier work this paper cites.
S. Bramwell and M. Harris, “Frustration in ising-type spin models on the pyrochlore lattice,” Journal of Physics: Condensed Matter
1998
Earlier work this paper cites.
M. Marchiori and V. Latora, “Harmony in the small-world,” Physica A: Statistical Mechanics and its Applications
2000
Earlier work this paper cites.
F. Wang and D. P. Landau, “Efficient, Multiple-Range Random Walk Algorithm to Calculate the Density of States,” Physical Review Letters
2001
Earlier work this paper cites.
F. Verstraete and J. I. Cirac, “Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions,” arXiv:cond-mat/0407066
2004
Earlier work this paper cites.
V. Murg, F. Verstraete, and J. I. Cirac, “Variational study of hard-core bosons in a two-dimensional optical lattice using projected entangled pair states,” Physical Review A
2007
Earlier work this paper cites.
G. Vidal, “Classical Simulation of Infinite-Size Quantum Lattice Systems in One Spatial Dimension,” Physical Review Letters
2007
Earlier work this paper cites.
M. Levin and C. P. Nave, “Tensor renormalization group approach to two-dimensional classical lattice models,” Physical review letters
2007
Earlier work this paper cites.
N. Schuch, M. M. Wolf, F. Verstraete, and J. I. Cirac, “Computational complexity of projected entangled pair states,” Physical review letters
2007
Earlier work this paper cites.
J. Raymond, A. Sportiello, and L. Zdeborová, “Phase diagram of the 1-in-3 satisfiability problem,” Physical Review E
2007
Earlier work this paper cites.
I. Markov and Y. Shi, “Simulating Quantum Computation by Contracting Tensor Networks,” SIAM Journal on Computing
2008
Earlier work this paper cites.
H. C. Jiang, Z. Y. Weng, and T. Xiang, “Accurate Determination of Tensor Network State of Quantum Lattice Models in Two Dimensions,” Physical Review Letters
2008
Earlier work this paper cites.
F. Verstraete, V. Murg, and J. I. Cirac, “Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems,” Advances in physics
2008
Earlier work this paper cites.
L. Zdeborová and M. Mézard, “Constraint satisfaction problems with isolated solutions are hard,” Journal of Statistical Mechanics: Theory and Experiment
2008
Earlier work this paper cites.
R. Orus and G. Vidal, “Simulation of two dimensional quantum systems on an infinite lattice revisited: Corner transfer matrix for tensor contraction,” Physical Review B
2009
Earlier work this paper cites.
Z. Y. Xie, H. C. Jiang, Q. N. Chen, Z. Y. Weng, and T. Xiang, “Second Renormalization of Tensor-Network States,” Physical Review Letters
2009
Earlier work this paper cites.
2011
Earlier work this paper cites.
L. Wang and F. Verstraete, “Cluster update for tensor network states,” Oct. 2011
2011
Earlier work this paper cites.
E. Stoudenmire and S. R. White, “Studying Two-Dimensional Systems with the Density Matrix Renormalization Group,” Annual Review of Condensed Matter Physics
2012
Earlier work this paper cites.
B. Dittrich, F. C. Eckert, and M. Martin-Benito, “Coarse graining methods for spin net and spin foam models,” New Journal of Physics
2012
Cited alongside, same era.
Z.-Y. Xie, J. Chen, M.-P. Qin, J. W. Zhu, L.-P. Yang, and T. Xiang, “Coarse-graining renormalization by higher-order singular value decomposition,” Physical Review B
2012
Cited alongside, same era.
A. J. Ferris and D. Poulin, “Tensor networks and quantum error correction,” Phys. Rev. Lett
2014
Cited alongside, same era.
S. Bravyi, M. Suchara, and A. Vargo, “Efficient algorithms for maximum likelihood decoding in the surface code,” Phys. Rev. A
2014
Cited alongside, same era.
P. Corboz, T. M. Rice, and M. Troyer, “Competing states in the t-J model: Uniform d-wave state versus stripe state,” Physical Review Letters
2014
Cited alongside, same era.
S. Kourtis, C. Chamon, E. Mucciolo, and A. Ruckenstein, “Fast counting with tensor networks,” SciPost Physics
2019
Later among the works it cites.
2019
Later among the works it cites.
R. Orús, “Tensor networks for complex quantum systems,” Nature Reviews Physics
2019
Later among the works it cites.
S. Iino, S. Morita, and N. Kawashima, “Boundary Tensor Renormalization Group,” Physical Review B
2019
Later among the works it cites.
T. Akiba, S. Sano, T. Yanase, T. Ohta, and M. Koyama, “Optuna: A next-generation hyperparameter optimization framework,” in Proceedings of the 25rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. D. Biamonte, J. Morton, and J. Turner, “Tensor Network Contractions for #SAT,” Journal of Statistical Physics
2015
Cited alongside, same era.
G. Evenbly and G. Vidal, “Tensor Network Renormalization,” Physical Review Letters
2015
Cited alongside, same era.
G. Evenbly and G. Vidal, “Tensor network renormalization,” Physical review letters
2015
Cited alongside, same era.
T. Grover and M. P. A. Fisher, “Entanglement and the sign structure of quantum states,” Physical Review A
2015
Cited alongside, same era.
H.-H. Zhao, Z.-Y. Xie, T. Xiang, and M. Imada, “Tensor network algorithm by coarse-graining tensor renormalization on finite periodic lattices,” Physical Review B
2016
Cited alongside, same era.
A. L. Passos, D. F. de Albuquerque, and J. B. S. Filho, “Representation and simulation for pyrochlore lattice via Monte Carlo technique,” Physica A: Statistical Mechanics and its Applications
2016
Cited alongside, same era.
Elsevier, 2016
R. J. Baxter, Exactly solved models in statistical mechanics · 2016
Cited alongside, same era.
Later among the works it cites.
F. Pan, P. Zhou, S. Li, and P. Zhang, “CATN.” https://github.com/panzhang83/catn , 2019
2019
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
T.-D. Bradley, E. M. Stoudenmire, and J. Terilla, “Modeling sequences with quantum states: a look under the hood,” Machine Learning: Science and Technology
2020
Later among the works it cites.
2020
Later among the works it cites.
Springer Nature, 2020
S.-J. Ran, E. Tirrito, C. Peng, X. Chen, L. Tagliacozzo, G. Su, and M. Lewenstein, Tensor network contractions: methods and applications to quantum many-body systems · 2020
Later among the works it cites.
A. Jermyn, “Automatic contraction of unstructured tensor networks,” SciPost Physics
2020
Later among the works it cites.
F. Pan, P. Zhou, S. Li, and P. Zhang, “Contracting arbitrary tensor networks: General approximate algorithm and applications in graphical models and quantum circuit simulations,” Phys. Rev. Lett
2020
Later among the works it cites.
PhD thesis, Karlsruhe Institute of Technology, Germany, 2020
S. Schlag, High-Quality Hypergraph Partitioning · 2020
Later among the works it cites.
2020
Later among the works it cites.
J. Gray and S. Kourtis, “Hyper-optimized tensor network contraction,” Quantum
2021
Later among the works it cites.
2021
Later among the works it cites.
F. Pan and P. Zhang, “Simulating the Sycamore quantum supremacy circuits,” Mar. 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
J.-G. Liu, L. Wang, and P. Zhang, “Tropical tensor network for ground states of spin glasses,” Physical Review Letters
2021
Later among the works it cites.
C. T. Chubb and S. T. Flammia, “Statistical mechanical models for quantum codes with correlated noise,” Annales de l’Institut Henri Poincaré D
2021
Later among the works it cites.
C. T. Chubb, “General tensor network decoding of 2d pauli codes,” arXiv preprint arXiv:2101.04125
2021
Later among the works it cites.
J. P. Bonilla Ataides, D. K. Tuckett, S. D. Bartlett, S. T. Flammia, and B. J. Brown, “The xzzx surface code,” Nature communications
2021
Later among the works it cites.
T. Farrelly, R. J. Harris, N. A. McMahon, and T. M. Stace, “Tensor-Network Codes,” Physical Review Letters
2021
Later among the works it cites.
A. Galanis, L. A. Goldberg, and A. Herrera-Poyatos, “The complexity of approximating the complex-valued Ising model on bounded degree graphs,” May 2021
2021
Later among the works it cites.
J. Gray and G. K.-L. Chan, “Supplementary information for “hyper-optimized approximate contraction of tensor networks with arbitrary geometry,” 2022
2022
Closest in time.
S. Schlag, T. Heuer, L. Gottesbüren, Y. Akhremtsev, C. Schulz, and P. Sanders, “High-quality hypergraph partitioning,” ACM J. Exp. Algorithmics
2022
Closest in time.
P. Buys, A. Galanis, V. Patel, and G. Regts, “Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs,” Forum of Mathematics, Sigma
2022
Closest in time.