Quantum Approximate Bayesian Optimization Algorithms With Two Mixers and Uncertainty Quantification
The searching efficiency of the quantum approximate optimization algorithm is dependent on both the classical and quantum sides of the algorithm. Recently, a quantum approximate Bayesian optimization algorithm (QABOA) that includes two mixers was developed, where surrogate-based Bayesian optimizatio...
Main Authors: | Jungin E. Kim, Yan Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Transactions on Quantum Engineering |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10296859/ |
Similar Items
-
Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem
by: Wenyang Qian, et al.
Published: (2023-08-01) -
Bayesian Optimization for QAOA
by: Simone Tibaldi, et al.
Published: (2023-01-01) -
Variational Quantum Optimization of Nonlocality in Noisy Quantum Networks
by: Brian Doolittle, 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) -
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)