Abstract

Multipartite quantum states constitute a (if not the) key resource for quantum computations and protocols. However obtaining a generic, structural understanding of entanglement in N-qubit systems is a long-standing open problem in quantum computer science. Here we show that multipartite quantum entanglement admits a compositional structure, and hence is subject to modern computer science methods.Recall that two N-qubit states are SLOCC-equivalent if they can be inter-converted by stochastic local (quantum) operations and classical communication. There are only two SLOCC-equivalence classes of genuinely entangled 3-qubit states, the GHZ-class and the W-class, and we show that these exactly correspond with two kinds of internal commutative Frobenius algebras on ℂ2 in the symmetric monoidal category of Hilbert spaces and linear maps, namely ‘special’ ones and ‘anti-special’ ones. Within the graphical language of symmetric monoidal categories, the distinction between ‘special’ and ‘anti-special’ is purely topological, in terms of ‘connected’ vs. ‘disconnected’.These GHZ and W Frobenius algebras form the primitives of a graphical calculus which is expressive enough to generate and reason about representatives of arbitrary N-qubit states. This calculus refines the graphical calculus of complementary observables in [5, ICALP’08], which has already shown itself to have many applications and admit automation. Our result also induces a generalised graph state paradigm for measurement-based quantum computing.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.