AQ-Stacker: An Adaptive Quantum Matrix Multiplication Algorithm with Scaling via Parallel Hadamard Stacking

TL;DR

This paper introduces AQ-Stacker, a hybrid quantum-classical matrix multiplication algorithm that adapts its execution pattern for efficiency, leveraging QRAM and Hadamard tests to potentially outperform classical methods.

Contribution

The paper presents a novel adaptive framework for quantum matrix multiplication that dynamically switches between different parallelism configurations based on hardware resources.

Findings

Achieves $O( ext{log } N)$ complexity for inner product computation using QRAM.

Demonstrates 96% accuracy on MNIST with quantum simulation.

Provides a tunable complexity range from $O(N^2)$ to more efficient regimes.

Abstract

Matrix multiplication (MatMul) is the computational backbone of modern machine learning, yet its classical complexity remains a bottleneck for large-scale data processing. We propose a hybrid quantum-classical algorithm for matrix multiplication based on an adaptive configuration of Hadamard tests. By leveraging Quantum Random Access Memory (QRAM) for state preparation, we demonstrate that the complexity of computing the inner product of two vectors can be reduced to $O(\log N)$. We introduce an "Adaptive Stacking" framework that allows the algorithm to dynamically reconfigure its execution pattern from sequential horizontal stacking to massive vertical parallelism based on available qubit resources. This flexibility enables a tunable time-complexity range, theoretically reaching $O(N^2)$ on fault-tolerant systems while maintaining compatibility with near-term hardware. We validate the numerical stability of our approach through a Quantum Machine Learning (QML) simulation, achieving 96% accuracy on the MNIST handwritten digit dataset. Our results suggest that adaptive quantum MatMul provides a viable path toward super-classical efficiency in high-dimensional linear algebra operations.