corner
corner

Phys. Rev. A 72, 012314 (2005) [7 pages]

Entangling power of permutations

Download: PDF (114 kB) Buy this article Export: BibTeX or EndNote (RIS)

Lieven Clarisse1,*, Sibasish Ghosh2,†, Simone Severini1,2,‡, and Anthony Sudbery1,§
1Department of Mathematics, The University of York, Heslington, York YO10 5DD, United Kingdom
2Department of Computer Science, The University of York, Heslington, York YO10 5DD, United Kingdom

Received 9 February 2005; published 14 July 2005

The notion of entangling power of unitary matrices was introduced by Zanardi et al. Phys. Rev. A 62 030301 (2000)]. We study the entangling power of permutations, given in terms of a combinatorial formula. We show that the permutation matrices with zero entangling power are, up to local unitaries, the identity and the swap. We construct the permutations with the minimum nonzero entangling power for every dimension. With the use of orthogonal latin squares, we construct the permutations with the maximum entangling power for every dimension. Moreover, we show that the value obtained is maximum over all unitaries of the same dimension, with a possible exception for 36. Our result enables us to construct generic examples of 4-qudit maximally entangled states for all dimensions except for 2 and 6. We numerically classify, according to their entangling power, the permutation matrices of dimensions 4 and 9, and we give some estimates for higher dimensions.

© 2005 The American Physical Society

URL:
http://link.aps.org/doi/10.1103/PhysRevA.72.012314
DOI:
10.1103/PhysRevA.72.012314
PACS:
03.67.Mn

*Electronic address: lc181@york.ac.uk

Electronic address: sibasish@cs.york.ac.uk

Electronic address: ss54@york.ac.uk

§Electronic address: as2@york.ac.uk