Efficient Computation of the Permanent of Block Factorizable Matrices

H. N. V. Temperly and M. E. Fisher, Dimer problem in statistical mechanics – an exact result , Philosophical Magazine, 6(68), pp. 1061-1063, 1960

1960

Earlier work this paper cites.

P. W. Kasteleyn, The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice , Physica 27, pp. 1209–1225, 1961

1961

Earlier work this paper cites.

H. J. Ryser, Combinatorial Mathematics , The Carus mathematical monographs, The Mathematical Association of America, 1963

1963

Earlier work this paper cites.

P. W. Kasteleyn, Graph theory and crystal physics , in: F. Harary (Ed.), Graph theory and theoretical physics, Academic Press, pp. 43–110, 1967

1967

Earlier work this paper cites.

E. Cuthill and J. McKee. Reducing the bandwidth of sparse symmetric matrices In Proc. 24th Nat. Conf. ACM, pp. 157–172, 1969

1969

Earlier work this paper cites.

B. W. King and F. D. Parker, A Fibonacci matrix and the permanent function , Fibonacci Quart. 7, pp. 539Ð544, 1969

1969

Earlier work this paper cites.

N. Metropolis, M. L. Stein, P. R. Stein, Permanents of cyclic ( 0 , 1 ) (0,1) matrices , J. Combin. Theory Ser. B 7, pp. 291Ð321, 1969

1969

Earlier work this paper cites.

L. G. Valiant, The complexity of computing the permanent , Theor. Comput. Sci. 8, pp. 189–201, 1979

1979

Earlier work this paper cites.

H. Minc, Recurrence formulas for permanents of ( 0 , 1 ) (0,1) circulants , Linear Algebra Appl. 71, pp. 241Ð265, 1985

1985

Earlier work this paper cites.

H. Minc, Permanental compounds and permanents of ( 0 , 1 ) (0,1) circulants , Linear Algebra Appl. 86, pp. 11Ð42, 1987

1987

Cited alongside, same era.

M. Jerrum and A. Sinclair, Approximating the permanent , SIAM Journal on Computing 18, pp. 1149–1178, 1989

1989

Cited alongside, same era.

B. Codenotti, V. Crespi, G. Resta, On the permanent of certain ( 0 , 1 ) (0,1) Toeplitz matrices, Linear Algebra Appl. 267, pp. 65Ð100, 1997

1997

Cited alongside, same era.

G. Vidal, Efficient classical simulation of slightly entangled quantum computations , Phys. Rev. Lett. 91, 147902, 2003

2003

Cited alongside, same era.

S. Scheel, Permanents in linear optical networks , 2004; quant-ph/0406127, http://arxiv.org/abs/quant-ph/0406127

2004

Cited alongside, same era.

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 57(2), 2008

2008

Later among the works it cites.

M. Schwartz, Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices , Linear Algebra Appl. 430, pp. 1364–1374, 2009

2009

Later among the works it cites.

S. Aaronson and A. Arkhipov, The Computational Complexity of Linear Optics , 2010; quant-ph/1011.3245, http://arxiv.org/abs/1011.3245

Original

2010

Later among the works it cites.

C. M. da Fonseca, The μ \mu -permanent of a tridiagonal matrix, orthogonal polynomials, and chain sequences , Linear Algebra and its Applications, 432, pp. 1258–1266, 2010

2010

Later among the works it cites.

B. Pirvu, V. Murg, J. I. Cirac and F. Verstraete. Matrix product operator representations , New J. Phys. 12, pp. 025012, 2010