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.
A Controlled Global Phase Becomes a Relative Control Phase
Statement
Let be a nonzero finite-dimensional complex-inner-product space and a unitary. Let , and suppose the model separately grants controlled access to both and . There is a normalized eigenvector with and . Let be the control qubit with ordered computational basis ; define and prepare with target . The two joint effects are . The outcome has probability after and after . Thus the two controlled maps give different outcome laws exactly when ; when , the controlled maps coincide. This is a mathematical witness; it does not assert that controlled access or the witness-state preparation is free.
Facts & Assumptions
Given: The finite-dimensional target , a unitary , a real , separate controlled access to and , and the finite control-state measurement specified in the Statement.
Controlled Unitary Access defines as the control-first block map and treats the capability as explicit. Its carrier is present in this batch.
Finite POVMs and their outcome law defines a finite POVM and the density-operator weight . Its current draft definition body was read.
Ordered tensor registers, their inner product, and wire permutations defines the ordered product pairing after an ordered orthonormal basis is specified for each factor and proves that the pairing is independent of those choices.
Tensor products of finitely many linear maps defines the tensor-map action on elementary tensors and its unique linear extension. Its current draft proof was read.
The computational basis is orthonormal proves the control basis is orthonormal. Its current draft proof was read.
A unit-vector outer product is a density operator proves directly that the outer product of every unit vector in a nonzero finite-dimensional space is a density operator.
Dirac Notation Conversion defines in the root linear-first convention.
Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.
Bessel's inequality for a finite orthonormal list and Parseval's identity for an orthonormal basis gives Parseval's identity for a finite orthonormal basis.
POVM outcome weights are probabilities states that finite POVM weights of a density operator form a probability distribution. Its current draft proof was read; its density-definition dependency is present in its current frontmatter.
Density operator: a density operator is non-negative and has trace one.
Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces: a unitary is an invertible linear norm-preserving endomorphism.
For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and are equivalent: a finite-dimensional isometry satisfies and is normal.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: a normal endomorphism of a finite-dimensional complex-inner-product space has an orthonormal eigenbasis.
, , and : for real , and .
, and exactly when : exactly when .
Real and complex inner-product spaces and their induced length: the root pairing is linear in its first argument and conjugate-linear in its second.
The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is the sum of diagonal entries in an orthonormal basis.
Non-negative and positive operators: non-negative means self-adjoint with nonnegative quadratic form.
The adjoint is characterised by : is characterized by .
Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear endomorphism of has a unique adjoint.
, and the complex exponential extends the real exponential: for complex .
Proof
By [F1] and [F2], satisfies , hence is normal. The complex spectral theorem [F3] gives an orthonormal eigenbasis; since is nonzero, choose one unit eigenvector and write . Norm preservation and [F6], [F7] give , so . This chooses one vector from a finite nonempty basis and uses no choice axiom.
Choose an ordered orthonormal basis of using [L8]. Together with the control basis from [L5], it supplies the factor bases required by [L3], whose proof shows the pairing is independent of this choice. Put on the control and on the joint register. By the Statement, . Using [L3] and [L5], direct inner-product calculations give and ; also and , so these vectors form an orthonormal basis. Every is a finite sum of elementary tensors; expanding each control factor in this basis and grouping terms writes . The product pairing [L3] makes these two summands orthogonal, and the tensor-map definition [L4] gives and . Hence and . Applying the same decomposition to gives ; the adjoint characterization [F10] and finite-dimensional existence/uniqueness [F11] imply each effect is self-adjoint. By [F9], each effect is non-negative; together with the two-element outcome set and , this is a finite POVM by [L2].
Set . By [L5], [F6], and [F7], its squared norm is ; the cross terms vanish by orthogonality. Since is unit, the product pairing [L3] makes unit. The controlled block rule [L1] gives .
Put . By [F4], . For every , [F6] and [F7] give ; since and is invertible, is invertible, so it is unitary by [F1]. For , [L5], [F6], [F7] and step 1.1 give . The separately granted controlled block gives . Its control factor has squared norm by [F4], [F6], and [F7]. No access to this block is inferred from a call to ; it is part of the explicit model assumption in the Given.
Let be either output in steps 2.1–2.2. Both factors are unit vectors, so the product norm [L3] makes ; [L6] makes a density operator by [L11]. Choose a finite orthonormal basis of by [L8]. From [L7] and [F8], , where self-adjointness from step 1.2 gives the middle equality and Parseval [L9] gives the last equality. By the product pairing [L3] and tensor-map action [L4], . The finite weights normalize by [L10], so this trace value is the probability of the plus outcome.
For the output in step 2.1, , so . For the output in step 2.2, . Put . By [F12], and ; [F4] gives and , so and . Hence and .
By [F5], means . Since , : equality would force and then , hence . Thus the probability from step 4.1 is strictly below one, while the other is one; the two outcome laws differ.
If , [F5] gives , so the two controlled block maps are identical by [L1]. The operators therefore produce the same state for every common input and hence the same outcome law for the specified POVM.
Depends on
- Controlled Unitary Access
- Finite POVMs and their outcome law
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- Dirac Notation Conversion
- Density operator
- POVM outcome weights are probabilities
- Ordered tensor registers, their inner product, and wire permutations
- Tensor products of finitely many linear maps
- The computational basis is orthonormal
- Every finite-dimensional real or complex inner product space has an orthonormal basis
- Bessel's inequality for a finite orthonormal list and Parseval's identity for an orthonormal basis
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- A unit-vector outer product is a density operator
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Every linear map between finite-dimensional inner product spaces has a unique adjoint
- For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and $T^*T=I$ are equivalent
- Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
- $\ker(\exp)=2\pi i\mathbb Z$, and $\exp z=\exp w$ exactly when $z-w\in2\pi i\mathbb Z$
- $\exp(z+w)=\exp z\,\exp w$, and the complex exponential extends the real exponential
- Real and complex inner-product spaces and their induced length
- The norm $\lVert v\rVert=\sqrt{\langle v,v\rangle}$ induced by a real or complex inner product
- Non-negative and positive operators
Used by
- Amplitude amplification with independently chosen phase rotations Algorithm
- Bounded-error evaluation from a dual adversary certificate Algorithm
- QFT-based amplitude estimation Algorithm
- A controlled braid phase is observable Counterexample
- A discarded global phase changes a controlled computation Counterexample
- Controlled Global Phase Changes an X-Outcome Example
- Standalone and controlled phase accounting for a fixed-sector braid Lemma
- The braid phase is a common scalar character Lemma
- A constant phase query is invisible alone and relative under control Theorem
- Amplitude-estimation additive error and success probability Theorem
- Arbitrary-phase amplification query count Theorem
- Dual reflection evaluator has bounded-error correctness Theorem
- Finite universal-gate compilation cost for the truncated QFT Theorem
Dependency tree · two levels
85 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
- Ronald de Wolf, Quantum Computing: Lecture Notes, arXiv:1907.09415v6 (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 6: Quantum Algorithms (standard reference, not scraped)