2000 character limit reached
Robustness of genuine tripartite entanglement under collective dephasing
Published 26 May 2015 in quant-ph | (1505.06923v1)
Abstract: We study robustness of genuine multipartite entanglement for a system of three qubits under collective dephasing. Using a computable entanglement monotone for multipartite systems, we found that almost every state is quite robust under this type of decoherence. We analyze random states and weighted graph states at infinity and found all of them to be genuinely entangled.
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.