Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Review of quantum discord in bipartite and multipartite systems

Jian-Song Zhang, Aixi Chen

Published Jan 1, 2012• 23 citations
OpenAlex

Abstract

Quantum information and computation, based on quantum correlations of quantum systems, is one of the promising new fields of physics and information science. Entanglement is the key resource of quantum information processing. However, it is shown recently that quantum entanglement is not the only kind of quantum correlations useful for quantum information processing. Quantum systems without any entanglement can still be helpful for quantum information processing since unentangled systems could have another kind of quantum correlations - quantum discord. Thus, quantum discord has drawn much attention in recent years. Here, we briefly review the concepts and properties of quantum discord. Several measures of discord including the original measure of discord, relative entropy-based discord, geometric discord, global discord, Gaussian discord, are reviewed and discussed.

Related papers

Quantum discord for two-qubit X states

Mazhar Ali, A. R. P. Rau, G. Alber

Quantum discord, a kind of quantum correlation, is defined as the difference between quantum mutual information and classical correlation in a bipartite system. In general, this correlation is different from entanglement, and quantum discord may be nonzero even for certain separable states. Even in the simple case of bipartite quantum systems, this different kind of quantum correlation has interesting and significant applications in quantum information processing. So far, quantum discord has been calculated explicitly only for a rather limited set of two-qubit quantum states and expressions for more general quantum states are not known. In this article, we derive explicit expressions for quantum discord for a larger class of two-qubit states, namely, a seven-parameter family of so called $X$ states that have been of interest in a variety of contexts in the field. We also study the relation between quantum discord, classical correlation, and entanglement for a number of two-qubit states to demonstrate that they are independent measures of correlation with no simple relative ordering between them.

arXiv:1002.3429•Physical Review A•Apr 12, 2010•835 citations

Quantum discord in quantum computation

Aharon Brodutch, Alexei Gilchrist, Daniel R Terno +1 more

Quantum discord is a measure of the quantumness of correlations. After reviewing its different versions and properties, we apply it to the questions of quantum information processing. First we show that changes in discord in the processed unentangled states indicate the need for entanglement in the distributed implementation of quantum gates. On the other hand, it was shown that zero system-environment discord is a necessary and sufficient condition for applicability of the standard completely positive description of the system's evolution. We demonstrate that this result does not translate into useful quantum process tomography. Depending on the details of the preparation procedure only absence of any initial correlations may guarantees consistency of the process tomography.

arXiv:1012.1402•Journal of Physics Conference Series•Jul 8, 2011•13 citations

A Brief Review on Quantum Correlations

Wang Fe

entanglement generated by the far beyond intuitive pure quantum phenomena such as EPRparadox,Schr?dinger's Equation has been considered not only as one of the significant notions in quantum theorybut also a key of realizing the Super Dense Coding and the Quantum Teleportation in quantum communication.However,recent researches show that quantum entanglement is less likely to account for all the properties of quan-tum correlations.Except for the quantum entanglement,researchers find other non-classical correlations like quan-tum discord,which plays a pivotal role in quantum information and quantum computation and that's why the purequbit-decisive quantum computer possesses computational efficiency.With this clarification,quantum discord com-pletely can be a new resource of quantum computation.In this paper,basic notions and measurement methods ofnon- classical correlations(including quantum entanglement) were discussed and the quantum correlationproperties of the quantum discord in various models were analyzed and compared with the quantum entanglement.Conducting researches on the non-classical correlations in various quantum systems are not merely meritorious tothe quantum theory,in the mean time,may provide some efficient thoughts and motivations for researchers to em-ploy theoretical concepts about quantum correlations for avoiding decoherence and theoretical scenario for the exper-iments.

Journal of Xinjiang Normal University•Jan 1, 2014•0 citations

Quantum discord in quantum computation

Aharon Brodutch, Alexei Gilchrist, Daniel R. Terno +1 more

Quantum discord is a measure of the quantumness of correlations. After reviewing its different versions and properties, we apply it to the questions of quantum information processing. First we show that changes in discord in the processed unentangled states indicate the need for entanglement in the distributed implementation of quantum gates. On the other hand, it was shown that zero system-environment discord is a necessary and sufficient condition for applicability of the standard completely positive description of the system's evolution. We demonstrate that this result does not translate into useful quantum process tomography. Depending on the details of the preparation procedure only absence of any initial correlations may guarantees consistency of the process tomography.

