2000 character limit reached
$k$-uniform mixed states (1906.01311v2)
Published 4 Jun 2019 in quant-ph
Abstract: We investigate the maximum purity that can be achieved by k-uniform mixed states of N parties. Such N-party states have the property that all their k-party reduced states are maximally mixed. A scheme to construct explicitly k-uniform states using a set of specific N-qubit Pauli matrices is proposed. We provide several different examples of such states and demonstrate that in some cases the state corresponds to a particular orthogonal array. The obtained states, despite being mixed, reveal strong non-classical properties such as genuine multipartite entanglement or violation of Bell inequalities.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.