Testing equivalence of pure quantum states and graph states under SLOCC

From MaRDI portal
Publication:3565452

DOI10.1142/S0219749910006368zbMATH Open1189.81027arXiv0911.4517OpenAlexW2112388557MaRDI QIDQ3565452FDOQ3565452


Authors: Adam G. D'Souza, Jop Briët, David L. Feder Edit this on Wikidata


Publication date: 3 June 2010

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

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.


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




Recommendations




Cites Work


Cited In (3)





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)