Fidelity of quantum states

Short description: Term in quantum mechanics

In quantum mechanics, notably in quantum information theory, fidelity quantifies the "closeness" between two density matrices. It expresses the probability that one state will pass a test to identify as the other. It is not a metric on the space of density matrices, but it can be used to define the Bures metric on this space.

## Contents

* 1 Definition
* 2 Motivation from classical counterpart
* 3 Equivalent expressions
* 3.1 Equivalent expression via trace norm
* 3.2 Equivalent expression via characteristic polynomials
* 3.3 Expressions for pure states
* 4 Properties
* 4.1 Unitary invariance
* 4.2 Relationship with the fidelity between the corresponding probability distributions
* 4.2.1 Proof of inequality
* 4.3 Behavior under quantum operations
* 4.4 Relationship to trace distance
* 5 Uhlmann's theorem
* 5.1 Sketch of proof
* 5.2 Proof with explicit decompositions
* 5.3 Consequences
* 6 References

## Definition

The fidelity between two quantum states ρ and σ, expressed as density matrices, is commonly defined as:[1][2]

F(ρ,σ)=(tr⁡ρσρ)2.

The square roots in this expression are well-defined because both ρ and ρσρ are positive semidefinite matrices, and the square root of a positive semidefinite matrix is defined via the spectral theorem. The Euclidean inner product from the classical definition is replaced by the Hilbert–Schmidt inner product.

As will be discussed in the following sections, this expression can be simplified in various cases of interest. In particular, for pure states, ρ=|ψρ⟩⟨ψρ| and σ=|ψσ⟩⟨ψσ|, it equals:F(ρ,σ)=|⟨ψρ|ψσ⟩|2.This tells us that the fidelity between pure states has a straightforward interpretation in terms of probability of finding the state |ψρ⟩ when measuring |ψσ⟩ in a basis containing |ψρ⟩.

Some authors use an alternative definition F′:=F and call this quantity fidelity.[2] The definition of F however is more common.[3][4][5] To avoid confusion, F′ could be called "square root fidelity". In any case it is advisable to clarify the adopted definition whenever the fidelity is employed.

## Motivation from classical counterpart

Given two random variables X,Y with values (1,...,n) (categorical random variables) and probabilities p=(p1,p2,…,pn) and q=(q1,q2,…,qn), the fidelity of X and Y is defined to be the quantity

F(X,Y)=(∑ipiqi)2.

The fidelity deals with the marginal distribution of the random variables. It says nothing about the joint distribution of those variables. In other words, the fidelity F(X,Y) is the square of the inner product of (p1,…,pn) and (q1,…,qn) viewed as vectors in Euclidean space. Notice that F(X,Y)=1 if and only if p=q. In general, 0≤F(X,Y)≤1. The measure ∑ipiqi is known as the Bhattacharyya coefficient.

Given a classical measure of the distinguishability of two probability distributions, one can motivate a measure of distinguishability of two quantum states as follows: if an experimenter is attempting to determine whether a quantum state is either of two possibilities ρ or σ, the most general possible measurement they can make on the state is a POVM, which is described by a set of Hermitian positive semidefinite operators {Fi}. When measuring a state ρ with this POVM, i-th outcome is found with probability pi=tr⁡(ρFi), and likewise with probability qi=tr⁡(σFi) for σ. The ability to distinguish between ρ and σ is then equivalent to their ability to distinguish between the classical probability distributions p and q. A natural question is then to ask what is the POVM the makes the two distributions as distinguishable as possible, which in this context means to minimize the Bhattacharyya coefficient over the possible choices of POVM. Formally, we are thus led to define the fidelity between quantum states as:

F(ρ,σ)=min{Fi}F(X,Y)=min{Fi}(∑itr⁡(ρFi)tr⁡(σFi))2.

It was shown by Fuchs and Caves[6] that the minimization in this expression can be computed explicitly, with solution the projective POVM corresponding to measuring in the eigenbasis of σ−1/2|σρ|σ−1/2, and results in the common explicit expression for the fidelity asF(ρ,σ)=(tr⁡ρσρ)2.

## Equivalent expressions

### Equivalent expression via trace norm

An equivalent expression for the fidelity between arbitrary states via the trace norm is:

F(ρ,σ)=‖ρσ‖tr2=(tr⁡|ρσ|)2,

where the absolute value of an operator is here defined as |A|≡A†A.

### Equivalent expression via characteristic polynomials

Since the trace of a matrix is equal to the sum of its eigenvalues

F(ρ,σ)=∑jλj,

where the λj are the eigenvalues of ρσρ, which is positive semidefinite by construction and so the square roots of the eigenvalues are well defined. Because the characteristic polynomial of a product of two matrices is independent of the order, the spectrum of a matrix product is invariant under cyclic permutation, and so these eigenvalues can instead be calculated from ρσ.[7][8] Reversing the trace property leads to

F(ρ,σ)=(tr⁡ρσ)2.

### Expressions for pure states

If (at least) one of the two states is pure, for example ρ=|ψρ⟩⟨ψρ|, the fidelity simplifies toF(ρ,σ)=tr⁡(σρ)=⟨ψρ|σ|ψρ⟩.This follows observing that if ρ is pure then ρ=ρ, and thusF(ρ,σ)=(tr⁡|ψρ⟩⟨ψρ|σ|ψρ⟩⟨ψρ|)2=⟨ψρ|σ|ψρ⟩(tr⁡|ψρ⟩⟨ψρ|)2=⟨ψρ|σ|ψρ⟩.

If both states are pure, ρ=|ψρ⟩⟨ψρ| and σ=|ψσ⟩⟨ψσ|, then we get the even simpler expression:F(ρ,σ)=|⟨ψρ|ψσ⟩|2.

## Properties

Some of the important properties of the quantum state fidelity are:

* Symmetry. F(ρ,σ)=F(σ,ρ).
* Bounded values. For any ρ and σ, 0≤F(ρ,σ)≤1, and F(ρ,ρ)=1.
* Consistency with fidelity between probability distributions. If ρ and σ commute, the definition simplifies to F(ρ,σ)=[tr⁡ρσ]2=(∑kpkqk)2=F(p,q),where pk,qk are the eigenvalues of ρ,σ, respectively. To see this, remember that if [ρ,σ]=0 then they can be diagonalized in the same basis: ρ=∑ipi|i⟩⟨i| and σ=∑iqi|i⟩⟨i|,so that tr⁡ρσ=tr⁡(∑kpkqk|k⟩⟨k|)=∑kpkqk.
* Explicit expression for qubits.

If ρ and σ are both qubit states, the fidelity can be computed as [1] [9]

F(ρ,σ)=tr⁡(ρσ)+2det⁡(ρ)det⁡(σ).

Qubit state means that ρ and σ are represented by two-dimensional matrices. This result follows noticing that M=ρσρ is a positive semidefinite operator, hence tr⁡M=λ1+λ2, where λ1 and λ2 are the (nonnegative) eigenvalues of M. If ρ (or σ) is pure, this result is simplified further to F(ρ,σ)=tr⁡(ρσ) since Det(ρ)=0 for pure states.

### Unitary invariance

Direct calculation shows that the fidelity is preserved by unitary evolution, i.e.

F(ρ,σ)=F(UρU*,UσU*)

for any unitary operator U.

### Relationship with the fidelity between the corresponding probability distributions

Let {Ek}k be an arbitrary positive operator-valued measure (POVM); that is, a set of positive semidefinite operators Ek satisfying ∑kEk=I. Then, for any pair of states ρ and σ, we have F(ρ,σ)≤∑ktr⁡(Ekρ)tr⁡(Ekσ)≡∑kpkqk, where in the last step we denoted with pk≡tr⁡(Ekρ) and qk≡tr⁡(Ekσ) the probability distributions obtained by measuring ρ, σ with the POVM {Ek}k.

This shows that the square root of the fidelity between two quantum states is upper bounded by the Bhattacharyya coefficient between the corresponding probability distributions in any possible POVM. Indeed, it is more generally true that F(ρ,σ)=min{Ek}F(p,q), where F(p,q)≡(∑kpkqk)2, and the minimum is taken over all possible POVMs. More specifically, one can prove that the minimum is achieved by the projective POVM corresponding to measuring in the eigenbasis of the operator σ−1/2|σρ|σ−1/2.[10]

#### Proof of inequality

As was previously shown, the square root of the fidelity can be written as F(ρ,σ)=tr⁡|ρσ|,which is equivalent to the existence of a unitary operator U such that

F(ρ,σ)=tr⁡(ρσU).Remembering that ∑kEk=I holds true for any POVM, we can then writeF(ρ,σ)=tr⁡(ρσU)=∑ktr⁡(ρEkσU)=∑ktr⁡(ρEkEkσU)≤∑ktr⁡(Ekρ)tr⁡(Ekσ),where in the last step we used Cauchy-Schwarz inequality as in |tr⁡(A†B)|2≤tr⁡(A†A)tr⁡(B†B).

