Distinguishing Graph States by the Properties of Their Marginals
arXiv:2406.09956 · doi:10.1103/PhysRevA.111.052449
Abstract
Graph states are a class of multi-partite entangled quantum states that are ubiquitous in quantum information. We study equivalence relations between graph states under local unitaries (LU) to obtain distinguishing methods both in local and in networked settings. Based on the marginal structure of graph states, we introduce a family of easy-to-compute LU-invariants. We show that these invariants uniquely identify the entanglement classes of every graph state up to 8 qubits and discuss their reliability for larger numbers of qubits. To handle larger graphs, we generalize tools to test for local Clifford (LC) equivalence of graph states that work by condensing large graphs into smaller graphs. In turn, we show that statements on the equivalence of these smaller graphs (which are easier to compute) can be used to infer statements on the equivalence of the original, larger graphs. We analyze LU-equivalence in two key settings - with and without allowing for the permutation of qubits. We identify entanglement classes, whose marginal structure does not allow us to distinguish them. As a result, we increase the bound on the number of qubits where the LU-LC conjecture holds from 8 to 10 qubits in the setting where qubit permutations are allowed.
arXiv comment14 pages of main text + 5 pages of appendices, 11+4 figures, 3 tables
References in corpus (30)
- Quantum entanglement
- Quantum secret sharing
- Entanglement detection
- Measurement-based quantum computation with cluster states
- Quantum Error Correction for Quantum Memories
- Multi-party entanglement in graph states
- Cluster-state quantum computation
- Graphical description of the action of local Clifford transformations on graph states
- Multi-partite entanglement speeds up quantum key distribution in networks
- Quantum Conference Key Agreement: A Review
- Local unitary equivalence of multipartite pure states
- Quantum network routing and local complementation
- Experimental quantum conference key agreement
- Local unitary equivalence and entanglement of multipartite pure states
- An efficient algorithm to recognize local Clifford equivalence of graph states
- Anonymous Quantum Conference Key Agreement
- Local unitary versus local Clifford equivalence of stabilizer states
- Multiparticle covariance matrices and the impossibility of detecting graph state entanglement with two-particle correlations
- Optimal preparation of graph states
- Entanglement in eight-qubit graph states
- Characterizing quantum states via sector lengths
- Graph states and local unitary transformations beyond local Clifford operations
- Stochastic Local Operations with Classical Communication of Absolutely Maximally Entangled States
- How many invariant polynomials are needed to decide local unitary equivalence of qubit states?
- Extracting GHZ states from linear cluster states
- Direct evaluation of pure graph state entanglement
- Experimental anonymous conference key agreement using linear cluster states
- Counting single-qubit Clifford equivalent graph states is #P-Complete
- The average cut-rank of graphs
- The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States