Answers are grounded in this paper and cite their sources.
Quantum algorithms based on Quantum Signal Processing (QSP) offer the potential for speedups across a broad range of applications, but their practical performance is often limited by the cost of constructing block encodings. We introduce Tag-and-Restore Encoding (TARE), a block-encoding method for linear combinations of Pauli strings. Unlike Linear Combination of Unitaries (LCU), which prepares a coefficient-dependent ancilla state, TARE moves the coefficient loading to the system register. Coefficient magnitudes are absorbed into a unitary built from mutually anticommuting Pauli strings acting on the system register. These Pauli strings are then mapped to the target Pauli strings through appropriate transformations, yielding a block encoding of the target operator. The ancilla register size scales logarithmically with the number of Pauli strings and can be extended to larger registers to provide a width-depth trade-off. We benchmark TARE against four LCU constructions for the transverse-field Ising model, the Jordan-Wigner representation of a fermionic star Hamiltonian, and random Pauli-string operators. Our numerical results suggest a potential advantage for fermionic Hamiltonians with long-range hopping, especially when two-qubit gates and ancilla qubits are scarce.
No takes yet. Share an insight, caveat, or question.
Schillo et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: