Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum

Outlier Detection and other applications of Quantum Matrix Multiplication

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

Published Jun 3, 2025• 1 citation
Publisher

Abstract

This work explores the potential of Quantum Matrix Multiplication (QMM) to accelerate several computational tasks, demonstrating substantial speedups. We present three distinct applications showcasing QMM’s versatility and efficiency. We introduce a novel Hybrid-Quantum Angle Based Outlier Detection (H-QABOD) algorithm, leveraging QMM to efficiently identify outliers in numerical datasets. We evaluate H-QABOD’s performance on both synthetic and real-world datasets, benchmarking it against its classical counterpart. Furthermore, we investigate QMM’s application within quantum linear algebra, specifically for multitrace estimation and Frobenius norm computation.

DOI
10.1109/ipdpsw66978.2025.00082

Related papers

Quantum algorithm for angle-based anomaly detection

Hongmiao Rao, Chaohua Yu, Yingpei Wu +2 more

Anomaly detection is a prominent task in machine learning and data mining, which plays a key role in various domains such as financial fraud detection, network intrusion detection, and healthcare. Angle-based outlier detection (ABOD) algorithm stands out as one of the most common approaches for anomaly detection, the core step of which involves computing the angular variance among distance vectors from each point to others, and then marking those points with angular variance lower than a threshold as outliers. The time complexity of classical ABOD algorithm scales as mathcalOM³) with respect to the number of samples M, making it hard to efficiently handle large-scale datasets. To this end, a quantum ABOD algorithm is proposed, in which quantum amplitude estimation is harnessed to compute angular variance in quantum parallel, and quantum amplitude amplification is further applied to search out the outliers. Compared with its classical counterpart, our quantum ABOD algorithm has time complexity Ołeft[\sqrt{M}\log(M)\right] with respect to M, achieving a polynomial speedup with respect to M.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Nov 6, 2024•0 citations

Faster quantum subroutine for matrix chain multiplication via Chebyshev approximation

Xinying Li, Pei-Lin Zheng, Chengkang Pan +3 more

Matrix operations are crucial to various computational tasks in various fields, and quantum computing offers a promising avenue to accelerate these operations. We present a quantum matrix multiplication (QMM) algorithm that employs amplitude encoding and combines quantum walks with Chebyshev polynomial approximation to achieve quadratic acceleration for matrix chain multiplication where the same matrix is applied K times while maintaining logarithmic complexity in matrix dimension and precision. The algorithm can be applied to any complex matrix. Furthermore, we discuss integrating our QMM algorithm as a subroutine in other matrix operations and propose strategies to optimize QMM for matrices with large condition numbers with numerical simulation.

Scientific Reports•Aug 5, 2025•3 citations

Quantum Adaptive Matrix Computation

Jincheng Zhang

Quantum adaptive matrix computation represents a paradigm shift in matrix multiplication, leveraging quantum mechanics to achieve significantly faster and more efficient computations compared to classical methods. This paper investigates the potential of quantum algorithms to optimize and accelerate the core operations of matrix multiplication, specifically focusing on the design and implementation of a novel quantum algorithm. The core claim posits that by harnessing quantum self-adaptability, we can fundamentally reshape matrix multiplication, enabling substantial improvements in computational speed and scalability. The research will explore a specific type of matrix computation, demonstrating the feasibility of quantum-enhanced matrix multiplication through a rigorous theoretical analysis and preliminary experimental validation. The paper will also address the challenges and future directions of this emerging field.

•Aug 31, 2026•0 citations

Anomaly Detection Via Variational Quantum Algorithm

Weiwei Zhu, Kai Yang, Jiawei Zan

Anomaly detection plays a crucial role in identifying rare and critical events, anomalies, or outliers that are not part of the normal data distribution. With the large volume of modern data and the widespread use of sensors and IoT devices, datasets have evolved into high-dimensional structures, posing significant challenges to anomaly detection tasks. In this work, we investigate to employ a hybrid quantum-classical algorithm to help handle such challenges. It is mainly based on Local Outlier Factor (LOF) algorithm to detect anomalies. However, we enhance distance estimation and k-nearest neighbor search via quantum algorithms. The proof-of-principle numerical results demonstrate the performance of the proposed method is competitive to previous algorithm.

International Conference on Advanced Computer Theory and Engineering•Sep 15, 2023•3 citations

