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.
Replacing Bob's key by a copy of Alice's costs the correctness error
Statement
Let be finite nonempty alphabets and let be a nonzero finite-dimensional adversary space. Consider a normalized state classical in ,
where each is nonnegative. Define Alice's marginal by
and let for the classical key-copy channel of The finite classical key-copy map is a quantum channel. Then
Facts & Assumptions
Given: The normalized finite block state in the Statement and its finite alphabets.
Density operator and The basis-independent trace of an endomorphism of a finite-dimensional vector space: a state is nonnegative with trace one, and trace is the sum of finite diagonal entries.
The finite classical key-copy map is a quantum channel and Finite-dimensional quantum channel: is completely positive and trace-preserving and copies each classical block into the shared key block ; complete positivity includes positivity on states by Completely positive maps.
Trace Distance: for density operators, .
Trace norm of a finite classical block operator: the trace norm of a finite self-adjoint block-diagonal operator is the sum of the block trace norms.
Trace Norm Unitary Invariance And Positive Formula: for every nonnegative operator , .
Trace Norm Duality And Norm Properties: the trace norm is homogeneous, in particular .
Proof
The blocks of are the finite sums , so they are nonnegative. Their traces sum to the trace of by [F1], hence to one; therefore is a density operator. Complete positivity and trace preservation [F2] show that is also a density operator, as required for [F3].
By [F2], has block in each key-diagonal slot and zero in every slot with . Thus has block in each slot with , block in slot , and zero elsewhere. Each displayed nonzero block is self-adjoint because it is a positive block or its negative.
Apply [F4] to these orthogonal classical blocks. For , [F5] gives . The sum is nonnegative, so [F5] and [F6] give . Therefore . Dividing by as in [F3] proves the equality with the mismatch probability.
Depends on
- The finite classical key-copy map is a quantum channel
- Trace norm of a finite classical block operator
- Density operator
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- Finite-dimensional quantum channel
- Completely positive maps
- Trace Distance
- Trace Norm
- Finite registers and their ordered computational bases
- Trace Norm Unitary Invariance And Positive Formula
- Trace Norm Duality And Norm Properties
Used by
Dependency tree · two levels
48 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
- Christopher Portmann and Renato Renner, Cryptographic Security of Quantum Key Distribution (2014), §4.3, Theorem 4.1 proof (standard reference, not scraped)
- Joseph M. Renes, Quantum Information Theory, ETH Zürich lecture notes (HS2014; revised 4 February 2015), §8.3 (standard reference, not scraped)
- John Watrous, The Theory of Quantum Information (2018), Chapter 1, §1.1.3 (standard reference, not scraped)