Quantum Spectral Clustering through a Biased Phase Estimation Algorithm
arXiv:1703.05568
Abstract
In this brief paper, we go through the theoretical steps of the spectral clustering on quantum computers by employing the phase estimation and the amplitude amplification algorithms. We discuss circuit designs for each step and show how to obtain the clustering solution from the output state. In addition, we introduce a biased version of the phase estimation algorithm which significantly speeds up the amplitude amplification process. The complexity of the whole process is analyzed: it is shown that when the circuit representation of a data matrix of order is produced through an ancilla based circuit in which the matrix is written as a sum of number of Householder matrices; the computational complexity is bounded by number of quantum gates. Here, represents the number of qubits (e.g., 6) involved in the phase register of the phase estimation algorithm.
arXiv comment5 pages, submitted to a conference, and any comments are welcomed
References in corpus (8)
- Quantum Machine Learning
- A Quantum Approximate Optimization Algorithm
- Quantum principal component analysis
- Quantum measurements and the Abelian Stabilizer Problem
- Simulating sparse Hamiltonians with star decompositions
- A Survey of Quantum Learning Theory
- Direct Application of the Phase Estimation Algorithm to Find the Eigenvalues of the Hamiltonians
- A Quantum Implementation Model for Artificial Neural Networks