Coherent Quantum Schrodinger Bridge: Two-Boundary Optimal Control for Quantum Algorithm Design

Abstract

Quantum algorithms are intrinsically two-boundary processes: an input state is prepared, and an output state or subspace is selected as the computational answer. We formulate this observation as a coherent Quantum Schrödinger Bridge (QSB), a pure-state Hamiltonian counterpart of Schrödinger bridge theory in which the endpoint constraint is imposed on state vectors and the transport cost is the quadratic control action. In this setting Aharonov's two-state vector becomes the natural optimal-control pair: a forward state from the input and a backward state from the target. Pontryagin's principle then yields a universal optimal Hamiltonian whose weak value is purely imaginary in the geodesic gauge. Thus weak values are not an auxiliary interpretation; they are the local response functions that quantify the drift of the pre-selected state toward the post-selected boundary. Applying this framework to unstructured search, periodicity finding, and matrix arithmetic, we reconstruct Grover's algorithm, the quantum Fourier transform underlying Shor's algorithm, and quantum singular value transformation (QSVT). The usual circuit components -- oracles, diffusion reflections, controlled phases, and signal-processing rotations -- emerge as Lie-algebraic syntheses of the optimal weak-value drift. This perspective unifies distinct algorithmic paradigms into a single geometric principle: algorithm design is the problem of choosing computational boundary conditions and realizing the corresponding optimal flow.