•Aug 17, 2016•9 citations

The role of quantum correlations beyond entanglement in quantum information theory

Alexander Streltsov

Quantum entanglement is the most popular kind of quantum correlations. Its role in several tasks in quantum information theory like quantum cryptography, quantum dense coding and quantum teleportation is indisputable. The role of entanglement in quantum algorithms has also attracted enormous amount of attention in the literature. The research in this direction is motivated by the finding that a quantum computer can efficiently factorize arbitrary integer numbers. Since no classical algorithm is known today that can solve this problem efficiently, this example clearly demonstrates the superiority of a quantum computer compared to its classical counterpart. In this context, entanglement also plays a crucial role: if the quantum computer operates on a pure state without entanglement, then the computational process can be simulated efficiently on a classical computer. In this case entanglement is the key ingredient that makes the difference between a quantum and a classical computer. However, the situation is more involved if the computational process is not perfect. In this case the quantum computer operates on a mixed state, and the role of entanglement is less obvious. A seminal result in this direction is a quantum algorithm known under the acronym DQC1. This algorithm operates on an almost maximally mixed state with vanishingly little entanglement. However, DQC1 can still perform tasks efficiently for which no efficient classical algorithm is known today. Thus, it is reasonable to assume that entanglement in general is not related to the efficiency of a quantum algorithm. Triggered by this observation other kinds of quantum correlations have been studied. In this context a particular measure of quantum correlations known as quantum discord is referred to frequently in the literature. Quantum discord is a measure of quantum correlations beyond entanglement, i.e., a quantum state can have no entanglement, but nonvanishing quantum discord. Quantum discord is also regarded as the key resource in the DQC1 algorithm. Although this statement is still controversial, it was shown under very general assumptions that quantum discord is required if a quantum computer is to show an exponential speedup over any classical algorithm. In this thesis we give a short introduction into the theory of entanglement and general quantum correlations, and further discuss our results. In particular, we show that two different kinds of entanglement measures can coincide. This result is used to build an algorithm for computing entanglement. We also consider the role of quantum correlations for the distribution of entanglement and for the quantum measurement process. We further discuss the behavior of quantum correlations under local noise, and their monogamy properties.

•Jan 1, 2013•1 citation

量子关联及其应用

Heng FAN, Bo LI

Quantum correlation is an important non-classical feature in quantum system, entanglement is regarded as one of the most important quantum correlations in quantum information processing. Many non-classical phenomena other than entanglement have been discovered in recent years. In this paper, we discuss quantum discord and some of the related correlations, and their application in quantum physics.

