Block encoding of semiseparable matrices via their generators

arXiv:2610.13228 · quant-ph, cs.NA, math.NA · Submitted 2026-10-09 · Read on arXiv

quant-ph, cs.NA, math.NA

Submitted: 2026-10-09

Updated: 2026-10-09

Code: https://github.com/Giacomo-Antonioli/Semiseparable

License: http://creativecommons.org/licenses/by-nc-nd/4.0/

The gist: We present an explicit quantum circuit that constructs a block encoding of a generator-representable semiseparable (one-pair) matrix directly from its two generators.

Terminology

Abstract

We present an explicit quantum circuit that constructs a block encoding of a generator-representable semiseparable (one-pair) matrix directly from its two generators. For an N times N semiseparable matrix with N=2 n, the circuit uses 2n+2 ancilla qubits and has O(polylog N) depth, and it realizes a (2 sqrt N,,2n+2,,2 sqrt 2 epsilon) -block encoding, where epsilon is controlled by the accuracy of the state-preparation routines that load the generators. The building blocks of the circuit are cyclic shifts, swaps, and Hadamard gates, each admitting an efficient implementation through the binary decomposition of the relevant indices.

Sources

Related papers