--- title: Qubitized Hamiltonians in Quantum Algorithms url: https://www.emergentmind.com/topics/qubitized-hamiltonians type: topic --- # Qubitized Hamiltonians in Quantum Algorithms Qubitized Hamiltonians are Hamiltonians encoded on qubits in a form compatible with quantum algorithms built from Pauli decompositions, block-encodings, and controlled signal operations. In the broad sense used across several recent works, they are Hamiltonians written as sums of tensor products of Pauli operators acting on qubits; in the narrower Low–Chuang sense, they are Hamiltonians embedded into a larger unitary so that their eigenvalues appear as eigenphases of a walk or signal operator. A further specialized usage defines qubitized Hamiltonians as Hermitian matrices with spectrum in \(\{-1,0,+1\}\) and zero trace, so that in an appropriate basis they act as a single-qubit Pauli on a logical two-dimensional subspace. A complementary foundational route derives qubit Hamiltonians directly from classical functions by mapping Boolean and real functions to diagonal Pauli-\(Z\) operators [2308.01986; 1911.00416; 2603.17816; 1804.09130]. ## 1. Definitions and scope The broadest formulation begins with a Pauli expansion \[ \mathcal H=\sum_{i=1}^{N}\omega_i P_i,\qquad P_i\in \{I,X,Y,Z\}^{\otimes n}, \] or equivalently \[ H=\sum_{i=1}^m c_iP_i, \] with real coefficients and \(n\)-qubit Pauli strings. In this sense, a qubitized Hamiltonian is simply a Hamiltonian already expressed on qubits in a Pauli basis, which is the standard representation used after mappings such as Jordan–Wigner or Bravyi–Kitaev, or after direct spin encodings [2308.01986; 2601.18773]. In the qubitization framework of Hamiltonian simulation, the central object is instead a unitary query built from an LCU decomposition \[ H=\sum_j w_j U_j \] or \[ H=\sum_{k=1}^{\Lambda}\alpha_k\,p^k_{\mathcal S}, \] together with state preparation and controlled selection subroutines. The qubitized walk operator acts on a two-dimensional invariant subspace associated with each eigenstate of \(H\), and its eigenvalues are \[ \lambda_\pm(E)=E\pm i\sqrt{1-E^2}=e^{\pm i\arccos E}, \] so phase estimation yields \(\pm \arccos(E)\) rather than simulating \(e^{iHt}\) directly [1911.00416; 1902.02134]. A distinct, paper-specific definition treats qubitized Hamiltonians as Hermitian matrices \(\widehat H_i\) with eigenvalues in \(\{-1,0,+1\}\) and \(\mathrm{Tr}[\widehat H_i]=0\). In that usage, \(\widehat H_i\) is written as \[ \widehat H_i=\widehat V_i^\dagger\,\widehat\lambda_i\,\widehat V_i, \] where \(\widehat\lambda_i\) is a logical Pauli \(Z\) on \(\operatorname{span}\{\ket{\lambda},\ket{\lambda_\perp}\}\) and zero on the orthogonal subspace. This definition emphasizes “single-qubit behavior when expressed in the appropriate basis” and is used to organize Hamiltonian simulation and block-encoding primitives for structured matrices [2603.17816]. These usages are compatible rather than contradictory. A plausible implication is that “qubitized Hamiltonian” names a family of representations rather than one canonical construction: Pauli-sum encodings, block-encoded signal operators, and logical two-level reductions all describe the same underlying objective of translating problem Hamiltonians into qubit-native primitives. ## 2. Diagonal encodings of classical functions A foundational construction maps a classical function \(f:\{0,1\}^n\to\mathbb R\) to the unique diagonal Hamiltonian \(H_f\) satisfying \[ H_f\ket{x}=f(x)\ket{x}\qquad \forall x\in\{0,1\}^n. \] Using Boolean Fourier analysis, \[ f(x)=\sum_{S\subseteq [n]}\widehat f(S)\chi_S(x),\qquad \chi_S(x)=(-1)^{S\cdot x}, \] and the identity \[ \prod_{j\in S}Z_j\ket{x}=\chi_S(x)\ket{x}, \] one obtains \[ H_f=\sum_{S\subseteq [n]}\widehat f(S)\prod_{j\in S}Z_j. \] Thus every real function on the Boolean cube has a unique diagonal Pauli-\(Z\) representation, and Boolean predicates become projectors or projector sums in the computational basis [1804.09130]. This representation directly supplies cost Hamiltonians for QAOA, problem Hamiltonians for quantum annealing, and diagonal or controlled Hamiltonians whose exponentials act as phase oracles. The same work gives explicit composition rules: \[ H_{\neg f}=I-H_f,\qquad H_{f\wedge g}=H_fH_g,\qquad H_{f\vee g}=H_f+H_g-H_fH_g, \] \[ H_{f\oplus g}=H_f+H_g-2H_fH_g,\qquad H_{af+bg}=aH_f+bH_g. \] These formulas turn logical structure into algebraic structure and permit systematic construction from clauses such as AND, OR, XOR, implication, majority, not-all-equal, and \(1\)-in-\(3\) predicates [1804.09130]. The same source draws a sharp complexity distinction. For compact Boolean descriptions such as CNF formulas, computing even the identity coefficient \[ \widehat f(\emptyset)=\frac{1}{2^n}\sum_x f(x) \] is #P-hard. By contrast, for pseudo-Boolean objectives of the form \[ f(x)=\sum_{j=1}^m w_j f_j(x), \] with each \(f_j\) local, the Hamiltonian is simply \[ H_f=\sum_{j=1}^m w_j H_{f_j}, \] and remains efficiently representable. This distinction is central to the practical use of qubitized Hamiltonians in optimization: exact projector encodings of global SAT predicates are generically intractable, while sums of local clause Hamiltonians are not [1804.09130]. ## 3. Block-encoding, walk operators, and controlled Hamiltonians In LCU-based qubitization, PREPARE constructs \[ |G\rangle=\sum_j \sqrt{\frac{w_j}{\lambda}}\,|j\rangle,\qquad \lambda=\sum_j w_j, \] and SELECT applies \[ |j\rangle|\psi\rangle\mapsto |j\rangle U_j|\psi\rangle. \] The resulting signal operator block-encodes \(H/\lambda\), and the walk operator built from SELECT and a reflection about \(|G\rangle\) is the object on which phase estimation is performed [1902.02134]. A related presentation writes the target Hamiltonian as \[ H=\sum_{k=1}^{\Lambda}\alpha_k\,p^k_{\mathcal S},\qquad \sum_k\alpha_k=1, \] with \(p^k_{\mathcal S}\) Pauli strings. In that formulation, qubitization avoids Trotter error because it does not approximate \(e^{iH}\) by a product formula; instead it constructs exact unitaries \(\widehat G\), \(\widehat V\), and \(\widehat S\) whose joint action maps the eigenvalues of \(H\) to phases \(\pm\arccos(E)\) [1911.00416]. Diagonal function Hamiltonians fit naturally into this framework. If \(H_f\) is the predicate Hamiltonian for a Boolean function \(f\), then controlled evolution is implemented by \[ \widetilde H_f = H_f\otimes H,\qquad e^{-i\widetilde H_ft}=\Lambda_f(e^{-iHt}), \] and computation of \(f\) into an ancilla is realized by \[ G_f\ket{x}\ket{a}=\ket{x}\ket{a\oplus f(x)},\qquad G_f=e^{-i\frac{\pi}{2}H_f\otimes (X-I)}. \] These are exactly the kinds of controlled unitaries and oracles that are repackaged in block-encoding and qubitization-based constructions [1804.09130]. A more recent parallel framework, Hamiltonian Decoded Quantum Interferometry, also starts from a general Pauli Hamiltonian \[ H=\sum_{i=1}^m c_iP_i \] but prepares \[ \rho_{\mathcal P}(H)=\frac{\mathcal P(H)^2}{\operatorname{Tr}[\mathcal P(H)^2]} \] for a polynomial \(\mathcal P\), using a controlled-Pauli layer, Bell interferometry, and a decoding oracle for the symplectic code of \(H\). The authors explicitly note that the construction is not phrased in block-encoding terminology, but it plays a similar role: a spectral polynomial transformation is realized on a maximally entangled reference state rather than through repeated signal-operator applications [2601.18773]. ## 4. Compression, symmetry reduction, and alternative encodings For Pauli Hamiltonians, qubitization is not only a matter of encoding \(H\) but also of minimizing the qubit register on which \(H\) acts. One systematic approach starts from \[ \mathcal H=\sum_{i=1}^{N}\omega_i P_i \] and removes first all redundant qubits that are acted on by identities only, then all qubits fixed by conserved Pauli charges. The reduced Hamiltonian decomposes as \[ \mathcal H_{\mathcal R}= \sum_{\vec z\in\{0,1\}^c}\ket{\vec z}\!\bra{\vec z}\otimes \big(\mathcal H|_{\vec z}\big), \] with sector Hamiltonians \[ \mathcal H|_{\vec z}=\sum_{i=1}^N(-1)^{\vec z\cdot \vec\zeta_i}\,\omega_i S_i. \] The corresponding optimal qubit count is \[ n_{\mathrm{eff}}=\frac{1}{2}\operatorname{rank}(M)+\big(\dim(M)-\operatorname{rank}(M)-c\big), \] with at most \(2^c\) subproblems, where \(M\) is the commutation matrix of a generating subset of Pauli terms [2308.01986]. This reduction is exact within the class of Clifford conjugations and Pauli symmetries. It preserves spectrum and sector dynamics, and it is explicitly motivated as a preprocessing step for Trotter simulation, VQE, and Low–Chuang qubitization alike. The same formalism is applied to chemical molecules, lattice gauge theories, the Hubbard model, and the Kitaev model, where conserved charges can remove nontrivial fractions of the original qubit register [2308.01986]. A different encoding trade-off appears in first-quantized rotor models. For lattices of dipolar planar rotors, a binary encoding uses \[ k=\lceil \log_2 d\rceil \] qubits per truncated rotor level \(d\), so the kinetic term becomes a quadratic Ising-like operator in \(\sigma^z\), while the interaction terms become Pauli strings of weight up to \(2k\). The unary encoding instead uses \(d\) qubits per rotor with a one-hot physical subspace, making the kinetic term purely diagonal and 1-local and the interactions constant-weight four-body terms. This is a direct example of how different qubitized Hamiltonians can represent the same physical model with different qubit counts, Pauli weights, and circuit-depth consequences [2507.17952]. These two lines of work address different bottlenecks. Conserved-charge reduction lowers the number of logical qubits for a fixed Pauli Hamiltonian, whereas binary versus unary encodings alter the Pauli structure itself. A plausible implication is that qubitized Hamiltonian design is jointly an algebraic and architectural problem. ## 5. Structured matrices, chemistry, and polynomial spectral transforms Quantum chemistry provides a canonical large-scale application. For an arbitrary-basis electronic structure Hamiltonian, low-rank factorization rewrites the Coulomb tensor as \[ W_{(pq),(rs)}=V_{pqrs}=\sum_{\ell=1}^{L}\omega_\ell g^{(\ell)}_{pq}g^{(\ell)}_{rs}, \] leading to LCU 1-norms \[ \lambda_T = 2\sum_{p,q=1}^{N/2}|T_{pq}|,\qquad \lambda_W = 4\sum_{\ell=1}^{L}\omega_\ell\left(\sum_{p,q=1}^{N/2}|g_{pq}^{(\ell)}|\right)^2, \] and \(\lambda=\lambda_T+\lambda_W\). With QROAM-based PREPARE and controlled Jordan–Wigner SELECT, the paper reports a variant with \(\widetilde{\mathcal O}(N^{3/2}\lambda)\) T complexity and estimates about seven hundred times less surface code spacetime volume than prior quantum algorithms for FeMoco, despite using a larger and more accurate active space [1902.02134]. Another line of work reformulates structured matrices themselves as sums of qubitized Hamiltonians. In that usage, Toeplitz, circulant, Hankel, anti-circulant, grid, and outer-product matrices are decomposed into blocks that, after basis change, reduce to projector-controlled one-qubit gates. Each term can then be simulated by a single logical rotation \(R_Z(2t)\), or block-encoded by writing the term as a difference of two reflections. This provides a uniform LCH-to-LCU conversion for many adjacency matrices associated with PDE discretizations, sparse matrices, and graph problems [2603.17816]. Hamiltonian Decoded Quantum Interferometry addresses a different task: preparation of Gibbs-like states and Hamiltonian optimization for general Pauli Hamiltonians. For polynomial degree \(l\), the framework uses a single call to a weight-\(l\) decoding oracle and prepares \(\rho_{\mathcal P}(H)\), with robustness bound \[ \|\rho_{\mathcal P,\epsilon}(H)-\rho_{\mathcal P}(H)\|_1\le 2\sqrt{\epsilon}. \] For Gibbs-state preparation, the paper imports the degree condition \[ l \gtrsim 1.12\,\beta\|H\| + 0.648\ln\frac{2}{\delta} \] to obtain trace-distance approximation to \(e^{-\beta H}/Z_\beta\) [2601.18773]. These examples illustrate two complementary roles of qubitized Hamiltonians. In chemistry and structured linear algebra they are optimized queries for simulation and phase estimation; in HDQI they are inputs to a one-shot spectral transformation scheme based on decoding rather than repeated walk-operator use. ## 6. Implementations, misconceptions, and limitations The broad sense of qubitized Hamiltonians includes physically programmed qubit Hamiltonians with explicit control over graph structure and local fields. In a Rydberg-atom simulator, the microscopic Hamiltonian \[ \hat H=\frac{\hbar\Omega}{2}\sum_{j=1}^N\big(|1_j\rangle\langle 0_j|+|0_j\rangle\langle 1_j|\big)+\sum_{j