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

arXiv:quant-ph/0002027 · Journal of Modern Optics

Preparation information and optimal decompositions for mixed quantum states

Andrei N. Soklakov, Rüdiger Schack

Published Oct 1, 2000• 4 citations
arXivHTMLPDF

Abstract

Consider a joint quantum state of a system and its environment. A measurement on the environment induces a decomposition of the system state. Using algorithmic information theory, we define the preparation information of a pure or mixed state in a given decomposition. We then define an optimal decomposition as a decomposition for which the average preparation information is minimal. The average preparation information for an optimal decomposition characterizes the system–environment correlations. We discuss properties and applications of the concepts introduced above and give several examples.

DOI
10.1080/09500340008235147

Related papers

Average quantum coherence of pure-state decomposition

Ming‐Jing Zhao, Teng Ma, Rajesh Pereira

We study the average quantum coherence over the pure state decompositions of a mixed quantum state. An upper bound of the average quantum coherence is provided, and sufficient conditions for the saturation of the upper bound are shown. These sufficient conditions always hold for two- and three-dimensional systems. This provides a tool to estimate the average coherence experimentally by measuring only the diagonal elements, which remarkably requires less measurements compared with state tomography. We then describe the pure state decompositions of the qubit state in the Bloch sphere geometrically. For any given qubit state, the optimal pure state decomposition achieving the maximal average quantum coherence as well as three other pure state decompositions are shown in the Bloch sphere. The order relations among their average quantum coherence are invariant for any coherence measure. The results presented in this paper are universal and suitable for all coherence measures.

arXiv:2105.02382•Physical Review A•Apr 29, 2021•6 citations

Two-qubit correlations revisited: average mutual information, relevant (and useful) observables and an application to remote state preparation

Paolo Giorda, Michele Allegra

Abstract Understanding how correlations can be used for quantum communication protocols is a central goal of quantum information science. While many authors have linked the global measures of correlations such as entanglement or discord to the performance of specific protocols, in general the latter may require only correlations between specific observables. In this work, we first introduce a general measure of correlations for two-qubit states, based on the classical mutual information between local observables. Our measure depends on the state’s purity and the symmetry in the correlation distribution, according to which we provide a classification of maximally mixed marginal states (MMMS). We discuss the complementarity relation between correlations and coherence. By focusing on a simple yet paradigmatic example, i.e. the remote state preparation protocol, we introduce a method to systematically define the proper protocol-tailored measures of the correlations. The method is based on the identification of those correlations that are relevant (useful) for the protocol. On the one hand, the approach allows the role of the symmetry of the correlation distribution to be discussed in determining the efficiency of the protocol, both for MMMS and general two-qubit quantum states, and on the other hand, it allows an optimized protocol for non-MMMS to be devised, which is more efficient with respect to the standard one. Overall, our findings clarify how the key resources in simple communication protocols are the purity of the state used and the symmetry of the correlation distribution.

arXiv:1606.02197•Journal of Physics A Mathematical and Theoretical•May 3, 2017•12 citations

A necessary and sufficient condition for optimal decompositions

T. Prager

An important measure of bipartite entanglement is the entanglement of formation, which is defined as the minimum average pure state entanglement of all decompositions realizing a given state. A decomposition which achieves this minimum is called an optimal decomposition. However, as for the entanglement of formation, there is not much known about the structure of such optimal decompositions, except for some special cases, like states of two qubits or isotropic states. Here we present a necessary and sufficient condition for a set of pure states of a finite dimensional bipartite system to form an optimal decomposition. This condition is well suited to treat the question, whether the entanglement of formation is additive or not.

arXiv:quant-ph/0106030•Jun 6, 2001•2 citations

Entanglement of Formation of an Arbitrary State of Two Qubits

William K. Wootters

The entanglement of a pure state of a pair of quantum systems is defined as the entropy of either member of the pair. The entanglement of formation of a mixed state $\ensuremath{\rho}$ is the minimum average entanglement of an ensemble of pure states that represents \ensuremath{\rho}. An earlier paper conjectured an explicit formula for the entanglement of formation of a pair of binary quantum objects (qubits) as a function of their density matrix, and proved the formula for special states. The present paper extends the proof to arbitrary states of this system and shows how to construct entanglement-minimizing decompositions.

