2000 character limit reached
Polynomial invariants of degree 4 for even-$n$ qubits and their applications in entanglement classification
Published 11 Aug 2013 in quant-ph | (1308.2436v1)
Abstract: We develop a simple method for constructing polynomial invariants of degree 4 for even-$n$ qubits and give explicit expressions for these polynomial invariants. We demonstrate the invariance of the polynomials under stochastic local operations and classical communication and exemplify the use of the invariance in classifying entangled states. The absolute values of these polynomial invariants are entanglement monotones, thereby allowing entanglement measures to be built. Finally, we discuss the properties of these entanglement measures.
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.