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

arXiv:2402.07027

Quantum Speedup for Spectral Approximation of Kronecker Products

Yeqi Gao, Zhao Song, Ruizhe Zhang

Published Feb 10, 2024• 3 citations
arXivHTMLPDF

Abstract

Given its widespread application in machine learning and optimization, the Kronecker product emerges as a pivotal linear algebra operator. However, its computational demands render it an expensive operation, leading to heightened costs in spectral approximation of it through traditional computation algorithms. Existing classical methods for spectral approximation exhibit a linear dependency on the matrix dimension denoted by $n$, considering matrices of size $A_1 \in \mathbb{R}^{n \times d}$ and $A_2 \in \mathbb{R}^{n \times d}$. Our work introduces an innovative approach to efficiently address the spectral approximation of the Kronecker product $A_1 \otimes A_2$ using quantum methods. By treating matrices as quantum states, our proposed method significantly reduces the time complexity of spectral approximation to $O_{d,ε}(\sqrt{n})$.

DOI
10.48550/arxiv.2402.07027

Related papers

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

Preparation of digital-encoded and analog-encoded quantum states corresponding to matrix operations

Kaitian Gao, Youlong Yang, Zhenye Du

Abstract Efficient implementation of fundamental matrix operations on quantum computers, such as matrix products and Hadamard operations, holds significant potential for accelerating machine learning algorithms. A critical prerequisite for quantum implementations is the effective encoding of classical data into quantum states. We propose two quantum computing frameworks for preparing the distinct encoded states corresponding to matrix operations, including the matrix product, matrix sum, matrix Hadamard product and division. Quantum algorithms based on the digital encoding computing framework are capable of implementing the matrix Hadamard operation with a time complexity of O (poly log( mn / ε )) and the matrix product with a time complexity of O (poly log( mnl / ε )), achieving an exponential speedup in contrast to the classical methods of O ( mn ) and O ( mnl ). Quantum algorithms based on the analog-encoding framework are capable of implementing the matrix Hadamard operation with a time complexity of O ( k 1 m n ⋅ poly log ( m n / ε ) ) and the matrix product with a time complexity of O ( k 2 l ⋅ poly log ( m n l / ε ) ) , where k 1 and k 2 are coefficients correlated with the elements of the matrix, achieving a square speedup in contrast to the classical counterparts. As applications, we construct an oracle that can access the trace of a matrix within logarithmic time, and propose several algorithms to respectively estimate the trace of a matrix, the trace of the product of two matrices, and the trace inner product of two matrices within logarithmic time.

Chinese Physics B•Jun 12, 2025•0 citations

Quantum Linear System Algorithm for Dense Matrices

Leonard Wossnig, Zhikuan Zhao, Anupam Prakash

Solving linear systems of equations is a frequently encountered problem in machine learning and optimization. Given a matrix $A$ and a vector $\mathbf{b}$ the task is to find the vector $\mathbf{x}$ such that $A\mathbf{x}=\mathbf{b}$. We describe a quantum algorithm that achieves a sparsity-independent runtime scaling of $\mathcal{O}\mathbf{(}{\ensuremath{\kappa}}^{2}\sqrt{n}\text{polylog}(n)/\ensuremath{\epsilon}\mathbf{)}$ for an $n\ifmmode\times\else\texttimes\fi{}n$ dimensional $A$ with bounded spectral norm, where $\ensuremath{\kappa}$ denotes the condition number of $A$, and $\ensuremath{\epsilon}$ is the desired precision parameter. This amounts to a polynomial improvement over known quantum linear system algorithms when applied to dense matrices, and poses a new state of the art for solving dense linear systems on a quantum computer. Furthermore, an exponential improvement is achievable if the rank of $A$ is polylogarithmic in the matrix dimension. Our algorithm is built upon a singular value estimation subroutine, which makes use of a memory architecture that allows for efficient preparation of quantum states that correspond to the rows of $A$ and the vector of Euclidean norms of the rows of $A$.

arXiv:1704.06174•Physical Review Letters•Jan 31, 2018•248 citations

Quantum Circuit Implementation of Two Matrix Product Operations and Elementary Column Transformations

