Constraint Preserving Mixers for the Quantum Approximate Optimization Algorithm
The quantum approximate optimization algorithm/quantum alternating operator ansatz (QAOA) is a heuristic to find approximate solutions of combinatorial optimization problems. Most of the literature is limited to quadratic problems without constraints. However, many practically relevant optimization...
Main Authors: | Franz Georg Fuchs, Kjetil Olsen Lye, Halvor Møll Nilsen, Alexander Johannes Stasik, Giorgio Sartor |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-06-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/15/6/202 |
Similar Items
-
Quantum Approximate Bayesian Optimization Algorithms With Two Mixers and Uncertainty Quantification
by: Jungin E. Kim, et al.
Published: (2023-01-01) -
Exploiting subspace constraints and ab initio variational methods for quantum chemistry
by: Cica Gustiani, et al.
Published: (2023-01-01) -
Improving the performance of quantum approximate optimization for preparing non-trivial quantum states without translational symmetry
by: Zheng-Hang Sun, et al.
Published: (2023-01-01) -
Similarity-based parameter transferability in the quantum approximate optimization algorithm
by: Alexey Galda, et al.
Published: (2023-07-01) -
Connection between single-layer quantum approximate optimization algorithm interferometry and thermal distribution sampling
by: Pablo Díez-Valle, et al.
Published: (2024-02-01)