Tensor Network Methods for Invariant Theory

Richard Brauer, “On algebras which are connected with the semisimple continuous groups,” Annals of Mathematics 38

1937

Earlier work this paper cites.

Alfréd Rényi, “On measures of entropy and information,” in Fourth Berkeley Symposium on Mathematical Statistics and Probability (1961) pp. 547–561

1961

Earlier work this paper cites.

Roger Penrose, “Applications of negative dimensional tensors,” in Combinatorial Mathematics and its Applications , edited by D. Welsh (Academic Press, New York, 1971) pp. 221–244

1971

Earlier work this paper cites.

Claudio Procesi, “Invariant theory of n × \times n matrices,” Advances in Mathematics 19

1976

Earlier work this paper cites.

Yves Lafont, “Penrose diagrams and 2-dimensional rewriting,” in Applications of Categories in Computer Science , London Mathematical Society Lecture Note Series, Vol. 177, edited by M.P. Fourman, P.T. Johnstone, and A.M. Pitts (Cambridge University Press, 1992) pp. 191–201

1992

Earlier work this paper cites.

David Hilbert, Theory of Algebraic Invariants (Cambridge University Press, 1993)

1993

Earlier work this paper cites.

Yves Lafont, “Equational reasoning with 2-dimensional diagrams,” in Term Rewriting , Lecture Notes in Computer Science, Vol. 909 (Springer-Verlag, 1995) pp. 170–195

1995

Earlier work this paper cites.

Markus Grassl, Martin Rötteler, and Thomas Beth, “Computing local invariants of quantum-bit systems,” Phys. Rev. A 58

1998

Earlier work this paper cites.

E.M. Rains, “Polynomial Invariants of Quantum Codes,” IEEE Trans. Information Theory 46

2000

Earlier work this paper cites.

Anthony Sudbery, “On local invariants of pure three-qubit states,” J. Phys. A: Math. Gen. 34

2001

Earlier work this paper cites.

B. Kraus and J. I. Cirac, “Optimal creation of entanglement using a two-qubit gate,” Phys. Rev. A 63

2001

Earlier work this paper cites.

Yuriy Makhlin, “Nonlocal properties of two-qubit gates and mixed states, and the optimization of quantum computations,” Quantum Information Processing 1

2002

Earlier work this paper cites.

G. Vidal, “Efficient classical simulation of slightly entangled quantum computations,” Physical Review Letters 91

2003

Earlier work this paper cites.

Yves Lafont, “Towards an algebraic theory of Boolean circuits,” Journal of Pure and Applied Algebra 184

2003

Cited alongside, same era.

M. S. Leifer, N. Linden, and A. Winter, “Measuring polynomial invariants of multiparty quantum states,” Phys. Rev. A 69

2004

Cited alongside, same era.

Laura Koponen, Ville Bergholm, and Martti M. Salomaa, “A discrete local invariant for quantum gates,” Quant. Inf. and Comp. 6

2006

Cited alongside, same era.

D. Perez-Garcia, F. Verstraete, M. M. Wolf, and J. I. Cirac, “Matrix product state representations,” Quant. Inf. and Comp. 7

2007

Cited alongside, same era.

D. Gross, J. Eisert, N. Schuch, and D. Perez-Garcia, “Measurement-based quantum computation beyond the one-way model,” Phys. Rev. A 76

Original

2007

Cited alongside, same era.

U. Schollwöck, “The density-matrix renormalization group in the age of matrix product states,” Annals of Physics 326

Original

2011

Later among the works it cites.

J. C. Baez and M. Stay, “Physics, topology, logic and computation: A Rosetta stone,” in New Structures for Physics , Lecture Notes in Physics, Vol. 813 (Springer Berlin / Heidelberg, 2011) pp. 95–172, arXiv:0903.0340

Original

2011

Later among the works it cites.

John C. Baez and Aaron D. Lauda, “A prehistory of n-categorical physics,” in Deep Beauty: Understanding the Quantum World Through Mathematical Innovation , edited by Hans Halvorson (Cambridge University Press, 2011) pp. 13–128, arXiv:0908.2469

Original

2011

Later among the works it cites.

C. J. Wood, J. D. Biamonte, and D. G. Cory, “Tensor networks and graphical calculus for open quantum systems,” (2011), arXiv:1111.6950

Original

2011

Later among the works it cites.