Quantum estimates of molecular energy require repeated state preparation and measurement. We bound the minimum repetition count for given measurements and processing rules from above with a practical schedule and from below with independently verified inequalities. For an H
4 chain at H-H distances of 0.90 and 1.80 Åwith 2 per cent uniform noise in the ground state, entangling Clifford measurements, which map Pauli products onto one another, cut leading-order repetitions by at least 65.9 and 61.0 per cent, respectively, relative to any schedule using only single-qubit Pauli measurements and Hamiltonian terms. With 69 unaltered measurement settings, each a basis change followed by qubit readout, processing further observables saves at least 12.04 and 6.70 per cent. For four lanthanide and actinide Hamiltonians with depolarized Hartree-Fock covariances, reducing the sum of absolute Hamiltonian coefficients does not proportionally reduce sampling. The bounds cover linear unbiased estimates from independent batches at small error.
A
U(1) quantum rotor pairs a periodic angle with an integer-valued conjugate momentum, and occurs in molecular rotation, superconducting phase-charge circuits, and compact gauge fields. Coupling such a rotor coherently to qubits gives a hybrid register whose control structure is not inherited from either the oscillator-qubit or the qudit case. We develop a Clifford theory, together with a universal-control result, for registers of
n qubits and
r rotors. We classify all automorphisms of the hybrid phase space
F22n×Zr×Tr that preserve the Weyl commutation relations, and give an explicit finite Clifford circuit for each one. The classification is directional: rotor momentum parity may control qubit Pauli operations within the Clifford group, while every nonzero qubit-controlled rotor momentum shift is non-Clifford. It also yields normal forms for the mixed qubit-rotor couplings and the exact minimum number of elementary mixed gates needed to synthesize them. Adding a rotor cosine potential and one fixed qubit-rotor conditional phase to the local Clifford operations gives universal control on the full Hilbert space in the strong operator topology. We then apply this structure in three settings: an exact controlled-shift realization of gauge-covariant matter hopping, which is necessarily non-Clifford; rotor phase estimation with direct angle readout and probe optimization under momentum-support and energy constraints; and finite Fourier transforms on rotor momentum codes, where the one-rotor transform for
d=2s compiles into
O(s) momentum-selective and controlled-shift instructions and each cross-register Fourier factor is implemented by one quadratic rotor Clifford gate.
Entangling measurements can reduce the cost of learning many-body correlations. We consider classical shadows in which a fixed unitary on a
k-qubit region is sandwiched between two layers of random single-qubit Clifford gates, and ask which middle unitary best estimates Pauli strings with full support on the region. Combining symplectic support counting with a constraint from operator-size parity, we prove that within this architecture the minimum squared shadow norm over all Clifford middle unitaries is
Ckopt=4⋅9k/(3⋅5k+3k−6) for odd
k and
Ckopt=4⋅9k/(3⋅5k−3k+2) for even
k. A dual-axis rotation circuit
U∗ attains this minimum for every
k. Asymptotically
Ckopt≃(4/3)⋅(9/5)k: the exponential base of Wu et al.'s contractive unitary is optimal, and the prefactor improves from
2 to
4/3. For
1≤k≤7, exact certificates show that
U∗ is optimal over the entire unitary group
U(2k), and we conjecture that this holds for every
k.
In fault-tolerant block encodings of structured Hamiltonians, the support geometry can set how the non-Clifford cost of SELECT scales with the system size, however many operators act on each support. We construct permute-act-unpermute circuits: a CSWAP network fixed by this geometry brings a selected support to a fixed target register, a shared local circuit acts there, and the permutation is undone. The operators add only an
XZ mask on this register, at a cost independent of the system size, and one query can mix several support geometries. For two-site supports, we establish and attain the minimum CSWAP count within address-controlled networks of site transpositions. Compiled for Pauli terms, these circuits use
8SN+o(N) T gates with
O(logN) permutation work qubits, where
N is the number of system qubits and
S is determined by the support geometry, with
S=1 for nearest-neighbour interactions and
S=3/2 for all-to-all pairs; in both cases the correction is
O(logN). We also introduce a bridged CSWAP, which remembers the logical value of its temporary AND across the target action and repairs it from the prepared labels, so that the inverse CSWAP undoes the exchange without recomputing the value. When the repair is Clifford, it halves the
T count of a matched forward-inverse CSWAP pair at the cost of one retained work qubit. For a Heisenberg ring, the complete block-encoding query reduces the
T count by a factor approaching
3 as the system size grows, relative to flat and product-wise Pauli walks. For a five-orbital Anderson impurity model, which combines nearest-neighbour and all-to-all support geometries, the reduction is about
1.7 at large bath sizes, relative to the cheapest of three comparators, each built from the methods of the references it follows.
We show that qubit Hamiltonians derived from spectral graph theory lattices exhibit structurally favorable Pauli decompositions for quantum simulation. After Jordan–Wigner transformation, the GeoVac lattice Hamiltonian yields
O(Q3.15) Pauli string terms in the number of qubits
Q, compared to
O(Q4+) for conventional Gaussian-basis Hamiltonians (our own log-log fit of the published Pauli counts of Trenev et al. [ref] gives
Q4.25 for LiH and
Q3.92 for H
2O, spanning
Q3.9–
Q4.3). The advantage originates in angular momentum selection rules—enforced by Gaunt integrals at the two-electron integral level—which cause the electron repulsion integral (ERI) tensor density to decay as
∼1/M (empirically
≈M−0.85–
M−1) with the number of spatial orbitals
M, while Gaussian ERI tensors remain near-dense at
O(1). Beyond term counts, we quantify two operationally relevant cost metrics: the number of qubitwise-commuting (QWC) measurement groups scales as
O(Q3.36), and the Pauli 1-norm
λ=∑i∣ci∣—which controls both Trotter step counts and qubitization query complexity—scales as
O(Q1.69) with
R2=0.997. The sub-quadratic 1-norm scaling is the key result for fault-tolerant simulation: it implies that Trotter circuit depth grows far more slowly with system size than term counts alone would suggest. All Gaussian baselines are validated against published integral values (Szabo and Ostlund for H
2; analytical STO for He). For composed multi-center systems, the pseudopotential approximation of the composed natural geometry framework [ref] yields block-diagonal electron repulsion integrals with a universal Pauli scaling of
O(Q2.5), independent of molecular topology (exponent spread
0.02 across three molecules). At equal qubit counts, this represents two or more orders of magnitude fewer Pauli terms than Gaussian baselines (published counts of Trenev et al. [ref],
Q3.9–
Q4.3 span fitted by us)—an advantage that grows with system size due to the
∼1.5 exponent gap. These comparisons are at matched qubit counts, not matched accuracy; the composed basis carries classical equilibrium-geometry errors of 5–26% (LiH/BeH
2/H
2O; Sec. (ref)), making the framework optimal for fixed-geometry quantum simulation rather than geometry optimisation. Across the composed molecular library (35 molecules spanning
Z=1–56, H through Ba, including the first transition series ScH–ZnH), the composed Pauli count is exactly linear in the qubit count:
NPauli=11.10×Q (exact, non-identity terms;
d-orbital blocks give 9.23). These counts are realized under a pair-diagonal angular approximation (
ma=mc,
mb=md) adopted deliberately for sparsity; the exact global-
ML Coulomb rule (used in the framework's precision-physics paths, and considered but left on the table here) gives
≈2.5× more terms with the same scaling, under which the
d-block coefficient is in fact higher, not lower (Sec. (ref)). GeoVac Paper 14. Part of the GeoVac research corpus (quantum computing group). Code, tests, and the full paper series: https://github.com/jloutey-hash/geovac. Corpus archive DOI: 10.5281/zenodo.20482394. Corpus version at deposit: v4.75.0.
Choosing a variational quantum circuit (VQC) usually means searching over ansatze and depths, and training each candidate. We give three rules that fix these choices from the data and the gate set alone, before any training. First, a circuit without entangling gates has a rank-one Fourier coefficient tensor on every subset of qubits. A singular value decomposition of a dataset's Fourier coefficients therefore indicates whether entanglement is needed, which qubits it connects, and a lower bound on the error of omitting it. Second, the rank of the quantum Fisher information matrix grows by
p0 per layer, after a first-layer deficit
d0, until it reaches a ceiling set by the dynamical Lie algebra. This law fixes the depth. Third, reading out all
2N−1 Pauli-Z products from one batch of shots resolves half of the state's directions, the most any single-basis readout can. A single-qubit readout resolves an exponentially small fraction. For the Madelon dataset, the rules prescribe 7 blocks of 3 qubits at depth 3: a 239-parameter classifier with 78.5% test accuracy, found without a grid search. Ablations confirm three predicted effects: shallower circuits, smaller blocks and dropping reuploading all lower accuracy.