Testing equivalence of pure quantum states and graph states under SLOCC
arXiv:0911.4517 · doi:10.1142/S0219749910006368
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.
9 pages, to appear in International Journal of Quantum Information; Minor typos corrected, updated references.
References in corpus (17)
- Measurement-based quantum computation
- Experimental entanglement of six photons in graph states
- Experimental Analysis of a 4-Qubit Cluster State
- Novel schemes for measurement-based quantum computation
- Universal resources for measurement-based quantum computation
- Measurement-based quantum computation beyond the one-way model
- Realization and characterization of a 2-photon 4-qubit linear cluster state
- Inductive Entanglement Classification of Four Qubits under SLOCC
- Percolation, renormalization, and quantum computing with non-deterministic gates
- Generation of high-fidelity four-photon cluster state and quantum-domain demonstration of one-way quantum computing
- Fundamentals of universality in one-way quantum computation
- Ground state approximation for strongly interacting systems in arbitrary dimension
- Phase transition of computational power in the resource states for one-way quantum computation
- Graph states as ground states of many-body spin-1/2 Hamiltonians
- A variational method based on weighted graph states
- Random circuits by measurements on weighted graph states
- Classical spin systems and the quantum stabilizer formalism: general mappings and applications