Back to News
quantum-computing

Block encoding of sparse matrices with a periodic diagonal structure

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers from Italy’s quantum computing community introduced a novel quantum circuit for block-encoding sparse matrices with periodic diagonal structures, leveraging the Linear Combination of Unitaries (LCU) framework. The work was submitted in February 2026. The team achieved polynomial gate complexity—O(poly(n)) for banded matrices and O(n) for diagonal ones—outperforming exponential-scaling classical methods for dense matrices, marking a significant efficiency leap for quantum algorithms. A key innovation is a unitary operator that decomposes complex exponentials into real/imaginary components, enabling precise encoding of periodic structures critical for differential equation solvers. Applications include quantum algorithms for advection-diffusion-reaction (ADR) dynamics, with optimal scaling via Quantum Singular Value Transformation (QSVT), bridging quantum computing and numerical analysis. Numerical validations confirm the theoretical framework, reinforcing potential for near-term quantum advantage in sparse matrix computations for scientific and engineering problems.
Block encoding of sparse matrices with a periodic diagonal structure

Summarize this article with:

Quantum Physics arXiv:2602.10589 (quant-ph) [Submitted on 11 Feb 2026] Title:Block encoding of sparse matrices with a periodic diagonal structure Authors:Alessandro Andrea Zecchi, Claudio Sanavio, Luca Cappelli, Simona Perotto, Alessandro Roggero, Sauro Succi View a PDF of the paper titled Block encoding of sparse matrices with a periodic diagonal structure, by Alessandro Andrea Zecchi and 4 other authors View PDF Abstract:Block encoding is a successful technique used in several powerful quantum algorithms. In this work we provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure. The proposed methodology is based on the linear combination of unitaries (LCU) framework and on an efficient unitary operator used to project the complex exponential at a frequency $\omega$ multiplied by the computational basis into its real and imaginary components. We demonstrate a distinct computational advantage with a $\mathcal{O}(\text{poly}(n))$ gate complexity, where $n$ is the number of qubits, in the worst-case scenario used for banded matrices, and $\mathcal{O}(n)$ when dealing with a simple diagonal matrix, compared to the exponential scaling of general-purpose methods for dense matrices. Various applications for the presented methodology are discussed in the context of solving differential problems such as the advection-diffusion-reaction (ADR) dynamics, using quantum algorithms with optimal scaling, e.g., quantum singular value transformation (QSVT). Numerical results are used to validate the analytical formulation. Subjects: Quantum Physics (quant-ph); Numerical Analysis (math.NA) Cite as: arXiv:2602.10589 [quant-ph] (or arXiv:2602.10589v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2602.10589 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Alessandro Andrea Zecchi [view email] [v1] Wed, 11 Feb 2026 07:24:33 UTC (90 KB) Full-text links: Access Paper: View a PDF of the paper titled Block encoding of sparse matrices with a periodic diagonal structure, by Alessandro Andrea Zecchi and 4 other authorsView PDFTeX Source view license Current browse context: quant-ph new | recent | 2026-02 Change to browse by: cs cs.NA math math.NA References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

government-funding
quantum-algorithms
quantum-hardware

Source Information

Source: arXiv Quantum Physics