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

• High order schemes for solving partial differential equations on a quantum computer [0.0]
  We show that higher-order methods can reduce the number of qubits necessary for discretization, similar to the classical case. This result has important consequences for the practical application of quantum algorithms based on Hamiltonian evolution.
  arXiv  Detail & Related papers  (2024-12-26T14:21:59Z)
• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• 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)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data. We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML. The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• 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)
• 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)
• 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 Causal Unravelling [44.356294905844834]
  We develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography.
  arXiv  Detail & Related papers  (2021-09-27T16:28:06Z)
• 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)

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.