Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Clean and dirty ancillas

Definition

Let D be a finite ordered quantum register and let A be an ordered register of k≥0 ancilla qubits, with Hilbert spaces HD and HA. Write ∣0A⟩=∣0k⟩, including ∣0A⟩=1 when k=0. Let U be a unitary on HD⊗HA and let V be a unitary on HD.

The register A is a clean ancilla register for U and V when

U(∣ψ⟩D⊗∣0A⟩)=V∣ψ⟩D⊗∣0A⟩

for every vector ∣ψ⟩D. Thus the data operation is independent of the input vector and all clean wires return exactly to zero.

The register A is a dirty ancilla register for U and V when the operator identity U=V⊗IA holds on HD⊗HA. Equivalently, every product input ∣ψ⟩D⊗∣η⟩A is mapped to V∣ψ⟩D⊗∣η⟩A, with the same V for every data and ancilla vector. This requires exact restoration of an arbitrary, initially unknown ancilla state and forbids residual data–ancilla correlation.

These are exact contracts for the complete subroutine. A temporary intermediate alteration of an ancilla is permitted if the full unitary satisfies the stated identity.

Remarks

The reference-register and arbitrary-matrix consequences are proved in Clean and dirty ancilla identities extend to references and mixed states.

Depends on

Used by

Dependency tree · two levels

18 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