Presentation + Paper
5 June 2020 Approximate graph spectral decomposition with the Variational Quantum Eigensolver
Josh Payne, Mario Srouji
Author Affiliations +
Abstract
Spectral graph theory is a branch of mathematics that studies the relationships between the eigenvectors and eigenvalues of Laplacian and adjacency matrices and their associated graphs. The Variational Quantum Eigen- solver (VQE) algorithm was proposed as a hybrid quantum/classical algorithm that is used to quickly determine the ground state of a Hamiltonian, and more generally, the lowest eigenvalue of a matrix M ∈ Rnxn. There are many interesting problems associated with the spectral decompositions of associated matrices, such as partitioning, embedding, and the determination of other properties. In this paper, we will expand upon the VQE algorithm to analyze the spectra of directed and undirected graphs. We evaluate runtime and accuracy comparisons (empirically and theoretically) between different choices of ansatz parameters, graph sizes, graph densities, and matrix types, and demonstrate the effectiveness of our approach on Rigetti's QCS platform on graphs of up to 64 vertices, finding eigenvalues of adjacency and Laplacian matrices. We finally make direct comparisons to classical performance with the Quantum Virtual Machine (QVM) in the appendix, observing a superpolynomial runtime improvement of our algorithm when run using a quantum computer.*
Conference Presentation
© (2020) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Josh Payne and Mario Srouji "Approximate graph spectral decomposition with the Variational Quantum Eigensolver", Proc. SPIE 11391, Quantum Information Science, Sensing, and Computation XII, 113910I (5 June 2020); https://doi.org/10.1117/12.2542854
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Matrices

Quantum computing

Quantum communications

Algorithms

Quantum efficiency

Quantum physics

Computer science

RELATED CONTENT

Spin networks and anyonic topological computing II
Proceedings of SPIE (April 25 2007)
Topological quantum computing and the Jones polynomial
Proceedings of SPIE (May 12 2006)
A quantum manual for computing the Jones polynomial
Proceedings of SPIE (March 24 2008)
Is quantum parallelism real?
Proceedings of SPIE (April 03 2008)
Quantum algorithms for the Jones polynomial
Proceedings of SPIE (April 16 2010)

Back to Top