arXiv:quant-ph/9709029•Physical Review Letters•Mar 9, 1998•8,356 citations

Linearly independent pure-state decomposition and quantum state discrimination

Luis Roa, M. Alid-Vaccarezza, Alejandra Maldonado-Trapp

We put the pure-state decomposition mathematical property of a mixed state to a physical test. We present a protocol for preparing two known nonorthogonal quantum states with well-defined a priori probabilities. Hence we characterize all the possible decompositions of a rank-two mixed state by means of the complex overlap between the two involved states. The physical test proposes a scheme for quantum state recognition of one of the two linearly independent states that arise from the decomposition. We find that the two states associated with the balanced pure-state decomposition have the smaller overlap modulus and therefore the smallest probability of being discriminated conclusively, while in the nonconclusive process they have the highest probability of having an error. In addition, we design an experimental scheme that allows discriminating conclusively and optimally two nonorthogonal states prepared with different a priori probabilities. Thus we propose a physical implementation for this linearly independent pure-state decomposition and state discrimination test by using twin photons generated in the process of spontaneous parametric down-conversion. The information state is encoded in a one-photon polarization state, whereas the second single photon is used for heralded detection.

arXiv:1010.5533•Physical Review A•Aug 18, 2011•7 citations

Bounding polynomial entanglement measures for mixed states

Samuel G. Rodriques, Nilanjana Datta, Peter J. Love

We generalize the notion of the best separable approximation (BSA) and best $W$-class approximation (BWA) to arbitrary pure-state entanglement measures, defining the best zero-$E$ approximation (BEA). We show that for any polynomial entanglement measure $E$, any mixed state $\ensuremath{\rho}$ admits at least one ``$S$ decomposition,'' i.e., a decomposition in terms of a mixed state on which $E$ is equal to zero, and a single additional pure state with (possibly) nonzero $E$. We show that the BEA is not, in general, the optimal $S$ decomposition from the point of view of bounding the entanglement of $\ensuremath{\rho}$ and describe an algorithm to construct the entanglement-minimizing $S$ decomposition for $\ensuremath{\rho}$ and place an upper bound on $E(\ensuremath{\rho})$. When applied to the three-tangle, the cost of the algorithm is linear in the rank $d$ of the density matrix and has an accuracy comparable to a steepest-descent algorithm whose cost scales as ${d}^{8}logd$. We compare the upper bound to a lower-bound algorithm given by C. Eltschka and J. Siewert [Phys. Rev. Lett. 108, 020502 (2012)] for the three-tangle and find that on random rank-2 three-qubit density matrices, the difference between the upper and lower bounds is $0.14$ on average. We also find that the three-tangle of random full-rank three-qubit density matrices is less than $0.023$ on average.

