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 be an integer, let with standard orthonormal basis , and let be a quantum channel. Use a second copy of as a reference and set . For vectors , write for the operator , using the inner product linear in its first argument. The entanglement fidelity of for the maximally mixed input is
Here the bracket means , is the identity on , and is the identity map on . The tensor map acts on elementary operators by and extends linearly. The pure-state overlap for a unit vector , and its infimum over unit vectors, are separately defined functionals; they need not equal .
Definition references
Facts & Assumptions
A finite-dimensional quantum channel is complex-linear, completely positive and trace-preserving on all operators. Finite-dimensional quantum channel
A density operator is a non-negative operator of trace one on a nonzero finite-dimensional space. Density operator
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
In an ordered orthonormal product basis, the first-factor partial trace is given by , with matrix entries computed using the linear-first inner product. Partial trace over the first tensor factor
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
For a complex-linear map and an ancilla , the amplification acts on the -indexed blocks of an operator on by applying to each block. Complete positivity means that this amplification preserves non-negativity for every integer . Completely positive maps
For a real set , a real number is its infimum when it is a lower bound of and every lower bound of is at most . Greatest lower bound (infimum)
Every nonempty subset of that is bounded below has an infimum in . 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 and .
1.1 By [F3], the matching product basis vectors are orthonormal, so . The operator is self-adjoint and satisfies , and its trace is , so it is a density operator by [F2]. Expanding gives . The coordinate rule [F4] yields , since summing the first-factor diagonal entries gives . Consequently . [given, F2, F3, F4, algebra]
1.2 By [F5], prescribing defines a unique linear map on the full operator space. Expanding and in their matrix units shows , as required in the Definition. In the product basis, summing diagonal entries gives . Hence [F1] implies ; linearity extends trace preservation to every input. [given, F1, F3, F5, algebra]
1.3 For every unit vector , put . This operator is self-adjoint and satisfies , so it is non-negative. Complete positivity in [F1] and the case of [F6] imply that is non-negative. Thus is real and nonnegative. Since , the unit vector exists, so is a nonempty subset of bounded below by . 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 be the wire swap on . It permutes the orthonormal product basis and satisfies , so it preserves inner products and . If is non-negative, is self-adjoint and ; thus conjugation by preserves non-negativity. The block rule [F6] gives . Checking on the product operator basis [F5] therefore gives for every . Complete positivity in [F1] and [F6] makes positive, so this identity proves positivity of the reference-first map . [F1, F3, F5, F6, step 1.2, algebra]
3.1 Steps 1.1, 1.2 and 2.1 show that is non-negative and has trace one, hence is a density operator by [F2]. In an orthonormal basis beginning with , is its first diagonal entry. All diagonal entries are non-negative and sum to one, so this is a well-defined real number in . [F2, F3, step 1.1, step 1.2, step 2.1, algebra]
4.1 For the comparison example take and define on every operator . This map is complex-linear and trace-preserving since . For any , write uniquely as . On elementary operator tensors the block rule [F6] acts as ; [F5] extends this to . If is non-negative, each compression is self-adjoint and satisfies . The displayed output is self-adjoint and, on , its quadratic form is . Thus every amplification is positive, proving complete positivity by [F6]; [F1] then makes a channel. Direct expansion yields and . For a unit vector , its pure-state overlap is , equal to at and at , so is a lower bound and every lower bound is at most the attained value . By [F7], its infimum is therefore . This verifies that these functionals need not equal entanglement fidelity. [F1, F3, F5, F6, F7, step 1.1, step 1.2, algebra] ∎
Depends on
- Finite-dimensional quantum channel
- Density operator
- Ordered tensor registers, their inner product, and wire permutations
- Partial trace over the first tensor factor
- Tensor products of operator matrix units form a basis
- Completely positive maps
- Greatest lower bound (infimum)
- Every nonempty set bounded below has an infimum
- 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)
Used by · 27
- Transpose fidelity from the QEC matrix
- Haar-average fidelity versus entanglement fidelity
- Factor-two guarantee for transpose recovery
- Operational checking time
- Long-time four-level transpose plateau
- Repeated four-level recovery and fixed-time error bound
- Four-level fidelity measures for the unrotated decoder
- Optimal phase-corrected four-level recovery
- Transient later-time advantage of the unrotated decoder
- Jump histories, distinguishability, and limits of Kraus rank
- Minimal-code decay detection without correction
- Detection-code errors retain partial logical information
- Aydin–Barg fidelity time curves and complete-information-loss plateau
- Minimal-code closed fidelity and checking time
- Gradual which-path leakage and inverse splitting timescale
- Pauli-complementary qubit recovery fidelity inequality
- Independent transpose Gram fidelity formula
- Near-optimality for maximally mixed entanglement fidelity
- Haar-average versus entanglement fidelity
- Qubit coherence channels and fidelity functionals
- Two orthogonal Pauli alternatives bound recovery fidelity
- Recovery optimization on orthogonal flagged branches
- Kraus trace formula for maximally mixed entanglement fidelity
- Feasibility and range of transpose entanglement fidelity
- Equivalence of logical and code-supported physical decoding
- A uniform transpose-fidelity bound for the one-decay channel
- Orthogonal decay sectors yield a strict fidelity margin
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
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
- 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)