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

arXiv:2604.02530v3 Announce Type: replace 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 introducing classical memoization that caches state preparation blocks outside the main compilation loop, we reduce the total classical pre processing overhead for all N^2 element circuits to O(N^2). This decouples the heavy gate synthesis overhead from the core quantum processing loop, enabling execution complexities that strictly match classical input/output boundaries. 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. Our core theoretical contribution is the formalization of the "Entropy Dividend": an information theoretic concentration bound proving that the effective measurement variance sigma^2_eff <= (1/S) (1 - (1/2N) e^[H_max - H(psi)]) approaches its maximum. This makes AQ-Stacker uniquely suited for stabilizing the stochastic weight distributions of deep neural networks. We validate the numerical stability of our approach through Quantum Machine Learning (QML) Statevector simulations, achieving 96% accuracy on the MNIST handwritten digit dataset. Our results suggest that entropic noise suppression and parallel Hadamard stacking provide a scalable path toward super-classical efficiency in next-generation quantum-enhanced AI.

Full text under the publisher's open licence · 248 words