{
  "annotation_id": "b9503f00-dfc8-4afa-a23e-fc797810f5a2",
  "date_created": "2026-02-17T05:53:04.827000Z",
  "date_modified": "2026-02-17T05:53:04.827000Z",
  "file_hash": "5bcc8f2fa090b9a10ed1ac21f1c46bd05ab452930d7b0c35508605664fc4a071",
  "private": false,
  "record": {
    "abstract": "The Quantum Singular Value Transformation (QSVT) provides a powerful framework with the potential for quantum speedups across a wide range of applications. Its core input model is the block encoding framework, in which non-unitary matrices are embedded into larger unitary matrices. Because the gate complexity of the block-encoding subroutine largely determines the overall cost of QSVT-based algorithms, developing new and more efficient block encodings is crucial for achieving practical quantum advantage. In this paper, we introduce a novel method for constructing quantum circuits that block encode linear combinations of Pauli strings. Our approach relies on two key components. First, we apply a transformation that converts the Pauli strings into pairwise anti-commuting ones, making the transformed linear combination unitary and thus directly implementable as a quantum circuit. Second, we employ a correction transformation based on the stabilizer formalism which uses an ancilla register to restore the original Pauli strings. Our method can be implemented with an ancilla register whose size scales logarithmically with the number of system qubits. It can also be extended to larger ancilla registers, which can substantially reduce the overall quantum circuit complexity. We present four concrete examples and use numerical simulations to compare our method\u0027s circuit complexity with that of the Linear Combination of Unitaries (LCU) approach. We find that our method achieves circuit complexities comparable to or better than LCU, with possible advantages when the structure of the target operators can be exploited. These results suggest that our approach could enable more efficient block encodings for a range of relevant problems extending beyond the examples analyzed in this work.",
    "arxiv_id": "2601.05740",
    "authors": [
      "Niclas Schillo",
      "Andreas Sturm",
      "R\u00fcdiger Quay"
    ],
    "categories": [
      "quant-ph"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Block Encoding Linear Combinations of Pauli Strings Using the Stabilizer Formalism",
    "url": "https://arxiv.org/abs/2601.05740",
    "version": "v3"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7c2f3c56-0574-4e75-8da8-3bdec206b612",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}