Mapping graph state orbits under local complementation

Abstract

Graph states, and the entanglement they posses, are central to modern quantum computing and communications architectures. Local complementation---the graph operation that links all local-Clifford equivalent graph states---allows us to classify all stabiliser states by their entanglement. Here, we study the structure of the orbits generated by local complementation, mapping them up to 9 qubits and revealing a rich hidden structure. We provide programs to compute these orbits, along with our data for each of the 587 orbits up to 9 qubits and a means to visualise them. We find direct links between the connectivity of certain orbits with the entanglement properties of their component graph states. Furthermore, we observe the correlations between graph-theoretical orbit properties, such as diameter and colourability, with Schmidt measure and preparation complexity and suggest potential applications. It is well known that graph theory and quantum entanglement have strong interplay---our exploration deepens this relationship, providing new tools with which to probe the nature of entanglement.

References in corpus (27)

• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Measurement-based quantum computation with cluster states
• Multi-party entanglement in graph states
• Time-Domain Multiplexed 2-Dimensional Cluster State: Universal Quantum Computing Platform
• Graph States for Quantum Secret Sharing
• Quantum error-correcting codes associated with graphs
• Silicon CMOS architecture for a spin-based quantum computer
• Graphical description of the action of local Clifford transformations on graph states
• Blueprint for a microwave trapped-ion quantum computer
• The Schmidt Measure as a Tool for Quantifying Multi-Particle Entanglement
• From three-photon GHZ states to ballistic universal quantum computation
• Multiparticle entanglement purification for graph states
• Fast simulation of stabilizer circuits using a graph state representation
• Measurement-based quantum repeaters
• Quantum network routing and local complementation
• Classical simulation versus universality in measurement based quantum computation
• On the Classification of All Self-Dual Additive Codes over GF(4) of Length up to 12
• An efficient algorithm to recognize local Clifford equivalence of graph states
• One-way quantum computing with arbitrarily large time-frequency continuous-variable cluster states from a single optical parametric oscillator
• Transforming graph states using single-qubit operations
• Optimal preparation of graph states
• Entanglement in eight-qubit graph states
• Physical-depth architectural requirements for generating universal photonic cluster states
• Hard limits on the postselectability of optical graph states
• Loss-tolerant teleportation on large stabilizer states
• Counting single-qubit Clifford equivalent graph states is #P-Complete
• Edge local complementation for logical cluster states

Cited by in corpus (19)

• Conference key agreement in a quantum network
• Complex Quantum Networks: a Topical Review
• Compilation of algorithm-specific graph states for quantum circuits
• Loss-tolerant architecture for quantum computing with quantum emitters
• Optimization of deterministic photonic graph state generation via local operations
• Efficient percolation simulations for lossy photonic fusion networks
• Engineering holography with stabilizer graph codes
• A Substrate Scheduler for Compiling Arbitrary Fault-tolerant Graph States
• Generating $k$ EPR-pairs from an $n$-party resource state
• Many-body quantum resources of graph states
• Generating graph states with a single quantum emitter and the minimum number of fusions
• Transforming graph states via Bell state measurements
• Tensor Rank and Other Multipartite Entanglement Measures of Graph States
• The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States
• Minimising the number of edges in LC-equivalent graph states
• Geometric Graph-Theoretic Aspects of Quantum Stabilizer Codes
• RELiQ: Scalable Entanglement Routing via Reinforcement Learning in Quantum Networks
• $\chi$-Colorable Graph States: Closed-Form Expressions and Quantum Orthogonal Arrays
• Pauli Flow on Open Graphs with Unknown Measurement Labels