Compressed phase queries act on the queried oracle register only
ProvedQAlgorithms.Childs.compressedPhaseOracle_local_actionlinear-algebraquantum-computing
Fix the query input , the Fourier-basis query output , and a workspace basis label . Let be the compression unitary on one oracle cell, and let be diagonal with value at and value at a stored bit string .
The full compressed phase oracle leaves and every oracle cell other than unchanged, and applies to cell . More precisely, for every vector and every oracle configuration ,
No normalization assumption on is needed. This is the local form of equation (26.29), used in the calculations (26.33)–(26.39) for Fact 26.2. It isolates cancellation of the unqueried compression factors and Fourier diagonalization of the lookup operation.
Preamble
import Definitions.Def_QAlgorithms_Defs_CompressedOracle
Formal statement
namespace QAlgorithms.Childs
theorem compressedPhaseOracle_local_action {n m : ℕ} {W : Type*} [Fintype W] [DecidableEq W]
(ψ : EuclideanSpace ℂ (((Fin n × Qubits m) × W) × (Fin n → Option (Qubits m))))
(a : (Fin n × Qubits m) × W) (y : Fin n → Option (Qubits m)) :
act (compressedPhaseOracle n m W) ψ (a, y) =
∑ o : Option (Qubits m),
(compressionUnitary m * Matrix.diagonal (fun t : Option (Qubits m) =>
match t with
| none => (1 : ℂ)
| some v => if dotBits a.1.2 v then -1 else 1) * compressionUnitary m)
(y a.1.1) o * ψ (a, Function.update y a.1.1 o) := by sorry
end QAlgorithms.ChildsSource
Andrew M. Childs, Lecture Notes on Quantum Algorithms, 17 April 2025, PDF pp.135–136 (printed pp.128–129), equation (26.29) and local-action calculations (26.33)–(26.39) in the proof of Fact 26.2. https://www.cs.umd.edu/~amchilds/qa/qa.pdf