Block Encoding of Sparse Matrices via Coherent Permutation
Abstract
Block encoding of sparse matrices underpins powerful quantum algorithms such as quantum singular value transformation, Hamiltonian simulation, and quantum linear solvers, yet its efficient gate-level realization for general sparse matrices remains a major challenge. We introduce a unified framework that addresses key obstacles including the overhead of multi-controlled X (MCX) gates, amplitude reordering, and hardware connectivity, enabling simplified block encoding constructions with explicit gate-level implementations. Central to our approach is a connection to combinatorial optimization, which enables systematic assignment of control qubits to satisfy nearest-neighbor connectivity constraints, along with coherent permutation operators that preserve superposition while enabling structured amplitude reordering. We demonstrate our methods on structured sparse matrices, achieving systematic reductions in control overhead and circuit depth. Our framework bridges the gap between theoretical formulations and hardware-efficient quantum circuit implementations.
Cite
@article{arxiv.2508.21667,
title = {Block Encoding of Sparse Matrices via Coherent Permutation},
author = {Abhishek Setty},
journal= {arXiv preprint arXiv:2508.21667},
year = {2026}
}