# Efficient quantum circuit for singular value thresholding

Source: [Efficient quantum circuit for singular value thresholding](<https://www.sota2.com/research/paper/68fa39081e209131ce8bf720>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-24T23:17:47.562Z

Authors: Bojia Duan, Jiabin Yuan, Ying Liu, Dan Li

Published: 2017-11-24T08:49:36.000Z

## Abstract

Singular value thresholding (SVT) operation is a fundamental core module in many mathematical models in computer vision and machine learning, particularly for many nuclear norm minimizing-based problems. We presented a quantum SVT (QSVT) algorithm which was used as a subroutine to address an image classification problem. This algorithm runs in $O\\left\[\\log\\left(pq\\right)\\right\]$, an exponential speed improvement over the classical algorithm which runs in $O\\left\[poly\\left(pq\\right)\\right\]$. In this study, we investigate this algorithm and design a scalable quantum circuit for QSVT. In the circuit design, we introduce an adjustable parameter $\\alpha$ to ensure the high probability of obtaining the final result and the high fidelity of actual and ideal final states. We also show that the value of $\\alpha$ can be computed ahead of implementing the quantum circuit when the inputs of the QSVT algorithm, i.e. matrix ${\\bf{A}}$ and constant $\\tau$, are given. In addition, we propose a small-scale quantum circuit for QSVT. We numerically simulate and demonstrate the performance of this circuit, verifying its capability to solve the intended SVT. The quantum circuit for QSVT implies a tempting possibility for experimental realization on a quantum computer.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1711.08896>)

[PDF](<https://arxiv.org/pdf/1711.08896.pdf>)
