Quick Navigation
Topics
Quantum Algorithms
Block encoding of semiseparable matrices via their generators
arXiv
Authors: Giacomo Antonioli, Gianna M. Del Corso, Roel Van Beeumen
Year
2026
Paper ID
78827
Status
Preprint
Abstract Read
~2 min
Abstract Words
97
Citations
N/A
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 Ntimes N semiseparable matrix with N=2n, the circuit uses 2n+2 ancilla qubits and has O\({rm polylog} N\) depth, and it realizes a \(2sqrt{N}, 2n+2, 2 sqrt{2}\ varepsilon\)-block encoding, where varepsilon 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.
Why This Paper Matters
- It adds a 2026 reference point for readers tracking recent quantum research.
- We present an explicit quantum circuit that constructs a block encoding of a generator-representable semiseparable (one-pair) matrix directly from its two generators.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.