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

Bulletin of the American Physical Society

Quantum Discord Bounds the Amount of Distributed Entanglement

Marco Piani, T. K. Chuan, Jean Maillard, Kavan Kishore Modi, Tomasz Paterek, Mauro Paternostro

Published Mar 21, 2013• 0 citations
OpenAlex

Related papers

Quantum Discord Bounds the Amount of Distributed Entanglement

T. K. Chuan, J. Maillard, Kavan Kishore Modi +3 more

The ability to distribute quantum entanglement is a prerequisite for many fundamental tests of quantum theory and numerous quantum information protocols. Two distant parties can increase the amount of entanglement between them by means of quantum communication encoded in a carrier that is sent from one party to the other. Intriguingly, entanglement can be increased even when the exchanged carrier is not entangled with the parties. However, in light of the defining property of entanglement stating that it cannot increase under classical communication, the carrier must be quantum. Here we show that, in general, the increase of relative entropy of entanglement between two remote parties is bounded by the amount of nonclassical correlations of the carrier with the parties as quantified by the relative entropy of discord. We study implications of this bound, provide new examples of entanglement distribution via unentangled states, and put further limits on this phenomenon.

arXiv:1203.1268•Physical Review Letters•Aug 16, 2012•178 citations

Entanglement Distribution and Quantum Discord

Alexander Streltsov, Hermann Kampermann, Dagmar Bruß

arXiv:1610.05078•Quantum science and technology•Jan 1, 2017•5 citations

Studies on the Role of Entanglement in Mixed-state Quantum Computation

Animesh Datta

In this thesis, I look at the role of quantum entanglement in mixed-state quantum computation. The model we consider is the DQC1 or `power of one qubit' model. I show that there is minimal bipartite entanglement in a typical instance of the DQC1 circuit and even put an upper bound on the possible amount of entanglement. This limited amount of entanglement, however, does not imply that the system is classically simulatable. A matrix product state (MPS) algorithm for a typical instance of the DQC1 system requires exponential classical resources. This exposes a gap between the amount of entanglement and the amount of purely nonclassical correlations in a quantum system. This gap, I suggest, can be filled by quantum discord. I calculate it in a typical instance of the DQC1 circuit and find that the amount of discord is a constant fraction of the maximum possible discord for a system of that size. This allows an interpretation of quantum discord as the resource that drives mixed-state quantum computation. I also study quantum discord as a quantity of independent interest. Its role in the phenomenon of entanglement distribution is studied through an easily comprehensible example. This thesis also contains discussions on the relation between the complexity classes P, BQP and DQC1. Additional material is presented on the connections between the DQC1 model, Jones polynomials and statistical mechanics. The thesis concludes with a discussion of a few open problems related to the DQC1 model, the quantum discord and their scope in quantum information science.

arXiv:0807.4490•Jul 28, 2008•20 citations

Entanglement as the cross-symmetric part of quantum discord

Chunhe Xiong, Sunho Kim, Asutosh Kumar +3 more

arXiv:2303.10389•Physics Letters A•Jul 17, 2023•0 citations

Necessary and sufficient condition for saturating the upper bound of quantum discord

Zhengjun Xi, Xiao-Ming Lu, Xiaoguang Wang +1 more

We revisit the upper bound of quantum discord given by the von Neumann entropy of the measured subsystem. Using the Koashi-Winter relation, we obtain a tradeoff between the amount of classical correlation and quantum discord in the tripartite pure states. The difference between the quantum discord and its upper bound is interpreted as a measure on the classical correlative capacity. Further, we give the explicit characterization of the quantum states saturating the upper bound of quantum discord, through the equality condition for the Araki-Lieb inequality. We also demonstrate that the saturating of the upper bound of quantum discord precludes any further correlation between the measured subsystem and the environment.

arXiv:1111.3837•Physical Review A•Mar 6, 2012•32 citations

General bounds for quantum discord and discord distance

Feng Liu, Guojing Tian, Qiaoyan Wen +1 more

arXiv:1411.3772•Quantum Information Processing•Feb 12, 2015•8 citations
The ability to distribute quantum entanglement is a prerequisite for many fundamental tests of quantum theory and numerous quantum information protocols. Two distant parties can increase the amount of entanglement between them by means of quantum communication encoded in a carrier that is sent from one party to the other. Intriguingly, entanglement can be increased even when the exchanged carrier is not entangled with the parties. However, in light of the defining property of entanglement stating that it cannot increase under classical communication, the carrier must be quantum. Here we show that, in general, the increase of relative entropy of entanglement between two remote parties is bounded by the amount of nonclassical correlations of the carrier with the parties as quantified by the relative entropy of discord. We study implications of this bound, provide new examples of entanglement distribution via unentangled states, and put further limits on this phenomenon.
In this thesis, I look at the role of quantum entanglement in mixed-state quantum computation. The model we consider is the DQC1 or `power of one qubit' model. I show that there is minimal bipartite entanglement in a typical instance of the DQC1 circuit and even put an upper bound on the possible amount of entanglement. This limited amount of entanglement, however, does not imply that the system is classically simulatable. A matrix product state (MPS) algorithm for a typical instance of the DQC1 system requires exponential classical resources. This exposes a gap between the amount of entanglement and the amount of purely nonclassical correlations in a quantum system. This gap, I suggest, can be filled by quantum discord. I calculate it in a typical instance of the DQC1 circuit and find that the amount of discord is a constant fraction of the maximum possible discord for a system of that size. This allows an interpretation of quantum discord as the resource that drives mixed-state quantum computation. I also study quantum discord as a quantity of independent interest. Its role in the phenomenon of entanglement distribution is studied through an easily comprehensible example. This thesis also contains discussions on the relation between the complexity classes P, BQP and DQC1. Additional material is presented on the connections between the DQC1 model, Jones polynomials and statistical mechanics. The thesis concludes with a discussion of a few open problems related to the DQC1 model, the quantum discord and their scope in quantum information science.
We revisit the upper bound of quantum discord given by the von Neumann entropy of the measured subsystem. Using the Koashi-Winter relation, we obtain a tradeoff between the amount of classical correlation and quantum discord in the tripartite pure states. The difference between the quantum discord and its upper bound is interpreted as a measure on the classical correlative capacity. Further, we give the explicit characterization of the quantum states saturating the upper bound of quantum discord, through the equality condition for the Araki-Lieb inequality. We also demonstrate that the saturating of the upper bound of quantum discord precludes any further correlation between the measured subsystem and the environment.