27 June 2020
##
Quantum optimization for linear algebra problems

Qu&Co comments on this publication:

One hallmark problem in computational linear algebra is the binary linear least squares (BLLS), which is formally in the NP-Hard complexity class. Efficient classical methods for solving this problem exists with limited approximations to the solution. Quantum computing may solve these problems with a better approximation ratio and/or in a faster runtime scaling. So-far, this problem has only been considered on a quantum annealing by mapping it to a QUBO. In this paper, the problem is solved using a QAOA approach on the gate-based model of quantum computing. The performance is assessed both on a wavefunction simulator, shotnoise simulator and on the 5-qubit IBM cloud computing quantum device ibmq_london. As an outlook: BLLS may serve as a building block for other problems such as Non-negative Binary Matrix Factorization, or clubbed together for a fixed-point approximation of real variables. This paper was partially supervised by Vincent Elfving from Qu & Co.

Published in
Blog

Tagged under

- The Inductive Bias of Quantum Kernels 07 June 2021 in Blog
- Quantum Chemistry in First Quantization 26 May 2021 in Blog
- Preparation and verification of tensor network states 14 May 2021 in Blog
- Unification of Computation 12 May 2021 in Blog
- Benchmarking Quantum Computers: what the Q? 03 May 2021 in Blog
- Quantum Architecture Learning 25 April 2021 in Blog

Copyright © Qu & Co BV