Testing equivalence of pure quantum states and graph states under SLOCC

DOI10.1142/S0219749910006368MaRDI QIDQ3565452zbMATH OpenOpenAlexFDO

Authors Adam G. D'Souza, Jop Briët, David L. Feder

Publication date 3 June 2010

Published in International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0911.4517

zbMATH Keywords

graph statesSLOCCgeneral stabilizers

Mathematics Subject Classification ID

Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum state estimation, approximate cloning (81P50)

Abstract: A set of necessary and sufficient conditions are derived for the equivalence of an arbitrary pure state and a graph state on n qubits under stochastic local operations and classical communication (SLOCC), using the stabilizer formalism. Because all stabilizer states are equivalent to a graph state by local unitary transformations, these conditions constitute a classical algorithm for the determination of SLOCC-equivalence of pure states and stabilizer states. This algorithm provides a distinct advantage over the direct solution of the SLOCC-equivalence condition for an unknown invertible local operator S, as it usually allows for easy detection of states that are not SLOCC-equivalent to graph states.

Recommendations

• Criterion for SLOCC equivalence of multipartite quantum states
• Local unitary equivalence of multipartite pure states
• Criteria for SLOCC and LU equivalence of generic multi-qudit states
• A note on classification of quantum states under SLOCC
• Local unitary equivalence and entanglement of multipartite pure states

Cites work

• Classical spin systems and the quantum stabilizer formalism: general mappings and applications
• Graph states for quantum secret sharing
• Percolation, renormalization, and quantum computing with nondeterministic gates
• Remarks on duality transformations and generalized stabilizer states

Cited in

(3)

• Vector representations of graphs and distinguishing quantum product states with one-way LOCC
• Self-Testing Graph States
• \(N\)-qudit SLOCC equivalent \(W\) states are determined by their bipartite reduced density matrices with tree form

This page was built for publication: Testing equivalence of pure quantum states and graph states under SLOCC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565452)