Classification of five-qubit absolutely maximally entangled states
Ian Tan

TL;DR
This paper classifies five-qubit absolutely maximally entangled states by their local unitary equivalence classes, linking them to quantum error-correcting codes and invariant polynomials.
Contribution
It introduces a classification framework for 5-qubit AME states using invariant polynomials and connects these states to specific quantum error-correcting codes.
Findings
Every 5-qubit AME state is equivalent to a state in the ((5,2,3)) code.
A set of three invariant polynomials separates the equivalence classes.
Constructs a 3-uniform n-qubit state for even n ≥ 6.
Abstract
We classify the local unitary equivalence classes of absolutely maximally entangled (AME) states of five qubits. We show that every 5-qubit AME state is equivalent to a state within the unique ((5,2,3)) quantum error-correcting code , and that two such states are equivalent if and only if they are related by the action of a transversal gate of . Furthermore, we exhibit a set of three invariant polynomials that separates these equivalence classes. As auxiliary results, we construct a 3-uniform -qubit state for even , determine the local symmetries of the 6-qubit AME state, and explain how these symmetries are related to the transversal gates of both the ((5,2,3)) and ((4,4,2)) codes. Additionally, we demonstrate that every 4-qubit pure code of distance 2 is equivalent to a subspace of a ((4,4,2)) code. Our approach leverages an embedding of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Computability, Logic, AI Algorithms
