Obtaining a linear combination of the principal components of a matrix on quantum computers

DOI10.1007/s11128-016-1388-7zbMath1348.81161arXiv1512.02109OpenAlexW3101299833MaRDI QIDQ332101

Ammar Daskin

Publication date: 27 October 2016

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.02109

zbMATH Keywords

principal component analysisquantum algorithmsmultivariate statistical methodsphase estimationquantum amplitude amplification

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

Quantum algorithm for help-training semi-supervised support vector machine ⋮ A Quantum Implementation Model for Artificial Neural Networks ⋮ Quantum data compression by principal component analysis

Uses Software

• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple network alignment on quantum computers
• The quest for a quantum neural network
• On bounds of extremal eigenvalues of irreducible and \(m\)-reducible matrices
• Geometric bounds for eigenvalues of Markov chains
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Generalized Trotter's formula and systematic approximants of exponential operators and inner derivations with applications to many-body problems
• Principal component analysis.
• Bounds for eigenvalues of matrix polynomials
• Quantum speed-up for unsupervised learning
• A universal quantum circuit scheme for finding complex eigenvalues
• Simulating Sparse Hamiltonians with Star Decompositions
• On the Product of Semi-Groups of Operators
• Gershgorin Theory for the Generalized Eigenvalue Problem Ax = λBx
• Probabilistic Principal Component Analysis
• A fast algorithm for approximating the ground state energy on a quantum computer
• Advances in Neural Networks – ISNN 2005
• Counting by quantum eigenvalue estimation