Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Entanglement fidelity on a finite logical space

Definition

Let d≥1 be an integer, let H=Cd with standard orthonormal basis ∣0⟩,…,∣d−1⟩, and let E:L(H)→L(H) be a quantum channel. Use a second copy of H as a reference and set ∣Φd⟩=d−1/2∑j=0d−1∣j⟩⊗∣j⟩. For vectors u,v, write ∣u⟩⟨v∣ for the operator x↦⟨x,v⟩u, using the inner product linear in its first argument. The entanglement fidelity of E for the maximally mixed input I/d is

Fe(E)=⟨Φd∣(id⊗E)(∣Φd⟩⟨Φd∣)∣Φd⟩.

Here the bracket ⟨v∣A∣v⟩ means ⟨Av,v⟩, I is the identity on H, and id is the identity map on L(H). The tensor map acts on elementary operators by (id⊗E)(A⊗B)=A⊗E(B) and extends linearly. The pure-state overlap ⟨ψ∣E(∣ψ⟩⟨ψ∣)∣ψ⟩ for a unit vector ψ, and its infimum over unit vectors, are separately defined functionals; they need not equal Fe.

Facts & Assumptions

[F1]

A finite-dimensional quantum channel is complex-linear, completely positive and trace-preserving on all operators. Finite-dimensional quantum channel

[F2]

A density operator is a non-negative operator of trace one on a nonzero finite-dimensional space. Density operator

[F3]

Product basis vectors form an orthonormal basis of the ordered tensor register, with inner product linear in the first argument; the wire swap exchanges the two factors on product basis vectors and extends linearly. Ordered tensor registers, their inner product, and wire permutations

[F4]

In an ordered orthonormal product basis, the first-factor partial trace is given by (Tr⁡1X)ab=∑sX(s,a),(s,b), with matrix entries computed using the linear-first inner product. Partial trace over the first tensor factor

[F5]

Tensor products of the operator matrix units of two specified orthonormal bases form a basis of the endomorphisms of their tensor product. Tensor products of operator matrix units form a basis

[F6]

For a complex-linear map A:L(K)→L(K) and an ancilla R=Cr, the amplification A(r) acts on the R-indexed blocks of an operator on K⊗R by applying A to each block. Complete positivity means that this amplification preserves non-negativity for every integer r≥1. Completely positive maps

[F7]

For a real set S, a real number ℓ is its infimum when it is a lower bound of S and every lower bound of S is at most ℓ. Greatest lower bound (infimum)

[F8]

Every nonempty subset of R that is bounded below has an infimum in R. Every nonempty set bounded below has an infimum

Justification

Given: The finite space, standard basis, channel, rank-one-operator convention and tensor-map rule in the Definition. Write Ejk=∣j⟩⟨k∣ and PΦ=∣Φd⟩⟨Φd∣.

1.1 By [F3], the d matching product basis vectors are orthonormal, so ∥Φd∥=1. The operator PΦ is self-adjoint and satisfies ⟨PΦx,x⟩=∣⟨x,Φd⟩∣2≥0, and its trace is ∥Φd∥2=1, so it is a density operator by [F2]. Expanding gives PΦ=d−1∑j,kEjk⊗Ejk. The coordinate rule [F4] yields Tr⁡1(Ejk⊗Eℓm)=δjkEℓm, since summing the first-factor diagonal entries gives ∑sδsjδsk=δjk. Consequently Tr⁡1PΦ=d−1∑jEjj=I/d. [given, F2, F3, F4, algebra]

1.2 By [F5], prescribing Ejk⊗Eℓm↦Ejk⊗E(Eℓm) defines a unique linear map L on the full operator space. Expanding A and B in their matrix units shows L(A⊗B)=A⊗E(B), as required in the Definition. In the product basis, summing diagonal entries gives tr⁡(A⊗B)=tr⁡(A)tr⁡(B). Hence [F1] implies tr⁡L(Ejk⊗Eℓm)=tr⁡(Ejk)tr⁡E(Eℓm)=δjkδℓm=tr⁡(Ejk⊗Eℓm); linearity extends trace preservation to every input. [given, F1, F3, F5, algebra]

1.3 For every unit vector ψ∈H, put Pψ=∣ψ⟩⟨ψ∣. This operator is self-adjoint and satisfies ⟨Pψx,x⟩=∣⟨x,ψ⟩∣2≥0, so it is non-negative. Complete positivity in [F1] and the r=1 case of [F6] imply that E(Pψ) is non-negative. Thus fψ=⟨E(Pψ)ψ,ψ⟩ is real and nonnegative. Since d≥1, the unit vector ∣0⟩ exists, so SE={fψ:ψ∈H, ∥ψ∥=1} is a nonempty subset of R bounded below by 0. By [F8] it has a real infimum. By [F7], any two infima are each at most the other and hence equal; the infimum functional in the Definition is therefore well-defined. [given, F1, F6, F7, F8, algebra]

2.1 Let S(x⊗y)=y⊗x be the wire swap on H⊗H. It permutes the orthonormal product basis and satisfies S2=I, so it preserves inner products and ⟨Su,v⟩=⟨u,Sv⟩. If X is non-negative, SXS is self-adjoint and ⟨SXSy,y⟩=⟨XSy,Sy⟩≥0; thus conjugation by S preserves non-negativity. The block rule [F6] gives E(d)(B⊗A)=E(B)⊗A. Checking on the product operator basis [F5] therefore gives L(X)=SE(d)(SXS)S for every X. Complete positivity in [F1] and [F6] makes E(d) positive, so this identity proves positivity of the reference-first map L=id⊗E. [F1, F3, F5, F6, step 1.2, algebra]

3.1 Steps 1.1, 1.2 and 2.1 show that ρ=L(PΦ) is non-negative and has trace one, hence is a density operator by [F2]. In an orthonormal basis beginning with Φd, Fe(E)=⟨ρΦd,Φd⟩ is its first diagonal entry. All diagonal entries are non-negative and sum to one, so this is a well-defined real number in [0,1]. [F2, F3, step 1.1, step 1.2, step 2.1, algebra]

4.1 For the comparison example take d=2 and define R(X)=tr⁡(X)∣0⟩⟨0∣ on every operator X. This map is complex-linear and trace-preserving since tr⁡(∣0⟩⟨0∣)=1. For any r≥1, write X∈L(C2⊗Cr) uniquely as ∑a,b=01Eab⊗Xab. On elementary operator tensors the block rule [F6] acts as R(r)(Eab⊗B)=δabE00⊗B; [F5] extends this to R(r)(X)=E00⊗(X00+X11). If X is non-negative, each compression Xaa is self-adjoint and satisfies ⟨Xaay,y⟩=⟨X(∣a⟩⊗y),∣a⟩⊗y⟩≥0. The displayed output is self-adjoint and, on z=∣0⟩⊗u+∣1⟩⊗v, its quadratic form is ⟨(X00+X11)u,u⟩≥0. Thus every amplification is positive, proving complete positivity by [F6]; [F1] then makes R a channel. Direct expansion yields (id⊗R)(PΦ2)=(I2/2)⊗E00 and Fe(R)=1/4. For a unit vector ψ=a∣0⟩+b∣1⟩, its pure-state overlap is ∣a∣2, equal to 1 at ∣0⟩ and 0 at ∣1⟩, so 0 is a lower bound and every lower bound is at most the attained value 0. By [F7], its infimum is therefore 0. This verifies that these functionals need not equal entanglement fidelity. [F1, F3, F5, F6, F7, step 1.1, step 1.2, algebra] ∎

Depends on

Used by · 27

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

External dependencies

A simple formula for the average gate fidelity of a quantum dynamical operation · p. 1, paragraph defining entanglement fidelity; p. 2, paragraph preceding Eq. (11)

Entanglement fidelity is the overlap of a maximally entangled state with its image under the identity on a reference system tensored with the channel; a standard maximally entangled vector is the normalized sum of matching basis vectors.

Hypotheses: A finite-dimensional system and a trace-preserving quantum operation, with an equally sized reference system.

Reading limits: Read the entanglement-fidelity definition on p. 1 and the standard maximally entangled vector on p. 2 before Eq. (11). The local notation, normalization, partial-trace, tensor-map, positivity and replacement-channel calculations are locally authored adaptations; no reconstruction of the paper's average-fidelity proof or source audit is claimed.

Sources