### Behavior under quantum operations

The fidelity between two states can be shown to never decrease when a non-selective quantum operation ℰ is applied to the states:[11]F(ℰ(ρ),ℰ(σ))≥F(ρ,σ), for any trace-preserving completely positive map ℰ.

### Relationship to trace distance

We can define the trace distance between two matrices A and B in terms of the trace norm by

D(A,B)=12‖A−B‖tr.

When A and B are both density operators, this is a quantum generalization of the statistical distance. This is relevant because the trace distance provides upper and lower bounds on the fidelity as quantified by the Fuchs–van de Graaf inequalities,[12]

1−F(ρ,σ)≤D(ρ,σ)≤1−F(ρ,σ).

Often the trace distance is easier to calculate or bound than the fidelity, so these relationships are quite useful. In the case that at least one of the states is a pure state Ψ, the lower bound can be tightened.

1−F(ψ,ρ)≤D(ψ,ρ).

## Uhlmann's theorem

We saw that for two pure states, their fidelity coincides with the overlap. Uhlmann's theorem, named after Armin Uhlmann (de) who published it in 1976,[13] generalizes this statement to mixed states, in terms of their purifications:

Theorem Let ρ and σ be density matrices acting on Cn. Let ρ​1⁄2 be the unique positive square root of ρ and

|ψρ⟩=∑i=1n(ρ1/2|ei⟩)⊗|ei⟩∈ℂn⊗ℂn

be a purification of ρ (therefore {|ei⟩} is an orthonormal basis), then the following equality holds:

F(ρ,σ)=max|ψσ⟩|⟨ψρ|ψσ⟩|2

where |ψσ⟩ is a purification of σ. Therefore, in general, the fidelity is the maximum overlap between purifications.

### Sketch of proof

A simple proof can be sketched as follows. Let |Ω⟩ denote the vector

|Ω⟩=∑i=1n|ei⟩⊗|ei⟩

and σ​1⁄2 be the unique positive square root of σ. We see that, due to the unitary freedom in square root factorizations and choosing orthonormal bases, an arbitrary purification of σ is of the form

|ψσ⟩=(σ1/2V1⊗V2)|Ω⟩

where Vi's are unitary operators. Now we directly calculate

|⟨ψρ|ψσ⟩|2=|⟨Ω|(ρ1/2⊗I)(σ1/2V1⊗V2)|Ω⟩|2=|tr⁡(ρ1/2σ1/2V1V2T)|2.

But in general, for any square matrix A and unitary U, it is true that |tr(AU)| ≤ tr((A*A)​1⁄2). Furthermore, equality is achieved if U* is the unitary operator in the polar decomposition of A. From this follows directly Uhlmann's theorem.

### Proof with explicit decompositions

We will here provide an alternative, explicit way to prove Uhlmann's theorem.

Let |ψρ⟩ and |ψσ⟩ be purifications of ρ and σ, respectively. To start, let us show that |⟨ψρ|ψσ⟩|≤tr⁡|ρσ|.

The general form of the purifications of the states is:|ψρ⟩=∑kλk|λk⟩⊗|uk⟩,|ψσ⟩=∑kμk|μk⟩⊗|vk⟩,were |λk⟩,|μk⟩ are the eigenvectors of ρ, σ, and {uk}k,{vk}k are arbitrary orthonormal bases. The overlap between the purifications is⟨ψρ|ψσ⟩=∑jkλjμk⟨λj|μk⟩⟨uj|vk⟩=tr⁡(ρσU),where the unitary matrix U is defined asU=(∑k|μk⟩⟨uk|)(∑j|vj⟩⟨λj|).The conclusion is now reached via using the inequality |tr⁡(AU)|≤tr⁡(A†A)≡tr⁡|A|: |⟨ψρ|ψσ⟩|=|tr⁡(ρσU)|≤tr⁡|ρσ|.Note that this inequality is the triangle inequality applied to the singular values of the matrix. Indeed, for a generic matrix A≡∑jsj(A)|aj⟩⟨bj|and unitary U=∑j|bj⟩⟨wj|, we have|tr⁡(AU)|=|tr⁡(∑jsj(A)|aj⟩⟨bj|∑k|bk⟩⟨wk|)|=|∑jsj(A)⟨wj|aj⟩|≤∑jsj(A)|⟨wj|aj⟩|≤∑jsj(A)=tr⁡|A|,where sj(A)≥0 are the (always real and non-negative) singular values of A, as in the singular value decomposition. The inequality is saturated and becomes an equality when ⟨wj|aj⟩=1, that is, when U=∑k|bk⟩⟨ak|, and thus AU=AA†≡|A|. The above shows that |⟨ψρ|ψσ⟩|=tr⁡|ρσ| when the purifications |ψρ⟩ and |ψσ⟩ are such that ρσU=|ρσ|. Because this choice is possible regardless of the states, we can finally conclude thattr⁡|ρσ|=max⁡|⟨ψρ|ψσ⟩|.

### Consequences

Some immediate consequences of Uhlmann's theorem are

* Fidelity is symmetric in its arguments, i.e. F (ρ,σ) = F (σ,ρ). Note that this is not obvious from the original definition.
* F (ρ,σ) lies in [0,1], by the Cauchy–Schwarz inequality.
* F (ρ,σ) = 1 if and only if ρ = σ, since Ψρ = Ψσ implies ρ = σ.

So we can see that fidelity behaves almost like a metric. This can be formalized and made useful by defining

cos2θρσ=F(ρ,σ)

As the angle between the states ρ and σ. It follows from the above properties that θρσ is non-negative, symmetric in its inputs, and is equal to zero if and only if ρ=σ. Furthermore, it can be proved that it obeys the triangle inequality,[2] so this angle is a metric on the state space: the Fubini–Study metric.[14]

## References

1. ↑ 1.0 1.1 R. Jozsa, Fidelity for Mixed Quantum States, J. Mod. Opt. 41, 2315--2323 (1994). DOI: http://doi.org/10.1080/09500349414552171
2. ↑ 2.0 2.1 2.2 Nielsen, Michael A.; Chuang, Isaac L. (2000). Quantum Computation and Quantum Information. Cambridge University Press. doi:10.1017/CBO9780511976667. ISBN 978-0521635035. http://www.michaelnielsen.org/qcqi/.
3. ↑ Bengtsson, Ingemar (2017). Geometry of Quantum States: An Introduction to Quantum Entanglement. Cambridge, United Kingdom New York, NY: Cambridge University Press. ISBN 978-1-107-02625-4.
4. ↑ Walls, D. F.; Milburn, G. J. (2008). Quantum Optics. Berlin: Springer. ISBN 978-3-540-28573-1.
5. ↑ Jaeger, Gregg (2007). Quantum Information: An Overview. New York London: Springer. ISBN 978-0-387-35725-6.
6. ↑ C. A. Fuchs, C. M. Caves: "Ensemble-Dependent Bounds for Accessible Information in Quantum Mechanics", Physical Review Letters 73, 3047(1994)
7. ↑ Audenaert, Koenraad M.R.; Datta, Nilanjana (2015). "alpha-z-relative Renyi entropies". Journal of Mathematical Physics 56: 022202, Equation (4) with α=z=1/2. doi:10.1063/1.4906367.
8. ↑ Baldwin, Andrew J.; Jones, Jonathan A. (2023). "Efficiently computing the Uhlmann fidelity for density matrices". Physical Review A 107 (1). doi:10.1103/PhysRevA.107.012427. Bibcode: 2023PhRvA.107a2427B.
9. ↑ M. Hübner, Explicit Computation of the Bures Distance for Density Matrices, Phys. Lett. A 163, 239--242 (1992). DOI: https://doi.org/10.1016/0375-9601(92)91004-B
10. ↑ Watrous, John (2018-04-26). The Theory of Quantum Information. Cambridge University Press. doi:10.1017/9781316848142. ISBN 978-1-316-84814-2. http://dx.doi.org/10.1017/9781316848142.
11. ↑ Nielsen, M. A. (1996-06-13). "The entanglement fidelity and quantum error correction". arXiv:quant-ph/9606012.
12. ↑ C. A. Fuchs and J. van de Graaf, "Cryptographic Distinguishability Measures for Quantum Mechanical States", IEEE Trans. Inf. Theory 45, 1216 (1999). arXiv:quant-ph/9712042
13. ↑ Uhlmann, A. (1976). "The "transition probability" in the state space of a ∗-algebra". Reports on Mathematical Physics 9 (2): 273–279. doi:10.1016/0034-4877(76)90060-4. ISSN 0034-4877. Bibcode: 1976RpMP....9..273U. http://www.physik.uni-leipzig.de/~uhlmann/PDF/Uh76a.pdf.
14. ↑ K. Życzkowski, I. Bengtsson, Geometry of Quantum States, Cambridge University Press, 2008, 131

* Quantiki: Fidelity

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Fidelity of quantum states. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Fidelity_of_quantum_states&oldid=4348999"