Singular value decomposition (SVD) is fundamentally important and broadly useful in both quantum and classical computing. There are several quantum algorithms known for SVD. Variational quantum algorithms with parametric quantum circuits (PQC) are the most promising approach to find SVD with near-term quantum computers. This paper reports a new method for quantum SVD (QSVD) that finds the singular vectors ordered by the magnitude of singular values by adding extra CNOT gates and a new local cost function design. This ordering is important because the singular vectors with the larger singular values is more representative for the given information. The ordering property of this approach is investigated with the standard Iris dataset by numerical simulations of 4-qubit states. Methods for choosing appropriate choices for the cost function hyperparameter and cost function terms as well as an application example of a quantum encoder are also discussed.
Singular value decomposition (SVD) is fundamentally important and broadly useful in both quantum and classical computing. There are several quantum algorithms known for SVD. Variational quantum algorithms with parametric quantum circuits (PQC) are the most promising approach to find SVD with near-term quantum computers. This paper reports a new method for quantum SVD (QSVD) that finds the singular vectors ordered by the magnitude of singular values by adding extra CNOT gates and a new local cost function design. This ordering is important because the singular vectors with the larger singular values is more representative for the given information. The ordering property of this approach is investigated with the standard Iris dataset by numerical simulations of 4-qubit states. Methods for choosing appropriate choices for the cost function hyperparameter and cost function terms as well as an application example of a quantum encoder are also discussed.
Singular value decomposition is central to many problems in engineering and scientific fields. Several quantum algorithms have been proposed to determine the singular values and their associated singular vectors of a given matrix. Although these algorithms are promising, the required quantum subroutines and resources are too costly on near-term quantum devices. In this work, we propose a variational quantum algorithm for singular value decomposition (VQSVD). By exploiting the variational principles for singular values and the Ky Fan Theorem, we design a novel loss function such that two quantum neural networks (or parameterized quantum circuits) could be trained to learn the singular vectors and output the corresponding singular values. Furthermore, we conduct numerical simulations of VQSVD for random matrices as well as its applications in image compression of handwritten digits. Finally, we discuss the applications of our algorithm in recommendation systems and polar decomposition. Our work explores new avenues for quantum information processing beyond the conventional protocols that only works for Hermitian data, and reveals the capability of matrix decomposition on near-term quantum devices.
This research paper explores the application of singular value decomposition (SVD) in quantum image processing (QIP), specifically focusing on the computation of eigenvalues using variational quantum algorithms. SVD is a powerful mathematical tool in image processing, used for tasks such as image compression, noise reduction, and feature extraction. In this study, we propose quantum variational singular value decomposition (QVSVD) based on the variational quantum deflation (VQD) algorithm to determine the eigenvalues that contributes in calculating the singular values of the image matrix and eventually doing the SVD. This facilitates the extraction of eigenvalues with exponential speedup on real hardware compared to classical methods. We detail the implementation of this quantum algorithm within the framework of QIP, highlighting its advantages in terms of computational efficiency and accuracy on a Fault-Tolerant Quantum Computing (FTQC). Furthermore, we present a comparative analysis of the quantum and the classical method of SVD, demonstrating the accuracy of the image data. The simulation results validate the theoretical advantages of using quantum algorithms for SVD in image processing. This work not only underscores the potential of quantum computing in enhancing image processing techniques but also sets the stage for future research in the field, exploring more complex image processing tasks and other quantum algorithms. Our findings suggest that quantum image processing can offer unprecedented capabilities, paving the way for advancements in various applications such as medical imaging, remote sensing, and multimedia processing.
We present a variational quantum circuit that produces the singular value decomposition of a bipartite pure state. The proposed circuit, which we name quantum singular value decomposer or QSVD, is made of two unitaries respectively acting on each part of the system. The key idea of the algorithm is to train this circuit so that the final state displays exact output coincidence from both subsystems for every measurement in the computational basis. Such circuit preserves entanglement between the parties and acts as a diagonalizer that delivers the eigenvalues of the Schmidt decomposition. Our algorithm only requires measurements in one single setting, in striking contrast to the 3n settings required by state tomography. Furthermore, the adjoints of the unitaries making the circuit are used to create the eigenvectors of the decomposition up to a global phase. Some further applications of QSVD are readily obtained. The proposed QSVD circuit allows us to construct a SWAP between the two parties of the system without the need of any quantum gate communicating them. We also show that a circuit made with QSVD and CNOTs acts as an encoder of information of the original state onto one of its parties. This idea can be reversed and used to create random states with a precise entanglement structure.
Abstract Tensors are increasingly ubiquitous in various areas of applied mathematics and computing, and tensor decompositions are of practical significance and benefit many applications in data completion, image processing, computer vision, collaborative filtering, etc. Recently, Kilmer and Martin propose a new tensor factorization strategy, tensor singular value decomposition (t-svd), which extends the matrix singular value decomposition to tensors. However, computing t-svd for high dimensional tensors costs much computation and thus cannot efficiently handle large scale datasets. Motivated by advantage of quantum computation, in this paper, we present a quantum algorithm of t-svd for third-order tensors and then extend it to order-p tensors. We prove that our quantum t-svd algorithm for a third-order N dimensional tensor runs in time N polylog ( N ) if we do not recover classical information from the quantum output state. Moreover, we apply our quantum t-svd algorithm to context-aware multidimensional recommendation systems, where we just need to extract partial classical information from the quantum output state, thus achieving low time complexity.
Singular Value Decomposition (SVD) is one of the most useful techniques for analyzing data in linear algebra. SVD decomposes a rectangular real or complex matrix into two orthogonal matrices and one diagonal matrix. The proposed Quantum-SVD algorithm interpolates the non-uniform angles in the Fourier domain. The error of the Quantum-SVD approach is some orders lower than the error given by ordinary Quantum Fourier Transformation. Our Quantum-SVD algorithm is a fundamentally novel approach for the computation of the Quantum Fourier Transformation (QFT) of non-uniform states. The presented Quantum-SVD algorithm is based on the singular value decomposition mechanism, and the computation of Quantum Fourier Transformation of non-uniform angles of a quantum system. The Quantum-SVD approach provides advantages in terms of computational structure, being based on QFT and multiplications.
Abstract We propose the variational quantum singular value decomposition based on encoding the elements of the considered N × N matrix into the state of a quantum system of appropriate dimension. This method doesn’t use the expansion of this matrix in terms of the unitary matrices. Controlled measurement is involved to avoid small success probability in ancilla measurement. The objective function for maximization algorithm can be obtained probabilistically via measurement of the states of two one-qubit subsystems. The circuit requires O (log N ) qubits for realization of this algorithm whose depths is proportional to log N / ε , where ε is the precision required for calculation of singular values.