Singular Value Thresholding Algorithm Based on Variational Quantum Pre-compression

Singular value thresholding (SVT) is a core subroutine in low-rank matrix recovery and quantum machine learning, but suffers from high computational complexity. The quantum singular value transformation (QSVT) algorithm improves performance, yet its resource usage still depends polynomially on the full rank \(r\) or dimension \(\sqrt{pq}\), leading to prohibitive costs for large-scale matrices. Based on the mathematical theory of low-rank matrix approximation, we propose a variational quantum algorithm framework, termed Variational Quantum Low-Rank SVT (VQLR-SVT). This framework utilizes a low-complexity variational quantum circuit to extract the low-dimensional submanifold spanned by the effective rank \(r_\epsilon\) of the matrix, and directly learns the threshold function from the phase estimation register, thereby compressing high-dimensional control information into a single flag qubit and implicitly realizing a low-dimensional approximation. Theoretical analysis shows that, under the mild assumption of variational training convergence, the resource complexity of QSVT operations can be reduced from \(\text{poly}(r)\) to \(\text{poly}(r_\epsilon)\), where \(r_\epsilon \ll r\). We rigorously prove the accuracy guarantee and complexity upper bound of the pre-compression algorithm using matrix perturbation theory. Subsequently, through five numerical simulation experiments, we validate the efficiency advantage in terms of resource consumption versus effective rank, the theoretical upper bound of output fidelity, circuit expressibility testing, convergence of variational quantum circuit training trajectories, and cross-validation with classical algorithms along with resource comparison. Experimental results demonstrate that in typical scenarios with rapidly decaying singular values, VQLR-SVT can reduce quantum gate calls by more than \(50\%\) while maintaining fidelity above 0.97, and the quantum resources exhibit scale-independence with respect to matrix dimensions.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-11-19
DOI
https://doi.org/10.21203/rs.3.rs-11327051/v1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Singular Value Thresholding Algorithm Based on Variational Quantum Pre-compression

Song Xianhua, Zhixin Zhang, Yiwei Chen
Research Square
Quantum Computing Algorithms and Architecture
preprint

Singular Value Thresholding Algorithm Based on Variational Quantum Pre-compression

Song Xianhua, Zhixin Zhang, Yiwei Chen
preprint en

Abstract

Singular value thresholding (SVT) is a core subroutine in low-rank matrix recovery and quantum machine learning, but suffers from high computational complexity. The quantum singular value transformation (QSVT) algorithm improves performance, yet its resource usage still depends polynomially on the full rank \(r\) or dimension \(\sqrt{pq}\), leading to prohibitive costs for large-scale matrices. Based on the mathematical theory of low-rank matrix approximation, we propose a variational quantum algorithm framework, termed Variational Quantum Low-Rank SVT (VQLR-SVT). This framework utilizes a low-complexity variational quantum circuit to extract the low-dimensional submanifold spanned by the effective rank \(r_\epsilon\) of the matrix, and directly learns the threshold function from the phase estimation register, thereby compressing high-dimensional control information into a single flag qubit and implicitly realizing a low-dimensional approximation. Theoretical analysis shows that, under the mild assumption of variational training convergence, the resource complexity of QSVT operations can be reduced from \(\text{poly}(r)\) to \(\text{poly}(r_\epsilon)\), where \(r_\epsilon \ll r\). We rigorously prove the accuracy guarantee and complexity upper bound of the pre-compression algorithm using matrix perturbation theory. Subsequently, through five numerical simulation experiments, we validate the efficiency advantage in terms of resource consumption versus effective rank, the theoretical upper bound of output fidelity, circuit expressibility testing, convergence of variational quantum circuit training trajectories, and cross-validation with classical algorithms along with resource comparison. Experimental results demonstrate that in typical scenarios with rapidly decaying singular values, VQLR-SVT can reduce quantum gate calls by more than \(50\%\) while maintaining fidelity above 0.97, and the quantum resources exhibit scale-independence with respect to matrix dimensions.

Research Square
Harbin University of Science and Technology (CN)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon