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.
Finite instruments can be coherently deferred
Statement
Let be a finite instrument from a nonzero finite-dimensional complex inner-product space to a finite-dimensional complex inner-product space , with finite nonempty observed outcome set . After observing , suppose the circuit applies a specified finite unitary suffix on . For every finite-dimensional complex inner-product reference space and every input operator , the measured circuit's unnormalized branch on is where, after choosing an ordered orthonormal basis of , denotes the finite ancillary block amplification on : if , then . This is the block extension in the complete-positivity definition. The coherent construction retains the observed label register until terminal readout. Its outcome- branch, after tracing out the hidden Kraus and padding registers but retaining the label, is on and the label register (up to the canonical factor permutation); discarding the label gives the same data-reference branch map. Thus it preserves the complete outcome law and all correlations with . This is an exact denotational statement: any newly used dilation or block operation must be listed and charged by a gate or oracle model; no same-alphabet synthesis or cost bound is asserted.
Facts & Assumptions
Given: The finite instrument, finite outcome set, branch-specific unitary suffixes, and arbitrary finite-dimensional reference space .
A finite instrument has an isometric coherent record: there are common-length finite branch Kraus families with and an isometry whose observed-label branch recovers after the hidden record is traced.
A finite isometry extends after finite ancilla padding: after finite ancilla padding, an isometry is the restriction of a surjective isometry on equal-dimensional input and output registers with a fixed zero ancilla.
Finite measurement branches and classical control: an observed label selects its specified unitary suffix; its block operation is an explicit model capability or a separately constructed and charged operation.
Completely positive maps: for each finite reference register , the amplified map sends a block matrix to the block matrix .
Finite Kraus representation: a finite family represents when for every .
Tensor products of finitely many linear maps and Tensor maps preserve composition, identities, and adjoints: tensor maps act on elementary tensors factorwise, preserve compositions, and satisfy .
Ordered tensor registers, their inner product, and wire permutations: factor permutations are defined on the ordered product basis and preserve the product inner product.
Partial trace over a finite tensor factor: tracing a finite register factor sums its diagonal basis coordinates.
The outcome law and outputs of a measured circuit: branch weights are instrument output traces; only positive-weight branches are normalized, and hidden Kraus indices are not outcomes.
Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis and Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional has dimension and an ordered orthonormal basis of that length; dimension zero means .
Dirac Notation Conversion: is the rank-one map for a unit label vector .
A finite instrument with nonzero input has nonzero output space: a finite instrument from nonzero has nonzero output space , as required by the finite unitary-extension lemma.
The computational basis is orthonormal: every specified computational basis vector of a positive-level register has norm one.
Proof
By [F12], is nonzero. By [F1], choose finite branch Kraus families, pad them to a common positive length, and form the coherent record isometry . By [F2], pad the input by a finite clean register and extend to a surjective isometry satisfying .
Reorder so the observed label register is first, followed by , the hidden register, and the padding register; this is the canonical basis permutation of [F7]. Apply the block operation from [F3] on the observed label and , acting identically on the hidden register, padding register, and reference, then undo the permutation. On the label- subspace this applies and leaves the two environment registers unchanged.
Let be the input-padding inclusion. Checking on each elementary vector gives ; these vectors span, and [F6] makes the tensor extensions well-defined. Hence the inclusion maps agree on all vectors, and conjugating any operator by them gives the corresponding equality of extended output operators. This remains true for vectors and operators entangled across and .
Put . If , [F10] gives , hence and the amplification identity is immediate. Otherwise choose an ordered orthonormal basis of by [F10] and use it to identify the reference with . Write in blocks. By [F4], block of is by [F5]. By [F6], the same is block of . Equality of all blocks proves this finite-Kraus formula for every .
For each , the observed-label projection keeps only the terms with label in the coherent isometry. Retain that label and take the partial trace [F8] only over the hidden Kraus register and the padding register; the trace keeps equal hidden indices , and [F13] gives for the returned padding. The label factor is by [F11]. Thus, after canonical factor permutation, the label-resolved branch operator is This equals by step 2.1 and step 2.2 and [F6]. Taking the partial trace of the label factor gives exactly because is unit by [F13].
Taking traces of equal branch operators gives the same outcome probabilities. Division gives the same conditional operator only when the shared branch weight is positive; when it is zero both descriptions assign by [F9]. Equality for arbitrary on preserves all reference correlations. The finite-dimensional operator construction asserts no additional implementation or cost.
Depends on
- A finite instrument has an isometric coherent record
- A finite instrument with nonzero input has nonzero output space
- A finite isometry extends after finite ancilla padding
- Finite measurement branches and classical control
- The outcome law and outputs of a measured circuit
- Finite registers and their ordered computational bases
- The computational basis is orthonormal
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Every finite-dimensional real or complex inner product space has an orthonormal basis
- Ordered tensor registers, their inner product, and wire permutations
- Finite Kraus representation
- Tensor products of finitely many linear maps
- Tensor maps preserve composition, identities, and adjoints
- Completely positive maps
- Partial trace over a finite tensor factor
- Dirac Notation Conversion
Used by
Dependency tree · two levels
66 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
- John Preskill, Quantum Computation, Chapter 3: Foundations II: Measurement and Evolution (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 5: Classical and Quantum Circuits (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, arXiv:1907.09415v6 (standard reference, not scraped)