Shor-Laflamme distributions of graph states and noise robustness of entanglement

Abstract

The Shor-Laflamme distribution (SLD) of a quantum state is a collection of local unitary invariants that quantify $k$-body correlations. We show that the SLD of graph states can be derived by solving a graph-theoretical problem. In this way, the mean and variance of the SLD are obtained as simple functions of efficiently computable graph properties. Furthermore, this formulation enables us to derive closed expressions of SLDs for some graph state families. For cluster states, we observe that the SLD is very similar to a binomial distribution, and we argue that this property is typical for graph states in general. Finally, we derive an SLD-based entanglement criterion from the purity criterion and apply it to derive meaningful noise thresholds for entanglement. Our new entanglement criterion is easy to use and also applies to the case of higher-dimensional qudits. In the bigger picture, our results foster the understanding both of quantum error-correcting codes, where a closely related notion of Shor-Laflamme distributions plays an important role, and of the geometry of quantum states, where Shor-Laflamme distributions are known as sector length distributions.

22+18 pages, 8+6 figures, minor changes: title and motivation have been updated, appendix F has been removed to shorten the paper

References in corpus (18)

• Surface codes: Towards practical large-scale quantum computation
• Entanglement detection
• Multi-party entanglement in graph states
• Entanglement in continuous variable systems: Recent advances and current perspectives
• A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
• Direct Fidelity Estimation from Few Pauli Measurements
• Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Quantum Correlation Without Classical Correlations
• Graphs, Quadratic Forms, and Quantum Codes
• Generation and verification of 27-qubit Greenberger-Horne-Zeilinger states in a superconducting quantum computer
• Characterizing multipartite entanglement without shared reference frames
• The Decay of Multiqudit Entanglement
• Exponentially tighter bounds on limitations of quantum error mitigation
• Maximum $N$-body correlations do not in general imply genuine multipartite entanglement
• Compact set of invariants characterizing graph states of up to eight qubits
• GraphStateVis: Interactive Visual Analysis of Qubit Graph States and their Stabilizer Groups
• Local invariants for multi-partite entangled states allowing for a simple entanglement criterion

Cited by in corpus (4)

• Classical shadows based on locally-entangled measurements
• Experimental measurement and a physical interpretation of quantum shadow enumerators
• Detecting entanglement from few partial transpose moments and their decay via weight enumerators
• Multiqubit monogamy relations beyond shadow inequalities