Advancing Quantum Matrix Computations: Integrating Geometric Means and Chain Multiplications for Nonlinear and Iterative Challenges in Machine Learning and Quantum Information

Syed Muntasir Mamun

Quantum computing has emerged as a transformative paradigm for tackling complex matrix operations that underpin applications in machine learning and quantum information. In this paper, we synthesize recent advancements in quantum computing by integrating the quantum subroutines for matrix geometric means from Liu et al. (2025), which enable efficient solutions to nonlinear matrix equations like algebraic Riccati equations, with the Chebyshev-accelerated quantum matrix multiplication framework from Li et al. (2025), offering quadratic speedups for iterative chain operations on complex matrices. Through detailed reviews of each approach, we highlight shared primitives such as block-encoding, quantum singular value transformation, Hermitianization, and polynomial approximations, demonstrating their complementarity in constructing hybrid algorithms for nonlinear iterative problems. These hybrids achieve polylogarithmic complexities in matrix dimensions while optimizing precision and conditioning dependencies, exemplified in frameworks for Riccati iterations and kernel enhancements. Applications are explored in machine learning, including geometric mean metric learning for anomaly detection in classical and quantum data, and in quantum information, such as optimal fidelity and Rényi entropy estimation with accelerated power computations for error correction. Also available on Academia.edu: https://www.academia.edu/attachments/125700844/download_file?s=portfolio

•Dec 11, 2025•0 citations

Universal Matrix Multiplication on Quantum Computer

J. M. Yao, Huang, Tianjian, Cai, Zipeng +1 more

As the most central and computationally intensive component of deep neural networks, the execution efficiency of matrix multiplication directly determines the training and inference performance of models. Harnessing the parallel processing capabilities afforded by quantum superposition and entanglement to reshape matrix multiplication implementations has become a promising entry point for optimising underlying quantum arithmetic logic and improving the operational efficiency of quantum circuits. This paper proposes a universal quantum matrix multiplication (QMM) framework designed to achieve substantial computational acceleration through an optimised quantum arithmetic logic unit. To circumvent the limitations of multi-register and multi-control gates in conventional quantum arithmetic circuits, we encode classical data directly into parameterised \(R_z\) rotation gates using the quantum Fourier transform (QFT), thereby reducing the base gate complexity of the quantum adder to \(O(n)\). In addition, by adopting the column-wise multiplication principle from classical arithmetic, we optimize the gate complexity of the quantum multiplier to \(O(n^2)\). We further extend this approach to a quantum version of the Strassen algorithm, and experimentally quantify the trade-off between reduced multiplication time and increased overhead in addition resources. This work establishes a reliable technical pathway for constructing general-purpose quantum matrix operations, with the potential to unlock substantial computational power for training modern machine learning models.

