Variational Quantum Singular Value Decomposition
- URL: http://arxiv.org/abs/2006.02336v3
- Date: Thu, 24 Jun 2021 16:06:30 GMT
- Title: Variational Quantum Singular Value Decomposition
- Authors: Xin Wang, Zhixin Song, Youle Wang
- Abstract summary: 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 could be trained to learn the singular vectors and output the corresponding singular values.
Our work explores new avenues for quantum information processing beyond the conventional protocols that only works for Hermitian data.
- Score: 8.145223158030259
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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.
Related papers
- Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Randomized semi-quantum matrix processing [0.0]
We present a hybrid quantum-classical framework for Monte-Carlo simulation of generic matrix functions.
Our framework provides a pathway towards early fault-tolerant quantum linear algebra applications.
arXiv Detail & Related papers (2023-07-21T18:00:28Z) - Robust Dequantization of the Quantum Singular value Transformation and
Quantum Machine Learning Algorithms [0.0]
We show how many techniques from randomized linear algebra can be adapted to work under this weaker assumption.
We also apply these results to obtain a robust dequantization of many quantum machine learning algorithms.
arXiv Detail & Related papers (2023-04-11T02:09:13Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Quantum algorithms for grid-based variational time evolution [36.136619420474766]
We propose a variational quantum algorithm for performing quantum dynamics in first quantization.
Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
arXiv Detail & Related papers (2022-03-04T19:00:45Z) - Dequantizing the Quantum Singular Value Transformation: Hardness and
Applications to Quantum Chemistry and the Quantum PCP Conjecture [0.0]
We show that the Quantum Singular Value Transformation can be efficiently "dequantized"
We show that with inverse-polynomial precision, the same problem becomes BQP-complete.
We also discuss how this dequantization technique may help make progress on the central quantum PCP.
arXiv Detail & Related papers (2021-11-17T12:50:13Z) - Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard.
We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware.
The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
arXiv Detail & Related papers (2021-07-08T17:59:55Z) - Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task.
Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate.
The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
arXiv Detail & Related papers (2021-06-06T13:15:25Z) - A Grand Unification of Quantum Algorithms [0.0]
A number of quantum algorithms were recently tied together by a technique known as the quantum singular value transformation.
This paper provides a tutorial through these developments, first illustrating how quantum signal processing may be generalized to the quantum eigenvalue transform.
We then employ QSVT to construct intuitive quantum algorithms for search, phase estimation, and Hamiltonian simulation.
arXiv Detail & Related papers (2021-05-06T17:46:33Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z) - Programming a quantum computer with quantum instructions [39.994876450026865]
We use a density matrixiation protocol to execute quantum instructions on quantum data.
A fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state.
The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation.
arXiv Detail & Related papers (2020-01-23T22:43:29Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.