Reduction criterion

Last updated

In quantum information theory, the reduction criterion is a necessary condition a mixed state must satisfy in order for it to be separable. In other words, the reduction criterion is a separability criterion. It was first proved [1] and independently formulated in 1999. [2] Violation of the reduction criterion is closely related to the distillability of the state in question. [1]

Contents

Details

Let H1 and H2 be Hilbert spaces of finite dimensions n and m respectively. L(Hi) will denote the space of linear operators acting on Hi. Consider a bipartite quantum system whose state space is the tensor product

An (un-normalized) mixed state ρ is a positive linear operator (density matrix) acting on H.

A linear map Φ: L(H2) → L(H1) is said to be positive if it preserves the cone of positive elements, i.e. A is positive implied Φ(A) is also.

From the one-to-one correspondence between positive maps and entanglement witnesses, we have that a state ρ is entangled if and only if there exists a positive map Φ such that

is not positive. Therefore, if ρ is separable, then for all positive map Φ,

Thus every positive, but not completely positive, map Φ gives rise to a necessary condition for separability in this way. The reduction criterion is a particular example of this.

Suppose H1 = H2. Define the positive map Φ: L(H2) → L(H1) by

It is known that Φ is positive but not completely positive. So a mixed state ρ being separable implies

Direct calculation shows that the above expression is the same as

where ρ1 is the partial trace of ρ with respect to the second system. The dual relation

is obtained in the analogous fashion. The reduction criterion consists of the above two inequalities.

Connection with Fréchet bounds

The above last two inequalities together with lower bounds for ρ can be seen as quantum Fréchet inequalities, that is as the quantum analogous of the classical Fréchet probabilistic bounds, that hold for separable quantum states. The upper bounds are the previous ones , , and the lower bounds are the obvious constraint together with , where are identity matrices of suitable dimensions. The lower bounds have been obtained in. [3] :Theorem A.16 These bounds are satisfied by separable density matrices, while entangled states can violate them. Entangled states exhibit a form of stochastic dependence stronger than the strongest classical dependence and in fact they violate Fréchet like bounds. It is also worth mentioning that is possible to give a Bayesian interpretation of these bounds. [3]

Related Research Articles

Quantum teleportation is a technique for transferring quantum information from a sender at one location to a receiver some distance away. While teleportation is commonly portrayed in science fiction as a means to transfer physical objects from one location to the next, quantum teleportation only transfers quantum information. The sender does not have to know the particular quantum state being transferred. Moreover, the location of the recipient can be unknown, but classical information needs to be sent from sender to receiver to complete the teleportation. Because classical information needs to be sent, teleportation can not occur faster than the speed of light.

Quantum entanglement Correlation between measurements of quantum subsystems, even when spatially separated

Quantum entanglement is a physical phenomenon that occurs when a group of particles are generated, interact, or share spatial proximity in a way such that the quantum state of each particle of the group cannot be described independently of the state of the others, including when the particles are separated by a large distance. The topic of quantum entanglement is at the heart of the disparity between classical and quantum physics: entanglement is a primary feature of quantum mechanics lacking in classical mechanics.

Quantum decoherence Loss of quantum coherence

Quantum decoherence is the loss of quantum coherence. In quantum mechanics, particles such as electrons are described by a wave function, a mathematical representation of the quantum state of a system; a probabilistic interpretation of the wave function is used to explain various quantum effects. As long as there exists a definite phase relation between different states, the system is said to be coherent. A definite phase relationship is necessary to perform quantum computing on quantum information encoded in quantum states. Coherence is preserved under the laws of quantum physics.

In quantum mechanics, a quantum operation is a mathematical formalism used to describe a broad class of transformations that a quantum mechanical system can undergo. This was first discussed as a general stochastic transformation for a density matrix by George Sudarshan. The quantum operation formalism describes not only unitary time evolution or symmetry transformations of isolated systems, but also the effects of measurement and transient interactions with an environment. In the context of quantum computation, a quantum operation is called a quantum channel.

In quantum information theory, a quantum channel is a communication channel which can transmit quantum information, as well as classical information. An example of quantum information is the state of a qubit. An example of classical information is a text document transmitted over the Internet.

The Peres–Horodecki criterion is a necessary condition, for the joint density matrix of two quantum mechanical systems and , to be separable. It is also called the PPT criterion, for positive partial transpose. In the 2x2 and 2x3 dimensional cases the condition is also sufficient. It is used to decide the separability of mixed states, where the Schmidt decomposition does not apply. The theorem was discovered in 1996 by Asher Peres and the Horodecki family

In quantum mechanics, separable states are quantum states belonging to a composite space that can be factored into individual states belonging to separate subspaces. A state is said to be entangled if it is not separable. In general, determining if a state is separable is not straightforward and the problem is classed as NP-hard.

LOCC Method in quantum computation and communication

