2000 character limit reached
Rank-based SLOCC classification for odd n qubits (1106.4082v1)
Published 21 Jun 2011 in quant-ph
Abstract: We study the entanglement classification under stochastic local operations and classical communication (SLOCC) for odd n-qubit pure states. For this purpose, we introduce the rank with respect to qubit i for an odd n-qubit state. The ranks with respect to qubits 1,2,...,n give rise to the classification of the space of odd n qubits into 3n families.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.