Scientia Sinica Informationis•Mar 1, 2014•0 citations
Quantum information and computation, based on quantum correlations of quantum systems, is one of the promising new fields of physics and information science. Entanglement is the key resource of quantum information processing. However, it is shown recently that quantum entanglement is not the only kind of quantum correlations useful for quantum information processing. Quantum systems without any entanglement can still be helpful for quantum information processing since unentangled systems could have another kind of quantum correlations - quantum discord. Thus, quantum discord has drawn much attention in recent years. Here, we briefly review the concepts and properties of quantum discord. Several measures of discord including the original measure of discord, relative entropy-based discord, geometric discord, global discord, Gaussian discord, are reviewed and discussed.
Quantum discord, a kind of quantum correlation, is defined as the difference between quantum mutual information and classical correlation in a bipartite system. In general, this correlation is different from entanglement, and quantum discord may be nonzero even for certain separable states. Even in the simple case of bipartite quantum systems, this different kind of quantum correlation has interesting and significant applications in quantum information processing. So far, quantum discord has been calculated explicitly only for a rather limited set of two-qubit quantum states and expressions for more general quantum states are not known. In this article, we derive explicit expressions for quantum discord for a larger class of two-qubit states, namely, a seven-parameter family of so called XXX states that have been of interest in a variety of contexts in the field. We also study the relation between quantum discord, classical correlation, and entanglement for a number of two-qubit states to demonstrate that they are independent measures of correlation with no simple relative ordering between them.
Quantum discord is a measure of the quantumness of correlations. After reviewing its different versions and properties, we apply it to the questions of quantum information processing. First we show that changes in discord in the processed unentangled states indicate the need for entanglement in the distributed implementation of quantum gates. On the other hand, it was shown that zero system-environment discord is a necessary and sufficient condition for applicability of the standard completely positive description of the system's evolution. We demonstrate that this result does not translate into useful quantum process tomography. Depending on the details of the preparation procedure only absence of any initial correlations may guarantees consistency of the process tomography.
entanglement generated by the far beyond intuitive pure quantum phenomena such as EPRparadox,Schr?dinger's Equation has been considered not only as one of the significant notions in quantum theorybut also a key of realizing the Super Dense Coding and the Quantum Teleportation in quantum communication.However,recent researches show that quantum entanglement is less likely to account for all the properties of quan-tum correlations.Except for the quantum entanglement,researchers find other non-classical correlations like quan-tum discord,which plays a pivotal role in quantum information and quantum computation and that's why the purequbit-decisive quantum computer possesses computational efficiency.With this clarification,quantum discord com-pletely can be a new resource of quantum computation.In this paper,basic notions and measurement methods ofnon- classical correlations(including quantum entanglement) were discussed and the quantum correlationproperties of the quantum discord in various models were analyzed and compared with the quantum entanglement.Conducting researches on the non-classical correlations in various quantum systems are not merely meritorious tothe quantum theory,in the mean time,may provide some efficient thoughts and motivations for researchers to em-ploy theoretical concepts about quantum correlations for avoiding decoherence and theoretical scenario for the exper-iments.
Quantum discord is a measure of the quantumness of correlations. After reviewing its different versions and properties, we apply it to the questions of quantum information processing. First we show that changes in discord in the processed unentangled states indicate the need for entanglement in the distributed implementation of quantum gates. On the other hand, it was shown that zero system-environment discord is a necessary and sufficient condition for applicability of the standard completely positive description of the system's evolution. We demonstrate that this result does not translate into useful quantum process tomography. Depending on the details of the preparation procedure only absence of any initial correlations may guarantees consistency of the process tomography.
Quantum entanglement is the most popular kind of quantum correlations. Its role in several tasks in quantum information theory like quantum cryptography, quantum dense coding and quantum teleportation is indisputable. The role of entanglement in quantum algorithms has also attracted enormous amount of attention in the literature. The research in this direction is motivated by the finding that a quantum computer can efficiently factorize arbitrary integer numbers. Since no classical algorithm is known today that can solve this problem efficiently, this example clearly demonstrates the superiority of a quantum computer compared to its classical counterpart. In this context, entanglement also plays a crucial role: if the quantum computer operates on a pure state without entanglement, then the computational process can be simulated efficiently on a classical computer. In this case entanglement is the key ingredient that makes the difference between a quantum and a classical computer. However, the situation is more involved if the computational process is not perfect. In this case the quantum computer operates on a mixed state, and the role of entanglement is less obvious. A seminal result in this direction is a quantum algorithm known under the acronym DQC1. This algorithm operates on an almost maximally mixed state with vanishingly little entanglement. However, DQC1 can still perform tasks efficiently for which no efficient classical algorithm is known today. Thus, it is reasonable to assume that entanglement in general is not related to the efficiency of a quantum algorithm. Triggered by this observation other kinds of quantum correlations have been studied. In this context a particular measure of quantum correlations known as quantum discord is referred to frequently in the literature. Quantum discord is a measure of quantum correlations beyond entanglement, i.e., a quantum state can have no entanglement, but nonvanishing quantum discord. Quantum discord is also regarded as the key resource in the DQC1 algorithm. Although this statement is still controversial, it was shown under very general assumptions that quantum discord is required if a quantum computer is to show an exponential speedup over any classical algorithm. In this thesis we give a short introduction into the theory of entanglement and general quantum correlations, and further discuss our results. In particular, we show that two different kinds of entanglement measures can coincide. This result is used to build an algorithm for computing entanglement. We also consider the role of quantum correlations for the distribution of entanglement and for the quantum measurement process. We further discuss the behavior of quantum correlations under local noise, and their monogamy properties.