An efficient quantum algorithm for independent component analysis
- URL: http://arxiv.org/abs/2311.12529v1
- Date: Tue, 21 Nov 2023 11:21:23 GMT
- Title: An efficient quantum algorithm for independent component analysis
- Authors: Xiao-Fan Xu, Cheng Xue, Zhao-Yun Chen, Yu-Chun Wu and Guo-Ping Guo
- Abstract summary: Independent component analysis (ICA) is a fundamental data processing technique to decompose the captured signals into as independent as possible components.
This paper presents a quantum ICA algorithm which focuses on computing a specified contrast function on a quantum computer.
- Score: 3.400945485383699
- License: http://creativecommons.org/publicdomain/zero/1.0/
- Abstract: Independent component analysis (ICA) is a fundamental data processing
technique to decompose the captured signals into as independent as possible
components. Computing the contrast function, which serves as a measure of
independence of signals, is vital in the separation process using ICA. This
paper presents a quantum ICA algorithm which focuses on computing a specified
contrast function on a quantum computer. Using the quantum acceleration in
matrix operations, we efficiently deal with Gram matrices and estimate the
contrast function with the complexity of
$O(\epsilon_1^{-2}\mbox{poly}\log(N/\epsilon_1))$. This estimation subprogram,
combined with the classical optimization framework, enables our quantum ICA
algorithm, which exponentially reduces the complexity dependence on the data
scale compared with classical algorithms. The outperformance is further
supported by numerical experiments, while a source separation of a
transcriptomic dataset is shown as an example of application.
Related papers
- Boundary Treatment for Variational Quantum Simulations of Partial Differential Equations on Quantum Computers [1.6318838452579472]
The paper presents a variational quantum algorithm to solve initial-boundary value problems described by partial differential equations.
The approach uses classical/quantum hardware that is well suited for quantum computers of the current noisy intermediate-scale quantum era.
arXiv Detail & Related papers (2024-02-28T18:19:33Z) - D4FT: A Deep Learning Approach to Kohn-Sham Density Functional Theory [79.50644650795012]
We propose a deep learning approach to solve Kohn-Sham Density Functional Theory (KS-DFT)
We prove that such an approach has the same expressivity as the SCF method, yet reduces the computational complexity.
In addition, we show that our approach enables us to explore more complex neural-based wave functions.
arXiv Detail & Related papers (2023-03-01T10:38:10Z) - Say NO to Optimization: A Non-Orthogonal Quantum Eigensolver [0.0]
A balanced description of both static and dynamic correlations in electronic systems with nearly degenerate low-lying states presents a challenge for multi-configurational methods on classical computers.
We present here a quantum algorithm utilizing the action of correlating cluster operators to provide high-quality wavefunction ans"atze.
arXiv Detail & Related papers (2022-05-18T16:20:36Z) - Quantum Extremal Learning [0.8937790536664091]
We propose a quantum algorithm for extremal learning', which is the process of finding the input to a hidden function that extremizes the function output.
The algorithm, called quantum extremal learning (QEL), consists of a parametric quantum circuit that is variationally trained to model data input-output relationships.
arXiv Detail & Related papers (2022-05-05T17:37:26Z) - Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces.
We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
arXiv Detail & Related papers (2022-04-20T21:15:38Z) - Benchmarking Small-Scale Quantum Devices on Computing Graph Edit
Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical.
In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35:26Z) - Compressive Independent Component Analysis: Theory and Algorithms [16.594813920535486]
We look at the independent component analysis (ICA) model through the compressive learning lens.
We show that solutions to the cumulant based ICA model have particular structure that induces a low dimensional model set.
We propose two algorithms of the form of an iterative gradient projection (IPG) and an alternating steepest descent (ASD) algorithm for compressive ICA.
arXiv Detail & Related papers (2021-10-15T12:19:07Z) - Lossy compression of statistical data using quantum annealer [1.433758865948252]
We present a new lossy compression algorithm for statistical floating-point data.
The algorithm finds a set of basis vectors and their binary coefficients that precisely reconstruct the original data.
The compression algorithm is demonstrated on two different datasets of lattice quantum chromodynamics simulations.
arXiv Detail & Related papers (2021-10-05T16:16:41Z) - Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron
Correlation [58.720142291102135]
We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer.
We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
arXiv Detail & Related papers (2021-06-22T18:00:00Z) - Quantum Algorithms for Data Representation and Analysis [68.754953879193]
We provide quantum procedures that speed-up the solution of eigenproblems for data representation in machine learning.
The power and practical use of these subroutines is shown through new quantum algorithms, sublinear in the input matrix's size, for principal component analysis, correspondence analysis, and latent semantic analysis.
Results show that the run-time parameters that do not depend on the input's size are reasonable and that the error on the computed model is small, allowing for competitive classification performances.
arXiv Detail & Related papers (2021-04-19T00:41:43Z) - Stochastic Approximation for Online Tensorial Independent Component
Analysis [98.34292831923335]
Independent component analysis (ICA) has been a popular dimension reduction tool in statistical machine learning and signal processing.
In this paper, we present a by-product online tensorial algorithm that estimates for each independent component.
arXiv Detail & Related papers (2020-12-28T18:52:37Z)
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.