Quantum approximate optimization for hard problems in linear algebra
The quantum approximate optimization algorithm (QAOA) by Farhi et al. is a quantum computational framework for solving quantum or classical optimization tasks. Here, we explore using QAOA for binary linear least squares (BLLS); a problem that can serve as a building block of several other hard probl...
Saved in:
Main Author: | Ajinkya Borle, Vincent E. Elfving, Samuel J. Lomonaco |
---|---|
Format: | article |
Language: | EN |
Published: |
SciPost
2021
|
Subjects: | |
Online Access: | https://doaj.org/article/f4cd35313c20476585a2eeafa2ddea53 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
by: Leo Zhou, et al.
Published: (2020) -
Continuous Symmetries and Approximate Quantum Error Correction
by: Philippe Faist, et al.
Published: (2020) -
Classical variational simulation of the Quantum Approximate Optimization Algorithm
by: Matija Medvidović, et al.
Published: (2021) -
Entropy Scaling Law and the Quantum Marginal Problem
by: Isaac H. Kim
Published: (2021) -
An algebraic classification of solution generating techniques
by: Riccardo Borsato, et al.
Published: (2021)