We consider the problems of testing and learning an
n-qubit
k-local Hamiltonian from queries to its evolution operator with respect the 2-norm of the Pauli spectrum, or equivalently, the normalized Frobenius norm. For testing whether a Hamiltonian is
ε1-close to
k-local or
ε2-far from
k-local, we show that
O(1/(ε2−ε1)8) queries suffice. This solves two questions posed in a recent work by Bluhm, Caro and Oufkir. For learning up to error
ε, we show that
exp(O(k2+klog(1/ε))) queries suffice. Our proofs are simple, concise and based on Pauli-analytic techniques.
Quantum linear solvers require expressing the system matrix as a sum of Pauli operators, a process whose computational cost scales exponentially with problem size. For electromagnetic integral equations discretized by the method of moments (MoM), the resulting dense impedance matrices pose a significant challenge for quantum operator generation. This paper demonstrates that hierarchical matrix
(H-matrix) compression provides an effective mechanism for reducing Pauli operator complexity. By restricting Pauli decomposition to low-rank far-field blocks identified through
H-matrix partitioning, the number of significant Pauli terms is reduced by over 95% compared to full-matrix decomposition, while maintaining approximation accuracy on the order of 10−5in relative Frobenius norm. Numerical experiments on a spherical scatterer confirm that the proposed block-wise approach offers a practical pathway toward quantum-compatible formulations of large-scale electromagnetic problems.
We solve an open problem in entanglement theory posed by Yu et al., {\it Nature Communications 12, 1012 (2021)}. The problem is to show, via an entanglement witness, that the
14-qubit state
ΦE8 is entangled. Inspired by a method from quantum codes, we combine symmetric extension with moment matrices to prove that
ΦE8 is entangled. The proof has the form of a rational infeasibility certificate for a semidefinite program, yielding an explicit entanglement witness. Our approach unifies and extends several earlier methods that involve the Lovász theta number of the Pauli anti-commutativity graph, promising scalability and flexibility in further applications.