TARE: Block Encoding Linear Combinations of Pauli Strings Without Ancilla State Preparation
Niclas Schillo, Andreas Sturm, R\"udiger Quay

TL;DR
TARE is a novel block-encoding method for linear combinations of Pauli strings that reduces T-gate count and circuit depth, enhancing resource efficiency in quantum algorithms based on QSP.
Contribution
Introduces TARE, a new block-encoding technique that absorbs coefficients into anti-commuting Pauli strings, reducing ancilla qubits and improving efficiency over standard methods.
Findings
TARE reduces T-gate count compared to LCU.
TARE improves circuit depth in numerical simulations.
TARE scales logarithmically with the number of Pauli strings.
Abstract
Quantum algorithms based on Quantum Signal Processing (QSP) offer the potential for speedups across a broad range of applications, with block encodings serving as the central input model. In this framework, non-unitary matrices are embedded into larger unitary operators, and the cost of constructing these encodings often dominates the overall gate complexity. In this work, we introduce Tag-and-Restore Encoding (TARE), a block-encoding method for linear combinations of Pauli strings. In this method coefficient magnitudes are absorbed into a unitary built from a set of mutually anti-commuting 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
