Permutation symmetries of multipartite quantum states are defined only when the constituent subsystems are of equal dimensions. In this work we extend this notion of permutation symmetry to heterogeneous systems, that is, systems composed of subsystems having unequal dimensions. Given a tensor product space of
k subsystems (of arbitrary dimensions) and a permutation operation
σ over
k symbols, these states are such that they have identical decompositions (up to an overall phase) in the given tensor product space and the tensor product space obtained by the permuting the subsystems by
σ. Towards this, we construct a matrix whose action is to simultaneously permute the subsystem label and subsystem dimension of a given state according to permutation
σ. Eigenvectors of this matrix have the required symmetry. We then examine entanglement of states in the igenspaces of these matrices. It is found that all nonsymmetric eigenspaces of such matrices are completely entangled subspaces, with states being equally entangled in both the given tensor product space and the permuted tensor product space.
Permutation symmetries of multipartite quantum states are defined only when the constituent subsystems are of equal dimensions. In this work we extend this notion of permutation symmetry to heterogeneous systems, that is, systems composed of subsystems having unequal dimensions. Given a tensor product space of
k subsystems (of arbitrary dimensions) and a permutation operation
σ over
k symbols, these states are such that they have identical decompositions (up to an overall phase) in the given tensor product space and the tensor product space obtained by the permuting the subsystems by
σ. Towards this, we construct a matrix whose action is to simultaneously permute the subsystem label and subsystem dimension of a given state according to permutation
σ. Eigenvectors of this matrix have the required symmetry. We then examine entanglement of states in the igenspaces of these matrices. It is found that all nonsymmetric eigenspaces of such matrices are completely entangled subspaces, with states being equally entangled in both the given tensor product space and the permuted tensor product space.
Convex polytopes are convex hulls of point sets in the n -dimensional space that generalize two-dimensional convex polygons and three-dimensional convex polyhedra. We concentrate on the class of n -dimensional polytopes in called sign permutation polytopes. We characterize sign permutation polytopes before relating their construction to constructions over the space of quantum density matrices. Finally, we consider the problem of state identification and show how sign permutation polytopes may be useful in addressing issues of robustness.