Quantum state preparation is a fundamental primitive in quantum algorithms for encoding classical data into quantum amplitudes. We compare the cost of preparing general
n-qubit states with real amplitudes using two common paradigms: rotation-based methods, based on controlled rotations, and sampling-based methods, based on a structured representation of the target state. Although these approaches are often theoretically compared using CNOT count and
T-count, their relative performance in total gate count remains less well understood practically. We compare representative rotation-based and sampling-based methods using
T-count and total gate count, and analyze how compilation overhead affects their relative performance. We also develop a software package for compiling state preparation circuits, designed as a practical subroutine for more general quantum computations. Numerical experiments on resource states and quantum states related to quantum chemistry, condensed matter physics, and simulation via Magnus expansion over a range of target accuracies
ε support the analysis. Our results show that sampling-based methods achieve asymptotically lower
T-count and retain an overall advantage after accounting for total gate count and compilation overhead.
Photoelectron counting sequences for single-atom resonance fluorescence are studied. The distribution of waiting times between photoelectric counts is calculated, and its dependence on driving-field intensity and detection efficiency is discussed. The photoelectron-counting distribution is derived from the waiting-time distribution. The relationship between photoelectron counting sequences and photon emission sequences is discussed and used to obtain an expression for the reduced state of the atom during the waiting times between photoelectric counts. The roles of irreversibility and the observer in atomic state reduction are delineated.