Quantum Journal

Unitary-orbit classification and a refinement theorem for context-independent projective probabilities

Let $\mathcal H$ be a finite-dimensional complex Hilbert space, and let $w(P,\mathsf M)$ be a normalized probability weight assigned to an outcome projection $P$ as it occurs in a projective measurement $\mathsf M$. For fixed $P$, let $G_P\cong\mathcal U(P^\perp)$ be the group of unitaries acting identically on $\operatorname{ran}P$ and arbitrarily on $P^\perp$. We classify the $G_P$-orbits of projective measurements containing $P$: two measurem...

New Methods and Frameworks for Quantum State Preparation in Modern Quantum Systems

This thesis studies exact, deterministic preparation of arbitrary dense n-qubit states, the data-loading step in quantum signal and image processing. It derives two syntheses built on the Digital Signal-induced Heap Transform (DsiHT): the QsiHT Fast Path Real Synthesis and the QsiHT Fast Path Complex Synthesis. Both are benchmarked against ten configurations spanning the UCR, isometry, multiplexor, Schmidt/SVD, QSD, and heap-transform families....

SPSA Hyperparameter Tuning for Variational Quantum Natural Language Inference

Training variational quantum models requires choosing between parameter-shift gradients, which are exact but cost $O(P)$ forward evaluations, and simultaneous perturbation stochastic approximation (SPSA), which uses only two samples but produces high-variance estimates that can degrade optimisation on small supervised tasks. Whether the cheap gradient is usable depends on the variance that results from different choices of the SPSA perturbation...