Block encoding of semiseparable matrices via their generators

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(\mathrm{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.