Fetching the paper…
Reading the bibliography…
We present a conceptually clear and algorithmically useful framework for parameterizing the costs of tensor network contraction.
Benjamin Villalonga, Sergio Boixo, Bron Nelson, Christopher Henze, Eleanor Rieffel, Rupak Biswas, and Salvatore Mandrà · 1906
Earlier work this paper cites.
Linear time algorithms for np-hard problems restricted to partial k-trees
Stefan Arnborg and Andrzej Proskurowski · 1989
Earlier work this paper cites.
On embedding graphs in trees
Dan Bienstock · 1990
Earlier work this paper cites.
Graph minors. x. obstructions to tree-decomposition
Neil Robertson and P.D Seymour · 1991
Earlier work this paper cites.
Approximating treewidth, pathwidth, and minimum elimination tree height
Hans L. Bodlaender, John R. Gilbert, Hjálmtýr Hafsteinsson, and Ton Kloks · 1992
Earlier work this paper cites.
A linear time algorithm for finding tree-decompositions of small treewidth
Hans L. Bodlaender · 1993
Earlier work this paper cites.
Call routing and the ratcatcher
P. D. Seymour and R. Thomas · 1994
Earlier work this paper cites.
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree
Hans L Bodlaender, John R Gilbert, Hjálmtyr Hafsteinsson, and Ton Kloks · 1995
Earlier work this paper cites.
Constructive linear time algorithms for branchwidth
Hans L. Bodlaender and Dimitrios M. Thilikos · 1997
Earlier work this paper cites.
Tour merging via branch-decomposition
William Cook and Paul Seymour · 2003
Cited alongside, same era.
Minimal congestion trees
M.I Ostrovskii · 2004
Cited alongside, same era.
Simulating quantum computation by contracting tensor networks
I. Markov and Y. Shi · 2008
Cited alongside, same era.
Derivation of algorithms for cutwidth and related graph layout parameters
Hans L Bodlaender, Michael R Fellows, and Dimitrios M Thilikos · 2009
Cited alongside, same era.
Quantum computation and the evaluation of tensor networks
Itai Arad and Zeph Landau · 2010
Cited alongside, same era.
Tensor network contractions for #sat
Jacob D. Biamonte, Jason Morton, and Jacob Turner · 2015
Cited alongside, same era.
Jacob Biamonte and Ville Bergholm · 2017
Later among the works it cites.
Simulation of low-depth quantum circuits as complex undirected graphical models
Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, and Hartmut Neven · 2017
Later among the works it cites.
Tree tensor network approach to simulating shor’s algorithm
Eugene Dumitrescu · 2017
Later among the works it cites.
Breaking the 49-qubit barrier in the simulation of quantum circuits
Edwin Pednault, John A. Gunnels, Giacomo Nannicini, Lior Horesh, Thomas Magerlein, Edgar Solomonik, Erik W. Draeger, Eric T. Holland, and Robert Wisnieff · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh · 2015
Cited alongside, same era.
Complexity-theoretic foundations of quantum supremacy experiments
Scott Aaronson and Lijie Chen · 2016
Cited alongside, same era.
Track a: Treewidth, Dec 2016
The Parameterized Algorithms and Computational Experiments Challenge · 2017
Cited alongside, same era.
Jianxin Chen, Fang Zhang, Mingcheng Chen, Cupjin Huang, Michael Newman, and Yaoyun Shi · 2018
Later among the works it cites.
Graph theory
Reinhard Diestel · 2018
Later among the works it cites.
Benchmarking treewidth as a practical component of tensor network simulations
Eugene F. Dumitrescu, Allison L. Fisher, Timothy D. Goodrich, Travis S. Humble, Blair D. Sullivan, and Andrew L. Wright · 2018
Later among the works it cites.
qtorch: The quantum tensor contraction handler
E. Schuyler Fried, Nicolas P. D. Sawaya, Yudong Cao, Ian D. Kivlichan, Jhonathan Romero, and Alán Aspuru-Guzik · 2018
Later among the works it cites.
The treewidth of line graphs
Daniel J. Harvey and David R. Wood · 2018
Later among the works it cites.