TARE: Block Encoding Linear Combinations of Pauli Strings Without Coefficient-Dependent Ancilla State Preparation

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.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Quantum Computing
Published
2026-11-17
DOI
https://doi.org/10.1145/3862631
Citations
6
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
5.29
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

TARE: Block Encoding Linear Combinations of Pauli Strings Without Coefficient-Dependent Ancilla State Preparation

Andreas Sturm, Niclas Schillo, Rüdiger Quay
6 citations
ACM Transactions on Quantum Computing
Quantum Computing Algorithms and Architecture
5.29
article

TARE: Block Encoding Linear Combinations of Pauli Strings Without Coefficient-Dependent Ancilla State Preparation

Andreas Sturm, Niclas Schillo, Rüdiger Quay
article en
6 citations

Abstract

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.

ACM Transactions on Quantum Computing
University of Stuttgart (DE), University of Freiburg (DE), Fraunhofer Institute for Industrial Engineering (DE), Fraunhofer Institute for Applied Solid State Physics (DE)
Openalex Percentile: Top 4%
Quantum Computing Algorithms and Architecture
5.29
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon