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.
Acceptance is invariant under an unconditional global phase
Statement
For a finite promise computation, replacing its entire unconditional circuit unitary by , where and , leaves every output probability and hence unchanged. A scalar inserted only in the target block of a controlled operation need not preserve acceptance: there is an explicit two-qubit finite-circuit witness below.
Facts & Assumptions
Given: The finite-dimensional circuit and output law of Quantum acceptance probability for a finite promise computation, a scalar with , and the control-first tensor order.
Quantum acceptance probability for a finite promise computation: each output weight is a finite sum of squared moduli of root-inner-product coordinates of the prepared output vector.
Clifford+T gate library and exact matrices: , , and in the fixed finite gate library.
Finite registers and their ordered computational bases and The computational basis is orthonormal: are the orthonormal basis of the one-qubit register, and the two-qubit input is a unit vector.
Ordered tensor registers, their inner product, and wire permutations: tensor factors retain their displayed order, and the associated product basis is ordered lexicographically by its factor-index tuple.
Promise problem: a promise problem is a pair of disjoint subsets of , with no answer condition off their union.
Finite circuit syntax and ordered wire labels fixes the ordered wire tuple of each gate. Denotational semantics of a finite layered circuit embeds the local matrix on those factors with identity on the complement and composes gates chronologically with later matrices on the left.
Proof
Let . Replacing the entire unconditional unitary by replaces by . Since the root pairing is linear in its first argument, every coordinate is multiplied by . Its squared modulus is unchanged because .
On a control-first pair of qubits, define . For target and phase , while . By [F2], this second matrix is implemented by applying four times to the control wire. On input , apply to the control, then respectively or , then to the control again. The first gate list maps to because ; the second maps it to because direct matrix multiplication gives and . Each list uses only the fixed finite gates and the second is an explicit circuit realizing the target phase inside the control block.
The finite sums over and then over the accepting strings are therefore unchanged term by term. Thus both and are unchanged under an unconditional global phase.
Use these as the length-two circuits in two finite families, taking gate-free circuits with empty output tuples at other lengths. Let the promise pair be and , and let the total predicate accept exactly when , , and the measured control bit is . Designate wire as the length-two output. The two families differ only by whether the target block is or . By [F1], the first has acceptance probability and the second has acceptance probability , since their length-two outputs are the distinct basis vectors and . Thus a phase applied only inside a controlled target block can change acceptance, even though the same scalar on an entire unitary leaves acceptance invariant.
Depends on
- Quantum acceptance probability for a finite promise computation
- Promise problem
- Finite circuit syntax and ordered wire labels
- Denotational semantics of a finite layered circuit
- Finite registers and their ordered computational bases
- The computational basis is orthonormal
- Ordered tensor registers, their inner product, and wire permutations
- Clifford+T gate library and exact matrices
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
39 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 Watrous, Quantum Computational Complexity, Sections III.2 and IV.1 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, Chapter 13, Section 13.2 (standard reference, not scraped)