Fetching the paper…
Reading the bibliography…
By revisiting the Kirchhoff's Matrix-Tree Theorem, we give an exact formula for the number of spanning trees of a graph in terms of the quantum relative entropy between the maximally mixed state and another state specifically obtained from the graph.
A. Rényi, Probability Theory , Amsterdam: North-Holland, 1970
1970
Earlier work this paper cites.
N. Nakanishi, Graph Theory and Feynman Integrals , Gordon and Breach, New York, 1971
1971
Earlier work this paper cites.
A. S. Holevo, Bounds for the quantity of information transmitted by a quantum communication channel, Prob. Inf. Transm. (USSR) 9
1973
Earlier work this paper cites.
W. Ochs, A new axiomatic characterization of the von Neumann entropy, Rep. Math. Phys. 8
1975
Earlier work this paper cites.
W. T. Tutte, Graph Theory , Encyclopedia of Mathematics and its Applications, 21, Addison-Wesley, 1984
1984
Earlier work this paper cites.
R. P. Stanley, Enumerative combinatorics , vol. I. , Wadsworth and Brooks/Cole, Monterey, 1986
1986
Earlier work this paper cites.
W. Watkins, The Laplacian matrix of a graph: Unimodular congruence, Linear and Multilinear Algebra 28
1990
Cited alongside, same era.
D. Welsh, The Tutte polynomial. Random Structures Algorithms , 15(
1997
Cited alongside, same era.
B. Bollobás, Modern Graph Theory , Springer Verlag, New York, 1998
1998
Cited alongside, same era.
A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information , Cambridge Series on Information and the Natural Sciences, 2000
2000
Cited alongside, same era.
A. Hinchliffe (Editor), Chemical Modelling: Applications and Theory, Volume 2 , The Royal Society of Chemistry (2002)
2002
Cited alongside, same era.
B. Schumacher and M. Westmoreland, Relative entropy in quantum information theory. American Mathematical Society Contemporary Mathematics Series: Quantum Information and Quantum Computation, 305 , American Mathematical Society, Providence, 2002
2002
Later among the works it cites.
V. Vedral, The Role of Relative Entropy in Quantum Information Theory, Rev. Mod. Phys. 74
2002
Later among the works it cites.
K. M. R. Audenaert and J. Eisert, Continuity bounds on the quantum relative entropy, J. Math. Phys. 46
2005
Later among the works it cites.
S. Braunstein, S. Ghosh, and S. Severini, The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states, Ann. Comb. , Vol. 10, no 3 (2006), 291-317
2006
Later among the works it cites.
K. M. R. Audenaert, M. Nussbaum, A. Szkola, F. Verstraete, Asymptotic Error Rates in Quantum Hypothesis Testing, Comm. Math. Phys. 279
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
V. Paulsen, Completely Bounded Maps and Operator Algebras , Cambridge University Press, Cambridge, 2002
2002
Cited alongside, same era.
G. Kirchhoff, Über die Auflösung der Gleichungen, auf welche man bei der untersuchung der linearen verteilung galvanischer Ströme geführt wird, Ann. Phys. Chem. 72
Cited in the paper.
2008
Later among the works it cites.
I. B. Gertsbakh, Y. Shpungin, Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo , CRC Press, 2009
2009
Later among the works it cites.