Yu-Hang Liu, Yuan-Hong Tao, Jing-Run Lan +1 more

This paper focuses on quantum algorithms for three key matrix operations: Hadamard (Schur) product, Kronecker (tensor) product, and elementary column transformations each. By designing specific unitary transformations and auxiliary quantum measurement, efficient quantum schemes with circuit diagrams are proposed. Their computational depths are: O(1) for Kronecker product; O(max(m,n)) for Hadamard product (linked to matrix dimensions); and O(m) for elementary column transformations of (2^n X 2^m) matrices (dependent only on column count).Notably, compared to traditional column transformation via matrix transposition and row transformations, this scheme reduces computation steps and quantum gate usage, lowering quantum computing energy costs.

quant-pharXiv:2511.02413•Nov 5, 2025•1 citation

Title: High-Dimensional Non-Linear Matrix State Analysis

Jincheng Zhang

This paper introduces a novel matrix analysis technique designed to comprehensively investigate the quantum states of high-dimensional non-linear matrices. Traditional matrix analysis, often reliant on linear algebra, struggles to effectively capture the complex quantum properties of such matrices. This work proposes a method leveraging the inherent quantum state characteristics to transform the matrix's quantum state into a sequence of quantifiable quantum computation steps. The core mechanism centers around establishing a relationship between the matrix's quantum properties and the resulting quantum computation process, offering a potential pathway for efficient quantum algorithm design and analysis. This approach aims to significantly enhance our understanding and manipulation of high-dimensional quantum systems, paving the way for new quantum computational possibilities.

•Aug 31, 2026•0 citations

Exploring Near-Optimal Contraction Strategies for the Scalar Product in the Tensor-Train Format

Przemysław Dominikowski, Atte Torri, Brice Pointal +3 more

Tensor-train (TT) decomposition has gained tremendous popularity due to its efficiency in handling high-dimensional data arising in scientific and quantum computing as well as machine learning applications. It provides a compact representation of matrices and vectors with a Kronecker product-like low-rank structure, and hence enables efficient matrix-vector operations in this compressed form. The vector scalar product is among such key operations, comprising a series of tensor contractions in a specific TT network where the order of contractions significantly impacts the computational cost. In this work, we introduce fast algorithms for finding a near-optimal contraction ordering for such networks. We show that our algorithms find such contraction orderings efficiently, outperforming the ordering methods for general tensor networks. Compared to our approaches, the best existing method incurs a higher cost of up to 15% for xTy, twice for xTAy, and more than ten times for xTABy scalar products, where A and B are matrices expressed in TT format.

IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum•Jun 3, 2025•0 citations
Given its widespread application in machine learning and optimization, the Kronecker product emerges as a pivotal linear algebra operator. However, its computational demands render it an expensive operation, leading to heightened costs in spectral approximation of it through traditional computation algorithms. Existing classical methods for spectral approximation exhibit a linear dependency on the matrix dimension denoted by nnn, considering matrices of size A1∈Rn×dA_1 \in \mathbb{R}^{n \times d}A1​∈Rn×d and A2∈Rn×dA_2 \in \mathbb{R}^{n \times d}A2​∈Rn×d. Our work introduces an innovative approach to efficiently address the spectral approximation of the Kronecker product A1⊗A2A_1 \otimes A_2A1​⊗A2​ using quantum methods. By treating matrices as quantum states, our proposed method significantly reduces the time complexity of spectral approximation to Od,ε(n)O_{d,ε}(\sqrt{n})Od,ε​(n​).
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
Abstract Efficient implementation of fundamental matrix operations on quantum computers, such as matrix products and Hadamard operations, holds significant potential for accelerating machine learning algorithms. A critical prerequisite for quantum implementations is the effective encoding of classical data into quantum states. We propose two quantum computing frameworks for preparing the distinct encoded states corresponding to matrix operations, including the matrix product, matrix sum, matrix Hadamard product and division. Quantum algorithms based on the digital encoding computing framework are capable of implementing the matrix Hadamard operation with a time complexity of O (poly log( mn / ε )) and the matrix product with a time complexity of O (poly log( mnl / ε )), achieving an exponential speedup in contrast to the classical methods of O ( mn ) and O ( mnl ). Quantum algorithms based on the analog-encoding framework are capable of implementing the matrix Hadamard operation with a time complexity of O ( k 1 m n ⋅ poly log ( m n / ε ) ) and the matrix product with a time complexity of O ( k 2 l ⋅ poly log ( m n l / ε ) ) , where k 1 and k 2 are coefficients correlated with the elements of the matrix, achieving a square speedup in contrast to the classical counterparts. As applications, we construct an oracle that can access the trace of a matrix within logarithmic time, and propose several algorithms to respectively estimate the trace of a matrix, the trace of the product of two matrices, and the trace inner product of two matrices within logarithmic time.
Solving linear systems of equations is a frequently encountered problem in machine learning and optimization. Given a matrix AAA and a vector b\mathbf{b}b the task is to find the vector x\mathbf{x}x such that Ax=bA\mathbf{x}=\mathbf{b}Ax=b. We describe a quantum algorithm that achieves a sparsity-independent runtime scaling of $\mathcal{O}\mathbf{(}{\ensuremath{\kappa}}^{2}\sqrt{n}\text{polylog}(n)/\ensuremath{\epsilon}\mathbf{)}$ for an $n\ifmmode\times\else\texttimes\fi{}n$ dimensional AAA with bounded spectral norm, where $\ensuremath{\kappa}$ denotes the condition number of AAA, and $\ensuremath{\epsilon}$ is the desired precision parameter. This amounts to a polynomial improvement over known quantum linear system algorithms when applied to dense matrices, and poses a new state of the art for solving dense linear systems on a quantum computer. Furthermore, an exponential improvement is achievable if the rank of AAA is polylogarithmic in the matrix dimension. Our algorithm is built upon a singular value estimation subroutine, which makes use of a memory architecture that allows for efficient preparation of quantum states that correspond to the rows of AAA and the vector of Euclidean norms of the rows of AAA.
This paper focuses on quantum algorithms for three key matrix operations: Hadamard (Schur) product, Kronecker (tensor) product, and elementary column transformations each. By designing specific unitary transformations and auxiliary quantum measurement, efficient quantum schemes with circuit diagrams are proposed. Their computational depths are: O(1) for Kronecker product; O(max(m,n)) for Hadamard product (linked to matrix dimensions); and O(m) for elementary column transformations of (2^n X 2^m) matrices (dependent only on column count).Notably, compared to traditional column transformation via matrix transposition and row transformations, this scheme reduces computation steps and quantum gate usage, lowering quantum computing energy costs.
This paper introduces a novel matrix analysis technique designed to comprehensively investigate the quantum states of high-dimensional non-linear matrices. Traditional matrix analysis, often reliant on linear algebra, struggles to effectively capture the complex quantum properties of such matrices. This work proposes a method leveraging the inherent quantum state characteristics to transform the matrix's quantum state into a sequence of quantifiable quantum computation steps. The core mechanism centers around establishing a relationship between the matrix's quantum properties and the resulting quantum computation process, offering a potential pathway for efficient quantum algorithm design and analysis. This approach aims to significantly enhance our understanding and manipulation of high-dimensional quantum systems, paving the way for new quantum computational possibilities.
Tensor-train (TT) decomposition has gained tremendous popularity due to its efficiency in handling high-dimensional data arising in scientific and quantum computing as well as machine learning applications. It provides a compact representation of matrices and vectors with a Kronecker product-like low-rank structure, and hence enables efficient matrix-vector operations in this compressed form. The vector scalar product is among such key operations, comprising a series of tensor contractions in a specific TT network where the order of contractions significantly impacts the computational cost. In this work, we introduce fast algorithms for finding a near-optimal contraction ordering for such networks. We show that our algorithms find such contraction orderings efficiently, outperforming the ordering methods for general tensor networks. Compared to our approaches, the best existing method incurs a higher cost of up to 15% for xTy, twice for xTAy, and more than ten times for xTABy scalar products, where A and B are matrices expressed in TT format.