Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck pass
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.

Hybrid bound for a composed channel circuit

Statement

Let L≥1, let H0,…,HL be nonzero finite-dimensional complex Hilbert spaces, and let Φj,Φ~j:L(Hj−1)→L(Hj) be channels for j=1,…,L. Then d⋄(Φ~L⋯Φ~1,ΦL⋯Φ1)≤∑j=1Ld⋄(Φ~j,Φj), where d⋄ is the normalized distance in End-to-end channel and output error contract. For any finite reference space R, input density operator ρ on H0⊗R, and finite final POVM on HL⊗R, the total variation distance between the two final outcome laws is at most the same sum. The claim is uniform over the reference dimension; no product-input assumption is made.

Facts & Assumptions

Given: The finite channel sequence and the finite input/reference/measurement specified in the Statement.

[F1]

End-to-end channel and output error contract: d⋄(Ψ,Φ)=12∥Ψ−Φ∥⋄, where the diamond norm takes the supremum over every finite reference space.

[F2]

Channel Composition Hybrid Bound: for two matching pairs of channels between nonzero finite-dimensional complex Hilbert spaces, replacing both stages changes the raw diamond norm by at most the sum of the two local raw diamond errors.

[F3]

Finite-dimensional channels compose and tensor: the composition of finite-dimensional channels is a channel.

[F4]

Measurement Variation At Most Trace Distance: the output total variation of a finite POVM is at most the trace distance between its input density operators.

[F5]

Trace Norm Duality And Norm Properties: the trace norm satisfies the triangle inequality.

[F6]

Density operator: a density operator is positive semidefinite and has trace one.

[F7]

Trace Norm: the trace norm is the sum of singular values.

[F8]

A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S: positive semidefinite operators have orthonormal eigenbases with nonnegative eigenvalues; those eigenvalues are their singular values.

[F9]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: the trace is the sum of diagonal entries in any orthonormal basis.

[F10]

For every nonzero finite-dimensional space R, id⁡R is a channel: each block amplification fixes every operator, so it is completely positive, and it preserves trace because it is the identity (Completely positive maps, Finite-dimensional quantum channel).

Proof

1.1F1F5algebra

For any two maps A,B with matching domains, the triangle inequality for the induced trace norm holds at each finite reference space by [F5]. Taking the supremum over reference spaces in [F1] gives ∥A+B∥⋄≤∥A∥⋄+∥B∥⋄.

1.2givenF1F2F3F10algebra

For j=1,…,L, let Pj=Φj−1⋯Φ1 and Qj=Φ~L⋯Φ~j+1. If either product is empty, it is the identity on the corresponding nonzero finite-dimensional space and is a channel by [F10]; otherwise its factors compose to a channel by [F3]. Apply [F2] first to the identical pair Pj,Pj followed by Φ~j,Φj, and then to the pair Φ~j∘Pj,Φj∘Pj followed by the identical pair Qj,Qj. After dividing by 2, the two applications give d⋄(QjΦ~jPj,QjΦjPj)≤d⋄(Φ~j,Φj). The finite telescoping identity Φ~L⋯Φ~1−ΦL⋯Φ1=∑j=1L(QjΦ~jPj−QjΦjPj) follows by changing stages one at a time.

2.1step 1.1step 1.2algebra

Apply the diamond-norm triangle inequality from step 1.1 to the finite sum in step 1.2. Each summand has normalized distance at most its local value, so the final normalized diamond distance is at most ∑jd⋄(Φ~j,Φj).

3.1givenF1F3F6F7F8F9F10step 2.1algebra

The identity id⁡R is a channel by [F10], so tensor-channel closure [F3] makes (Φ~L⋯Φ~1)⊗id⁡R and (ΦL⋯Φ1)⊗id⁡R channels. Their complete positivity at ancilla dimension one sends the nonnegative ρ to nonnegative operators, and trace preservation keeps trace one, so the outputs ρ~L,ρL are density operators by [F6] and the channel definition. By the supremum in [F1], [F7]–[F9] give D(ρ~L,ρL)≤d⋄(Φ~L⋯Φ~1,ΦL⋯Φ1) because ∥ρ∥1=1.

4.1step 2.1step 3.1F4algebra∎

Apply [F4] to ρ~L,ρL and the declared final POVM. Its outcome-law total variation is at most D(ρ~L,ρL), hence at most the sum from step 2.1.

Depends on

Used by

Dependency tree · two levels

62 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources