Hierarchy of graph-diagonal states based on quantum discord and entanglement classification
- 64 Downloads
For the relative entropy-based measure of quantum discord the key idea is to find the closest classical state (CCS) for a given state ρ, which is in general a more complicated problem. In this work, we study three and four qubit graph-diagonal states and give the explicit expressions of CCS for these states. Using the CCS, we compute the quantum discord of graph-diagonal states of three and four qubit systems and show that there is a hierarchy for the quantum discord of graph-diagonal states of any three and four qubit systems. Then we classify the entanglement of graph-diagonal states of three and four qubit systems and draw the hierarchy of entanglement of these graph-diagonal states. Finally, we compare the hierarchy of quantum discord and quantum entanglement of the these graph-diagonal states and show that the hierarchy of quantum entanglement is at least in equivalence of quantum discord.
- 4.M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000)Google Scholar
- 9.H. Ollivier, W.H. Zurek, Phys. Rev. Lett. 017901, 88 (2001)Google Scholar
- 25.J. Zhang, A. Chen, Quantum Phys. Lett. 1, 2 (2012)Google Scholar
- 26.M. Hein et al., in Quantum Computers, Algorithms and Chaos, edited by G. Casati, D.L. Shepelyansky, P. Zoller, G. Benenti (IOS, Amsterdam, 2006)Google Scholar