Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth

DOI10.48550/arXiv.2607.13191MaRDI QIDQ7284063arXivFDO

Authors Alessandro Berti, Gianna M. Del Corso, Alessandro Poggiali, Giacomo Antonioli, Anna Bernasconi

Publication date 14 July 2026

Published in arXiv

Tldr We present Two-Tower Matrix Multiplication, a quantum subroutine for computing the product of $K$ matrices in circuit depth independent of $K$, with qubit count $\mathcal{O}\bigl(\sum_{k} \log P_k \bigr)$.

Full work available at URL https://doi.org/10.48550/arXiv.2607.13191

arXiv classification

quant-ph

Cites work

• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• A refined laser method and faster matrix multiplication
• Faster matrix multiplication via asymmetric hashing
• Matrix Analysis
• Quantum algorithm for estimating largest eigenvalues
• Quantum computation and quantum information
• Quantum machine learning
• Quantum recommendation systems
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
• Time-marching based quantum solvers for time-dependent linear differential equations

This page was built for publication: Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7284063)