General stabilizer approach for constructing highly entangled graph states

TL;DR

This paper introduces a new method combining classical error correcting codes and qudit graph states to construct highly entangled multipartite states, expanding the known classes of k-UNI and AME states for quantum information applications.

Contribution

It provides a general recipe for creating multipartite entangled states from classical codes and demonstrates inequivalence of many new states under stochastic local operations.

Findings

Broadened the class of known k-UNI and AME states

Developed an iterative procedure for constructing a hierarchy of k-UNI graph states

Showed many new states are inequivalent under stochastic local operations

Abstract

Highly entangled multipartite states such as k-uniform (k-UNI) and absolutely maximally entangled (AME) states serve as critical resources in quantum networking and other quantum information applications. However, there does not yet exist a complete classification of such states, and much remains unknown about their entanglement structure. Here, we substantially broaden the class of known k-UNI and AME states by introducing a method for explicitly constructing such states that combines classical error correcting codes and qudit graph states. This method in fact constitutes a general recipe for obtaining multipartitite entangled states from classical codes. Furthermore, we show that at least for a large subset of this new class of k-UNI states, the states are inequivalent under stochastic local operations and classical communication. This subset is defined by an iterative procedure for constructing a hierarchy of k-UNI graph states.