LOCC, or local operations and classical communication, is a method in quantum information theory where a local (product) operation is performed on part of the system, and where the result of that operation is "communicated" classically to another part where usually another local operation is performed conditioned on the information received.

In quantum information theory, an entanglement witness is a functional which distinguishes a specific entangled state from separable ones. Entanglement witnesses can be linear or nonlinear functionals of the density matrix. If linear, then they can also be viewed as observables for which the expectation value of the entangled state is strictly outside the range of possible expectation values of any separable state.

In quantum information theory, the channel-state duality refers to the correspondence between quantum channels and quantum states. Phrased differently, the duality is the isomorphism between completely positive maps (channels) from A to Cn×n, where A is a C*-algebra and Cn×n denotes the n×n complex entries, and positive linear functionals (states) on the tensor product

In the case of systems composed of subsystems, the classification of quantum-entangledstates is richer than in the bipartite case. Indeed, in multipartite entanglement apart from fully separable states and fully entangled states, there also exists the notion of partially separable states.

In quantum mechanics, and especially quantum information theory, the purity of a normalized quantum state is a scalar defined as

A Werner state is a × -dimensional bipartite quantum state density matrix that is invariant under all unitary operators of the form . That is, it is a bipartite quantum state that satisfies

In quantum mechanics, negativity is a measure of quantum entanglement which is easy to compute. It is a measure deriving from the PPT criterion for separability. It has shown to be an entanglement monotone and hence a proper measure of entanglement.

In probabilistic logic, the Fréchet inequalities, also known as the Boole–Fréchet inequalities, are rules implicit in the work of George Boole and explicitly derived by Maurice Fréchet that govern the combination of probabilities about logical propositions or events logically linked together in conjunctions or disjunctions as in Boolean expressions or fault or event trees common in risk assessments, engineering design and artificial intelligence. These inequalities can be considered rules about how to bound calculations involving probabilities without assuming independence or, indeed, without making any dependence assumptions whatsoever. The Fréchet inequalities are closely related to the Boole–Bonferroni–Fréchet inequalities, and to Fréchet bounds.

The entropy of entanglement is a measure of the degree of quantum entanglement between two subsystems constituting a two-part composite quantum system. Given a pure bipartite quantum state of the composite system, it is possible to obtain a reduced density matrix describing knowledge of the state of a subsystem. The entropy of entanglement is the Von Neumann entropy of the reduced density matrix for any of the subsystems. If it is non-zero, i.e. the subsystem is in a mixed state, it indicates the two subsystems are entangled.

The min-entropy, in information theory, is the smallest of the Rényi family of entropies, corresponding to the most conservative way of measuring the unpredictability of a set of outcomes, as the negative logarithm of the probability of the most likely outcome. The various Rényi entropies are all equal for a uniform distribution, but measure the unpredictability of a nonuniform distribution in different ways. The min-entropy is never greater than the ordinary or Shannon entropy and that in turn is never greater than the Hartley or max-entropy, defined as the logarithm of the number of outcomes with nonzero probability.

In quantum information theory and operator theory, the Choi–Jamiołkowski isomorphism refers to the correspondence between quantum channels and quantum states, this is introduced by Man-Duen Choi and Andrzej Jamiołkowski. It is also called channel-state duality by some authors in the quantum information area, but mathematically, this is a more general correspondence between positive operators and the complete positive superoperators.

In quantum information, the diamond norm, also known as completely bounded trace norm, is a norm on the space of quantum operations, or more generally on any linear map that acts on complex matrices. Its main application is to measure the "single use distinguishability" of two quantum channels. If an agent is randomly given one of two quantum channels, permitted to pass one state through the unknown channel, and then measures the state in an attempt to determine which operation they were given, then their maximal probability of success is determined by the diamond norm of the difference of the two channels.


In quantum information and quantum computation, an entanglement monotone is a function that quantifies the amount of entanglement present in a quantum state. Any entanglement monotone is a nonnegative function whose value does not increase under local operations and classical communication.

References

  1. 1 2 M. Horodecki and P. Horodecki (1999). "Reduction criterion of separability and limits for a class of distillation protocols". Phys. Rev. A. 59 (6): 4206–4216. arXiv: quant-ph/9708015 . Bibcode:1999PhRvA..59.4206H. doi:10.1103/PhysRevA.59.4206.
  2. N. Cerf; et al. (1999). "Reduction criterion for separability". Phys. Rev. A. 60 (2): 898–909. arXiv: quant-ph/9710001 . Bibcode:1999PhRvA..60..898C. doi:10.1103/PhysRevA.60.898.
  3. 1 2 Benavoli, A.; Facchini, A.; Zaffalon, M. (10 October 2016). "Quantum mechanics: The Bayesian theory generalized to the space of Hermitian matrices". Physical Review A. 94 (4): 042106. arXiv: 1605.08177 . Bibcode:2016PhRvA..94d2106B. doi:10.1103/PhysRevA.94.042106. S2CID   19791149.