Mathematical Methods in Quantum Mechanics XIV: Wave Operators and Cook's CriterionTextbook
In a scattering experiment a particle arrives from far away, interacts with a target, and leaves again. Far from the target the forces are negligible, so long before and long after the collision the particle should move like a free particle. Scattering theory makes this precise by comparing two quantum dynamics: the free evolutione−itH0…
Mathematical Methods in Quantum Mechanics VII: Compact, Hilbert–Schmidt and Trace Class OperatorsTextbook
Quantum mechanics describes mixed states by density operators: positive operators ρ on a Hilbert space with tr(ρ)=1. Expectation values are traces tr(ρA), perturbation determinants and spectral shift functions are built from traces of resolvent differences, and scattering theory (the Kato–Rosenblum and Birman–Krein…
Oracle-Parameterized Convergence Rates: SPIDER, Q-SPIDER, and the Exact CrossoverResearch Paper
Quantum algorithms for stochastic optimization are usually presented one paper at a time: a schedule is fixed, a quantum mean estimator is substituted for a classical minibatch, and a new rate is derived from scratch. The derivations are near-identical, and the step that actually differs — the price of one gradient query — is buried inside each proof rather…
Higher-Dimensional Quantum Hypergraph-Product Codes with Finite RatesResearch Paper
Quantum low-density parity-check codes encode quantum information using sparse
parity constraints. A standard way to construct them is to translate binary
chain complexes into Calderbank--Shor--Steane codes and to combine complexes by
tensor product. Homology identifies the logical operators of the resulting
code, while the smallest Hamming weight of a…
Searching an unsorted list of N items for a single marked entry takes Θ(N) queries
classically — there is no way to do better than checking items one at a time. Grover's algorithm
(Grover 1996) shows that a quantum computer solves the same problem in Θ(N) queries,
a quadratic speedup that applies to any problem expressible as unstructured…