Local unitary versus local Clifford equivalence of stabilizer states

Abstract

We study the relation between local unitary (LU) equivalence and local Clifford (LC) equivalence of stabilizer states. We introduce a large subclass of stabilizer states, such that every two LU equivalent states in this class are necessarily LC equivalent. Together with earlier results, this shows that LC, LU and SLOCC equivalence are the same notions for this class of stabilizer states. Moreover, recognizing whether two given stabilizer states in the present subclass are locally equivalent only requires a polynomial number of operations in the number of qubits.

8 pages, replaced with published version

References in corpus (4)

• Multi-party entanglement in graph states
• Valence Bond Solids for Quantum Computation
• Bell Inequalities for Graph States
• Finite set of invariants to characterize local Clifford equivalence of stabilizer states

Cited by in corpus (40)

• Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
• Entanglement Detection in the Stabilizer Formalism
• Prospects for measurement-based quantum computing with solid state spins
• Entanglement on mixed stabiliser states--I: Normal Forms and Reduction Procedures
• Multipartite Entanglement in Stabilizer Tensor Networks
• GHZ extraction yield for multipartite stabilizer states
• Optical generation of matter qubit graph states
• Subsystem stabilizer codes cannot have a universal set of transversal gates for even one encoded qudit
• Generation of arbitrary all-photonic graph states from quantum emitters
• Local unitary versus local Clifford equivalence of stabilizer and graph states
• Entanglement in eight-qubit graph states
• LIMDD: A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States
• Entanglement in highly symmetric multipartite quantum states
• Graphical description of the action of Clifford operators on stabilizer states
• Graph states and local unitary transformations beyond local Clifford operations
• Graphical description of local Gaussian operations for continuous-variable weighted graph states
• Tripartite Entanglement in Qudit Stabilizer States and Application in Quantum Error Correction
• Finite set of invariants to characterize local Clifford equivalence of stabilizer states
• Extracting GHZ states from linear cluster states
• Fast graph operations in quantum computation
• Symmetries and entanglement of stabilizer states
• Near-term $n$ to $k$ distillation protocols using graph codes
• Efficient Inner-product Algorithm for Stabilizer States
• Compact set of invariants characterizing graph states of up to eight qubits
• On Geometric Algebra representation of Binary Spatter Codes
• Minimal instances for toric code ground states
• Graph Picture of Linear Quantum Networks and Entanglement
• On Local Equivalence, Surface Code States and Matroids
• Transversality versus Universality for Additive Quantum Codes
• On the local equivalence of complete bipartite and repeater graph states
• Gottesman Types for Quantum Programs
• Broadcasting single-qubit and multi-qubit-entangled states: authentication, cryptography, and distributed quantum computation
• A trace distance-based geometric analysis of the stabilizer polytope for few-qubit systems
• Finite-Function-Encoding Quantum States
• Learning quantum graph states with product measurements
• The Study of Entangled States in Quantum Computation and Quantum Information Science
• Distinguishing Graph States by the Properties of Their Marginals
• Automorphisms of stabilizer codes
• Covering a Graph with Minimal Local Sets
• Graph States and the Variety of Principal Minors