arXiv:1307.2323•Physical Review A•Jul 30, 2014•20 citations
Consider a joint quantum state of a system and its environment. A measurement on the environment induces a decomposition of the system state. Using algorithmic information theory, we define the preparation information of a pure or mixed state in a given decomposition. We then define an optimal decomposition as a decomposition for which the average preparation information is minimal. The average preparation information for an optimal decomposition characterizes the system–environment correlations. We discuss properties and applications of the concepts introduced above and give several examples.
We study the average quantum coherence over the pure state decompositions of a mixed quantum state. An upper bound of the average quantum coherence is provided, and sufficient conditions for the saturation of the upper bound are shown. These sufficient conditions always hold for two- and three-dimensional systems. This provides a tool to estimate the average coherence experimentally by measuring only the diagonal elements, which remarkably requires less measurements compared with state tomography. We then describe the pure state decompositions of the qubit state in the Bloch sphere geometrically. For any given qubit state, the optimal pure state decomposition achieving the maximal average quantum coherence as well as three other pure state decompositions are shown in the Bloch sphere. The order relations among their average quantum coherence are invariant for any coherence measure. The results presented in this paper are universal and suitable for all coherence measures.
Abstract Understanding how correlations can be used for quantum communication protocols is a central goal of quantum information science. While many authors have linked the global measures of correlations such as entanglement or discord to the performance of specific protocols, in general the latter may require only correlations between specific observables. In this work, we first introduce a general measure of correlations for two-qubit states, based on the classical mutual information between local observables. Our measure depends on the state’s purity and the symmetry in the correlation distribution, according to which we provide a classification of maximally mixed marginal states (MMMS). We discuss the complementarity relation between correlations and coherence. By focusing on a simple yet paradigmatic example, i.e. the remote state preparation protocol, we introduce a method to systematically define the proper protocol-tailored measures of the correlations. The method is based on the identification of those correlations that are relevant (useful) for the protocol. On the one hand, the approach allows the role of the symmetry of the correlation distribution to be discussed in determining the efficiency of the protocol, both for MMMS and general two-qubit quantum states, and on the other hand, it allows an optimized protocol for non-MMMS to be devised, which is more efficient with respect to the standard one. Overall, our findings clarify how the key resources in simple communication protocols are the purity of the state used and the symmetry of the correlation distribution.
An important measure of bipartite entanglement is the entanglement of formation, which is defined as the minimum average pure state entanglement of all decompositions realizing a given state. A decomposition which achieves this minimum is called an optimal decomposition. However, as for the entanglement of formation, there is not much known about the structure of such optimal decompositions, except for some special cases, like states of two qubits or isotropic states. Here we present a necessary and sufficient condition for a set of pure states of a finite dimensional bipartite system to form an optimal decomposition. This condition is well suited to treat the question, whether the entanglement of formation is additive or not.
The entanglement of a pure state of a pair of quantum systems is defined as the entropy of either member of the pair. The entanglement of formation of a mixed state $\ensuremath{\rho}$ is the minimum average entanglement of an ensemble of pure states that represents \ensuremath{\rho}. An earlier paper conjectured an explicit formula for the entanglement of formation of a pair of binary quantum objects (qubits) as a function of their density matrix, and proved the formula for special states. The present paper extends the proof to arbitrary states of this system and shows how to construct entanglement-minimizing decompositions.
We put the pure-state decomposition mathematical property of a mixed state to a physical test. We present a protocol for preparing two known nonorthogonal quantum states with well-defined a priori probabilities. Hence we characterize all the possible decompositions of a rank-two mixed state by means of the complex overlap between the two involved states. The physical test proposes a scheme for quantum state recognition of one of the two linearly independent states that arise from the decomposition. We find that the two states associated with the balanced pure-state decomposition have the smaller overlap modulus and therefore the smallest probability of being discriminated conclusively, while in the nonconclusive process they have the highest probability of having an error. In addition, we design an experimental scheme that allows discriminating conclusively and optimally two nonorthogonal states prepared with different a priori probabilities. Thus we propose a physical implementation for this linearly independent pure-state decomposition and state discrimination test by using twin photons generated in the process of spontaneous parametric down-conversion. The information state is encoded in a one-photon polarization state, whereas the second single photon is used for heralded detection.
We generalize the notion of the best separable approximation (BSA) and best WWW-class approximation (BWA) to arbitrary pure-state entanglement measures, defining the best zero-EEE approximation (BEA). We show that for any polynomial entanglement measure EEE, any mixed state $\ensuremath{\rho}$ admits at least one ``SSS decomposition,'' i.e., a decomposition in terms of a mixed state on which EEE is equal to zero, and a single additional pure state with (possibly) nonzero EEE. We show that the BEA is not, in general, the optimal SSS decomposition from the point of view of bounding the entanglement of $\ensuremath{\rho}$ and describe an algorithm to construct the entanglement-minimizing SSS decomposition for $\ensuremath{\rho}$ and place an upper bound on $E(\ensuremath{\rho})$. When applied to the three-tangle, the cost of the algorithm is linear in the rank ddd of the density matrix and has an accuracy comparable to a steepest-descent algorithm whose cost scales as d8logd{d}^{8}logdd8logd. We compare the upper bound to a lower-bound algorithm given by C. Eltschka and J. Siewert [Phys. Rev. Lett. 108, 020502 (2012)] for the three-tangle and find that on random rank-2 three-qubit density matrices, the difference between the upper and lower bounds is 0.140.140.14 on average. We also find that the three-tangle of random full-rank three-qubit density matrices is less than 0.0230.0230.023 on average.