2000 character limit reached
Lower Bound of Concurrence for Qubit Systems
Published 3 Jan 2014 in quant-ph | (1401.0622v2)
Abstract: We study the concurrence of four-qubit quantum states and provide analytical lower bounds of concurrence in terms of the monogamy inequality of concurrence for qubit systems. It is shown that these lower bounds are able to improve the existing bounds and detect entanglement better. The approach is generalized to arbitrary qubit systems.
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.