arXiv:2408.03085•Aug 6, 2024•0 citations
This work explores the potential of Quantum Matrix Multiplication (QMM) to accelerate several computational tasks, demonstrating substantial speedups. We present three distinct applications showcasing QMM’s versatility and efficiency. We introduce a novel Hybrid-Quantum Angle Based Outlier Detection (H-QABOD) algorithm, leveraging QMM to efficiently identify outliers in numerical datasets. We evaluate H-QABOD’s performance on both synthetic and real-world datasets, benchmarking it against its classical counterpart. Furthermore, we investigate QMM’s application within quantum linear algebra, specifically for multitrace estimation and Frobenius norm computation.
Anomaly detection is a prominent task in machine learning and data mining, which plays a key role in various domains such as financial fraud detection, network intrusion detection, and healthcare. Angle-based outlier detection (ABOD) algorithm stands out as one of the most common approaches for anomaly detection, the core step of which involves computing the angular variance among distance vectors from each point to others, and then marking those points with angular variance lower than a threshold as outliers. The time complexity of classical ABOD algorithm scales as mathcalOM³) with respect to the number of samples M, making it hard to efficiently handle large-scale datasets. To this end, a quantum ABOD algorithm is proposed, in which quantum amplitude estimation is harnessed to compute angular variance in quantum parallel, and quantum amplitude amplification is further applied to search out the outliers. Compared with its classical counterpart, our quantum ABOD algorithm has time complexity Ołeft[\sqrt{M}\log(M)\right] with respect to M, achieving a polynomial speedup with respect to M.
Matrix operations are crucial to various computational tasks in various fields, and quantum computing offers a promising avenue to accelerate these operations. We present a quantum matrix multiplication (QMM) algorithm that employs amplitude encoding and combines quantum walks with Chebyshev polynomial approximation to achieve quadratic acceleration for matrix chain multiplication where the same matrix is applied K times while maintaining logarithmic complexity in matrix dimension and precision. The algorithm can be applied to any complex matrix. Furthermore, we discuss integrating our QMM algorithm as a subroutine in other matrix operations and propose strategies to optimize QMM for matrices with large condition numbers with numerical simulation.
Quantum adaptive matrix computation represents a paradigm shift in matrix multiplication, leveraging quantum mechanics to achieve significantly faster and more efficient computations compared to classical methods. This paper investigates the potential of quantum algorithms to optimize and accelerate the core operations of matrix multiplication, specifically focusing on the design and implementation of a novel quantum algorithm. The core claim posits that by harnessing quantum self-adaptability, we can fundamentally reshape matrix multiplication, enabling substantial improvements in computational speed and scalability. The research will explore a specific type of matrix computation, demonstrating the feasibility of quantum-enhanced matrix multiplication through a rigorous theoretical analysis and preliminary experimental validation. The paper will also address the challenges and future directions of this emerging field.
Anomaly detection plays a crucial role in identifying rare and critical events, anomalies, or outliers that are not part of the normal data distribution. With the large volume of modern data and the widespread use of sensors and IoT devices, datasets have evolved into high-dimensional structures, posing significant challenges to anomaly detection tasks. In this work, we investigate to employ a hybrid quantum-classical algorithm to help handle such challenges. It is mainly based on Local Outlier Factor (LOF) algorithm to detect anomalies. However, we enhance distance estimation and k-nearest neighbor search via quantum algorithms. The proof-of-principle numerical results demonstrate the performance of the proposed method is competitive to previous algorithm.
Quantum computing has emerged as a transformative paradigm for tackling complex matrix operations that underpin applications in machine learning and quantum information. In this paper, we synthesize recent advancements in quantum computing by integrating the quantum subroutines for matrix geometric means from Liu et al. (2025), which enable efficient solutions to nonlinear matrix equations like algebraic Riccati equations, with the Chebyshev-accelerated quantum matrix multiplication framework from Li et al. (2025), offering quadratic speedups for iterative chain operations on complex matrices. Through detailed reviews of each approach, we highlight shared primitives such as block-encoding, quantum singular value transformation, Hermitianization, and polynomial approximations, demonstrating their complementarity in constructing hybrid algorithms for nonlinear iterative problems. These hybrids achieve polylogarithmic complexities in matrix dimensions while optimizing precision and conditioning dependencies, exemplified in frameworks for Riccati iterations and kernel enhancements. Applications are explored in machine learning, including geometric mean metric learning for anomaly detection in classical and quantum data, and in quantum information, such as optimal fidelity and Rényi entropy estimation with accelerated power computations for error correction. Also available on Academia.edu: https://www.academia.edu/attachments/125700844/download_file?s=portfolio
As the most central and computationally intensive component of deep neural networks, the execution efficiency of matrix multiplication directly determines the training and inference performance of models. Harnessing the parallel processing capabilities afforded by quantum superposition and entanglement to reshape matrix multiplication implementations has become a promising entry point for optimising underlying quantum arithmetic logic and improving the operational efficiency of quantum circuits. This paper proposes a universal quantum matrix multiplication (QMM) framework designed to achieve substantial computational acceleration through an optimised quantum arithmetic logic unit. To circumvent the limitations of multi-register and multi-control gates in conventional quantum arithmetic circuits, we encode classical data directly into parameterised RzR_zRz​ rotation gates using the quantum Fourier transform (QFT), thereby reducing the base gate complexity of the quantum adder to O(n)O(n)O(n). In addition, by adopting the column-wise multiplication principle from classical arithmetic, we optimize the gate complexity of the quantum multiplier to O(n2)O(n^2)O(n2). We further extend this approach to a quantum version of the Strassen algorithm, and experimentally quantify the trade-off between reduced multiplication time and increased overhead in addition resources. This work establishes a reliable technical pathway for constructing general-purpose quantum matrix operations, with the potential to unlock substantial computational power for training modern machine learning models.