An efficient numerical algorithm on irreducible multiparty correlations
arXiv:0909.3700 · doi:10.1088/0253-6102/61/2/07
Abstract
We develop a numerical algorithm to calculate the degrees of irreducible multiparty correlations for an arbitrary multiparty quantum state, which is efficient for any quantum state of up to five qubits. We demonstrate the power of the algorithm by the explicit calculations of the degrees of irreducible multiparty correlations in the 4-qubit GHZ state, the Smolin state, and the 5-qubit W state. This development takes a crucial step towards practical applications of irreducible multiparty correlations in real quantum many-body physics.
4 pages. Comments are welcome
References in corpus (6)
- On the quantum, classical and total amount of correlations in a quantum state
- Geometric phase of an atom in a magnetic storage ring
- Only n-Qubit Greenberger-Horne-Zeilinger States are Undetermined by their Reduced Density Matrices
- N-Qubit W States are Determined by their Bipartite Marginals
- Computing complexity measures for quantum states based on exponential families
- Irreducible multiparty correlation can be created by local operations